./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-34.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c1e424fdb45007bba7dcf6b9c7609abd758db94a72eb27633df48ff94056907f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:47:20,439 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:47:20,527 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:47:20,534 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:47:20,534 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:47:20,561 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:47:20,562 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:47:20,562 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:47:20,563 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:47:20,563 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:47:20,563 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:47:20,564 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:47:20,565 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:47:20,566 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:47:20,567 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:47:20,567 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:47:20,567 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:47:20,568 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:47:20,568 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:47:20,568 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:47:20,568 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:47:20,569 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:47:20,570 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:47:20,570 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:47:20,571 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:47:20,571 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:47:20,571 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:47:20,576 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:47:20,577 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:47:20,577 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:47:20,577 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:47:20,577 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:47:20,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:47:20,578 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:47:20,578 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:47:20,578 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:47:20,578 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:47:20,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:47:20,579 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:47:20,579 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:47:20,579 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:47:20,580 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:47:20,580 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c1e424fdb45007bba7dcf6b9c7609abd758db94a72eb27633df48ff94056907f [2024-10-24 11:47:20,824 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:47:20,850 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:47:20,852 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:47:20,854 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:47:20,854 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:47:20,855 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-34.i [2024-10-24 11:47:22,345 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:47:22,528 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:47:22,529 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-34.i [2024-10-24 11:47:22,537 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5ffed3b2/0239cb3286b741419207a2b4fdcec963/FLAG8285890a0 [2024-10-24 11:47:22,910 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5ffed3b2/0239cb3286b741419207a2b4fdcec963 [2024-10-24 11:47:22,913 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:47:22,915 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:47:22,918 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:47:22,918 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:47:22,924 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:47:22,925 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:47:22" (1/1) ... [2024-10-24 11:47:22,926 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16bbd993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:47:22, skipping insertion in model container [2024-10-24 11:47:22,926 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:47:22" (1/1) ... [2024-10-24 11:47:22,956 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:47:23,136 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-34.i[916,929] [2024-10-24 11:47:23,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:47:23,208 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:47:23,218 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-34.i[916,929] [2024-10-24 11:47:23,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:47:23,294 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:47:23,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:47:23 WrapperNode [2024-10-24 11:47:23,295 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:47:23,296 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:47:23,296 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:47:23,297 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:47:23,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:47:23" (1/1) ... [2024-10-24 11:47:23,322 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:47:23" (1/1) ... [2024-10-24 11:47:23,385 INFO L138 Inliner]: procedures = 29, calls = 150, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 435 [2024-10-24 11:47:23,388 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:47:23,389 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:47:23,390 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:47:23,390 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:47:23,401 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:47:23" (1/1) ... [2024-10-24 11:47:23,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:47:23" (1/1) ... [2024-10-24 11:47:23,407 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:47:23" (1/1) ... [2024-10-24 11:47:23,427 INFO L175 MemorySlicer]: Split 115 memory accesses to 2 slices as follows [2, 113]. 98 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 16]. The 18 writes are split as follows [0, 18]. [2024-10-24 11:47:23,427 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:47:23" (1/1) ... [2024-10-24 11:47:23,428 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:47:23" (1/1) ... [2024-10-24 11:47:23,443 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:47:23" (1/1) ... [2024-10-24 11:47:23,449 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:47:23" (1/1) ... [2024-10-24 11:47:23,456 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:47:23" (1/1) ... [2024-10-24 11:47:23,458 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:47:23" (1/1) ... [2024-10-24 11:47:23,463 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:47:23,464 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:47:23,464 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:47:23,464 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:47:23,465 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:47:23" (1/1) ... [2024-10-24 11:47:23,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:47:23,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:47:23,517 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:47:23,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:47:23,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:47:23,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 11:47:23,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 11:47:23,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 11:47:23,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 11:47:23,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 11:47:23,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 11:47:23,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 11:47:23,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 11:47:23,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 11:47:23,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 11:47:23,578 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:47:23,578 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:47:23,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:47:23,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 11:47:23,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:47:23,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:47:23,689 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:47:23,691 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:47:24,167 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2024-10-24 11:47:24,168 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:47:24,202 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:47:24,203 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:47:24,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:47:24 BoogieIcfgContainer [2024-10-24 11:47:24,204 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:47:24,207 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:47:24,208 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:47:24,211 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:47:24,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:47:22" (1/3) ... [2024-10-24 11:47:24,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d9a6036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:47:24, skipping insertion in model container [2024-10-24 11:47:24,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:47:23" (2/3) ... [2024-10-24 11:47:24,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d9a6036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:47:24, skipping insertion in model container [2024-10-24 11:47:24,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:47:24" (3/3) ... [2024-10-24 11:47:24,214 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-34.i [2024-10-24 11:47:24,227 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:47:24,228 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:47:24,296 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:47:24,303 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1f84d06a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:47:24,303 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:47:24,307 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 88 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 11:47:24,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-24 11:47:24,319 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:47:24,320 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:47:24,321 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:47:24,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:47:24,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1982887210, now seen corresponding path program 1 times [2024-10-24 11:47:24,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:47:24,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810699919] [2024-10-24 11:47:24,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:47:24,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:47:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:24,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:47:24,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:24,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:47:24,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:24,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:47:24,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:24,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:47:24,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:24,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:47:24,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:24,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:47:24,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:24,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:47:24,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:24,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:47:24,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:24,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:47:24,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:24,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:47:24,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:24,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:47:24,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:24,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:47:24,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:24,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:47:24,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:24,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:47:24,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:24,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:47:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:24,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:47:24,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:24,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:47:24,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:24,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:47:24,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:24,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:47:24,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:24,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:47:24,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:24,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:47:24,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:24,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:47:24,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:24,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:47:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:24,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:47:24,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:47:24,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810699919] [2024-10-24 11:47:24,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810699919] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:47:24,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:47:24,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:47:24,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191386541] [2024-10-24 11:47:24,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:47:24,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:47:24,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:47:24,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:47:24,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:47:24,886 INFO L87 Difference]: Start difference. First operand has 113 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 88 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 11:47:24,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:47:24,942 INFO L93 Difference]: Finished difference Result 223 states and 357 transitions. [2024-10-24 11:47:24,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:47:24,945 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 166 [2024-10-24 11:47:24,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:47:24,954 INFO L225 Difference]: With dead ends: 223 [2024-10-24 11:47:24,955 INFO L226 Difference]: Without dead ends: 111 [2024-10-24 11:47:24,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:47:24,965 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:47:24,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:47:24,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-24 11:47:25,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-10-24 11:47:25,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 11:47:25,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 163 transitions. [2024-10-24 11:47:25,016 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 163 transitions. Word has length 166 [2024-10-24 11:47:25,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:47:25,017 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 163 transitions. [2024-10-24 11:47:25,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 11:47:25,018 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 163 transitions. [2024-10-24 11:47:25,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-24 11:47:25,023 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:47:25,023 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:47:25,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:47:25,024 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:47:25,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:47:25,027 INFO L85 PathProgramCache]: Analyzing trace with hash 799028980, now seen corresponding path program 1 times [2024-10-24 11:47:25,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:47:25,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341316130] [2024-10-24 11:47:25,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:47:25,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:47:25,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:25,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:47:25,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:25,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:47:25,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:25,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:47:25,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:25,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:47:25,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:25,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:47:25,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:25,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:47:25,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:25,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:47:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:25,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:47:25,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:25,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:47:25,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:25,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:47:25,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:25,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:47:25,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:25,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:47:25,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:25,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:47:25,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:25,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:47:25,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:25,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:47:25,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:25,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:47:25,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:25,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:47:25,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:25,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:47:25,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:25,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:47:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:25,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:47:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:25,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:47:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:25,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:47:25,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:25,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:47:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:25,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:47:25,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:47:25,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341316130] [2024-10-24 11:47:25,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341316130] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:47:25,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:47:25,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:47:25,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408010209] [2024-10-24 11:47:25,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:47:25,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:47:25,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:47:25,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:47:25,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:47:25,376 INFO L87 Difference]: Start difference. First operand 111 states and 163 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:47:25,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:47:25,424 INFO L93 Difference]: Finished difference Result 222 states and 327 transitions. [2024-10-24 11:47:25,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:47:25,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 166 [2024-10-24 11:47:25,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:47:25,427 INFO L225 Difference]: With dead ends: 222 [2024-10-24 11:47:25,428 INFO L226 Difference]: Without dead ends: 112 [2024-10-24 11:47:25,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:47:25,433 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:47:25,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 311 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:47:25,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-24 11:47:25,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-10-24 11:47:25,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 87 states have (on average 1.3563218390804597) internal successors, (118), 87 states have internal predecessors, (118), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 11:47:25,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 164 transitions. [2024-10-24 11:47:25,457 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 164 transitions. Word has length 166 [2024-10-24 11:47:25,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:47:25,459 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 164 transitions. [2024-10-24 11:47:25,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:47:25,459 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 164 transitions. [2024-10-24 11:47:25,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-24 11:47:25,461 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:47:25,462 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:47:25,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:47:25,462 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:47:25,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:47:25,463 INFO L85 PathProgramCache]: Analyzing trace with hash -889914762, now seen corresponding path program 1 times [2024-10-24 11:47:25,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:47:25,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085440045] [2024-10-24 11:47:25,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:47:25,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:47:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:25,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:47:25,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:25,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:47:25,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:25,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:47:25,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:25,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:47:25,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:25,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:47:25,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:25,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:47:25,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:25,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:47:25,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:25,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:47:25,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:25,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:47:25,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:25,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:47:25,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:25,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:47:25,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:25,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:47:25,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:25,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:47:25,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:25,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:47:25,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:25,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:47:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:25,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:47:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:25,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:47:25,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:25,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:47:25,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:25,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:47:25,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:25,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:47:25,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:25,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:47:25,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:25,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:47:25,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:25,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:47:25,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:25,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:47:25,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:47:25,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085440045] [2024-10-24 11:47:25,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085440045] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:47:25,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:47:25,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:47:25,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937232423] [2024-10-24 11:47:25,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:47:25,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:47:25,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:47:25,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:47:25,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:47:25,913 INFO L87 Difference]: Start difference. First operand 112 states and 164 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:47:25,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:47:25,965 INFO L93 Difference]: Finished difference Result 225 states and 330 transitions. [2024-10-24 11:47:25,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:47:25,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 166 [2024-10-24 11:47:25,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:47:25,968 INFO L225 Difference]: With dead ends: 225 [2024-10-24 11:47:25,970 INFO L226 Difference]: Without dead ends: 114 [2024-10-24 11:47:25,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:47:25,973 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:47:25,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 464 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:47:25,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-24 11:47:25,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-10-24 11:47:25,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.348314606741573) internal successors, (120), 89 states have internal predecessors, (120), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 11:47:25,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 166 transitions. [2024-10-24 11:47:25,995 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 166 transitions. Word has length 166 [2024-10-24 11:47:25,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:47:25,996 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 166 transitions. [2024-10-24 11:47:25,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:47:25,996 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 166 transitions. [2024-10-24 11:47:25,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-24 11:47:25,998 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:47:25,998 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:47:25,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:47:25,999 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:47:25,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:47:26,000 INFO L85 PathProgramCache]: Analyzing trace with hash -543757980, now seen corresponding path program 1 times [2024-10-24 11:47:26,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:47:26,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302899323] [2024-10-24 11:47:26,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:47:26,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:47:26,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:47:26,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:47:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:47:26,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:47:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:47:26,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:47:26,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:47:26,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:47:26,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:47:26,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:47:26,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:47:26,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:47:26,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:47:26,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:47:26,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:47:26,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:47:26,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:47:26,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:47:26,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:47:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:47:26,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:47:26,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:47:26,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:47:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:47:26,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:47:26,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302899323] [2024-10-24 11:47:26,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302899323] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:47:26,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:47:26,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:47:26,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886842394] [2024-10-24 11:47:26,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:47:26,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:47:26,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:47:26,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:47:26,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:47:26,155 INFO L87 Difference]: Start difference. First operand 114 states and 166 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:47:26,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:47:26,186 INFO L93 Difference]: Finished difference Result 276 states and 402 transitions. [2024-10-24 11:47:26,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:47:26,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 168 [2024-10-24 11:47:26,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:47:26,188 INFO L225 Difference]: With dead ends: 276 [2024-10-24 11:47:26,188 INFO L226 Difference]: Without dead ends: 163 [2024-10-24 11:47:26,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:47:26,190 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 56 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:47:26,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 309 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:47:26,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-24 11:47:26,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 133. [2024-10-24 11:47:26,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 108 states have (on average 1.3703703703703705) internal successors, (148), 108 states have internal predecessors, (148), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 11:47:26,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 194 transitions. [2024-10-24 11:47:26,204 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 194 transitions. Word has length 168 [2024-10-24 11:47:26,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:47:26,205 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 194 transitions. [2024-10-24 11:47:26,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:47:26,205 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 194 transitions. [2024-10-24 11:47:26,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-24 11:47:26,210 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:47:26,212 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:47:26,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:47:26,212 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:47:26,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:47:26,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1410011260, now seen corresponding path program 1 times [2024-10-24 11:47:26,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:47:26,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310134018] [2024-10-24 11:47:26,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:47:26,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:47:26,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:47:26,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:47:26,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:47:26,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:47:26,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:47:26,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:47:26,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:47:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:47:26,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:47:26,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:47:26,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:47:26,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:47:26,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:47:26,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:47:26,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:47:26,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:47:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:47:26,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:47:26,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:47:26,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:47:26,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:47:26,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:47:26,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:47:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:47:26,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:47:26,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310134018] [2024-10-24 11:47:26,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310134018] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:47:26,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:47:26,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:47:26,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507005012] [2024-10-24 11:47:26,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:47:26,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:47:26,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:47:26,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:47:26,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:47:26,355 INFO L87 Difference]: Start difference. First operand 133 states and 194 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:47:26,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:47:26,382 INFO L93 Difference]: Finished difference Result 266 states and 389 transitions. [2024-10-24 11:47:26,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:47:26,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 171 [2024-10-24 11:47:26,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:47:26,385 INFO L225 Difference]: With dead ends: 266 [2024-10-24 11:47:26,387 INFO L226 Difference]: Without dead ends: 134 [2024-10-24 11:47:26,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:47:26,389 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:47:26,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 311 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:47:26,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-24 11:47:26,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-10-24 11:47:26,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 109 states have (on average 1.3669724770642202) internal successors, (149), 109 states have internal predecessors, (149), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 11:47:26,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 195 transitions. [2024-10-24 11:47:26,412 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 195 transitions. Word has length 171 [2024-10-24 11:47:26,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:47:26,412 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 195 transitions. [2024-10-24 11:47:26,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:47:26,413 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 195 transitions. [2024-10-24 11:47:26,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-24 11:47:26,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:47:26,416 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:47:26,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 11:47:26,416 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:47:26,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:47:26,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1151845822, now seen corresponding path program 1 times [2024-10-24 11:47:26,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:47:26,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055259671] [2024-10-24 11:47:26,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:47:26,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:47:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:47:26,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:47:26,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:47:26,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:47:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:47:26,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:47:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:47:26,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:47:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:47:26,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:47:26,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:47:26,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:47:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:47:26,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:47:26,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:47:26,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:47:26,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:47:26,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:47:26,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:47:26,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:47:26,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:47:26,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:26,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:47:27,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:27,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:47:27,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:27,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:47:27,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:47:27,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055259671] [2024-10-24 11:47:27,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055259671] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:47:27,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:47:27,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:47:27,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526732254] [2024-10-24 11:47:27,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:47:27,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:47:27,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:47:27,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:47:27,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:47:27,008 INFO L87 Difference]: Start difference. First operand 134 states and 195 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 11:47:27,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:47:27,309 INFO L93 Difference]: Finished difference Result 263 states and 383 transitions. [2024-10-24 11:47:27,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:47:27,312 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 171 [2024-10-24 11:47:27,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:47:27,313 INFO L225 Difference]: With dead ends: 263 [2024-10-24 11:47:27,313 INFO L226 Difference]: Without dead ends: 130 [2024-10-24 11:47:27,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:47:27,314 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 184 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:47:27,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 186 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:47:27,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-24 11:47:27,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2024-10-24 11:47:27,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 103 states have (on average 1.3495145631067962) internal successors, (139), 103 states have internal predecessors, (139), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 11:47:27,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 185 transitions. [2024-10-24 11:47:27,334 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 185 transitions. Word has length 171 [2024-10-24 11:47:27,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:47:27,335 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 185 transitions. [2024-10-24 11:47:27,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 11:47:27,335 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 185 transitions. [2024-10-24 11:47:27,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-24 11:47:27,338 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:47:27,338 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:47:27,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 11:47:27,338 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:47:27,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:47:27,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1774683992, now seen corresponding path program 1 times [2024-10-24 11:47:27,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:47:27,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132937980] [2024-10-24 11:47:27,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:47:27,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:47:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:28,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:47:28,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:28,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:47:28,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:28,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:47:28,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:28,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:47:28,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:28,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:47:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:28,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:47:28,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:28,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:47:28,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:28,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:47:28,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:28,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:47:28,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:28,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:47:28,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:28,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:47:28,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:28,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:47:28,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:28,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:47:28,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:28,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:47:28,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:28,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:47:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:28,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:47:28,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:28,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:47:28,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:28,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:47:28,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:28,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:47:28,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:28,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:47:28,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:28,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:47:28,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:28,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:47:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:28,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:47:28,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:28,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:47:28,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:47:28,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132937980] [2024-10-24 11:47:28,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132937980] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:47:28,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:47:28,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:47:28,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210589104] [2024-10-24 11:47:28,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:47:28,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:47:28,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:47:28,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:47:28,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:47:28,098 INFO L87 Difference]: Start difference. First operand 128 states and 185 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 11:47:28,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:47:28,459 INFO L93 Difference]: Finished difference Result 253 states and 366 transitions. [2024-10-24 11:47:28,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:47:28,460 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 173 [2024-10-24 11:47:28,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:47:28,462 INFO L225 Difference]: With dead ends: 253 [2024-10-24 11:47:28,462 INFO L226 Difference]: Without dead ends: 126 [2024-10-24 11:47:28,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:47:28,463 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 163 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:47:28,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 224 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:47:28,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-24 11:47:28,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2024-10-24 11:47:28,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 100 states have (on average 1.34) internal successors, (134), 100 states have internal predecessors, (134), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 11:47:28,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 180 transitions. [2024-10-24 11:47:28,477 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 180 transitions. Word has length 173 [2024-10-24 11:47:28,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:47:28,477 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 180 transitions. [2024-10-24 11:47:28,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 11:47:28,478 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 180 transitions. [2024-10-24 11:47:28,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-24 11:47:28,480 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:47:28,480 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:47:28,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 11:47:28,481 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:47:28,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:47:28,482 INFO L85 PathProgramCache]: Analyzing trace with hash 556345530, now seen corresponding path program 1 times [2024-10-24 11:47:28,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:47:28,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49461017] [2024-10-24 11:47:28,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:47:28,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:47:28,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:28,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:47:28,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:28,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:47:28,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:28,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:47:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:28,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:47:28,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:28,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:47:28,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:28,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:47:28,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:28,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:47:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:28,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:47:28,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:28,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:47:28,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:28,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:47:28,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:28,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:47:28,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:28,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:47:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:28,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:47:28,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:28,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:47:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:28,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:47:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:28,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:47:28,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:28,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:47:28,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:28,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:47:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:28,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:47:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:28,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:47:28,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:28,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:47:28,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:28,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:47:28,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:28,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:47:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:28,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:47:28,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:47:28,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49461017] [2024-10-24 11:47:28,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49461017] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:47:28,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:47:28,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:47:28,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264299306] [2024-10-24 11:47:28,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:47:28,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:47:28,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:47:28,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:47:28,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:47:28,631 INFO L87 Difference]: Start difference. First operand 125 states and 180 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:47:28,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:47:28,662 INFO L93 Difference]: Finished difference Result 274 states and 393 transitions. [2024-10-24 11:47:28,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:47:28,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 173 [2024-10-24 11:47:28,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:47:28,665 INFO L225 Difference]: With dead ends: 274 [2024-10-24 11:47:28,665 INFO L226 Difference]: Without dead ends: 150 [2024-10-24 11:47:28,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:47:28,666 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 50 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:47:28,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 337 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:47:28,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-24 11:47:28,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 125. [2024-10-24 11:47:28,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 100 states have (on average 1.31) internal successors, (131), 100 states have internal predecessors, (131), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 11:47:28,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 177 transitions. [2024-10-24 11:47:28,682 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 177 transitions. Word has length 173 [2024-10-24 11:47:28,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:47:28,683 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 177 transitions. [2024-10-24 11:47:28,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:47:28,683 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 177 transitions. [2024-10-24 11:47:28,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-24 11:47:28,685 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:47:28,685 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:47:28,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 11:47:28,685 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:47:28,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:47:28,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1906828626, now seen corresponding path program 1 times [2024-10-24 11:47:28,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:47:28,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697313334] [2024-10-24 11:47:28,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:47:28,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:47:28,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:29,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:47:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:29,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:47:29,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:29,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:47:29,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:29,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:47:29,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:29,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:47:29,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:29,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:47:29,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:29,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:47:29,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:29,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:47:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:29,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:47:29,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:29,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:47:29,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:29,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:47:29,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:29,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:47:29,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:29,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:47:29,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:29,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:47:29,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:29,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:47:29,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:29,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:47:29,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:29,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:47:29,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:29,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:47:29,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:29,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:47:29,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:29,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:47:29,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:29,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:47:29,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:29,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:47:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:29,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:47:29,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:29,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:47:29,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:47:29,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697313334] [2024-10-24 11:47:29,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697313334] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:47:29,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:47:29,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 11:47:29,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243961352] [2024-10-24 11:47:29,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:47:29,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:47:29,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:47:29,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:47:29,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:47:29,648 INFO L87 Difference]: Start difference. First operand 125 states and 177 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:47:30,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:47:30,221 INFO L93 Difference]: Finished difference Result 381 states and 538 transitions. [2024-10-24 11:47:30,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 11:47:30,222 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2024-10-24 11:47:30,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:47:30,224 INFO L225 Difference]: With dead ends: 381 [2024-10-24 11:47:30,224 INFO L226 Difference]: Without dead ends: 257 [2024-10-24 11:47:30,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2024-10-24 11:47:30,228 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 134 mSDsluCounter, 1360 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:47:30,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1544 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 11:47:30,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-10-24 11:47:30,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 158. [2024-10-24 11:47:30,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 133 states have (on average 1.3157894736842106) internal successors, (175), 133 states have internal predecessors, (175), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 11:47:30,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 221 transitions. [2024-10-24 11:47:30,243 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 221 transitions. Word has length 175 [2024-10-24 11:47:30,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:47:30,243 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 221 transitions. [2024-10-24 11:47:30,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:47:30,244 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 221 transitions. [2024-10-24 11:47:30,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-24 11:47:30,246 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:47:30,246 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:47:30,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 11:47:30,246 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:47:30,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:47:30,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1995111660, now seen corresponding path program 1 times [2024-10-24 11:47:30,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:47:30,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64712404] [2024-10-24 11:47:30,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:47:30,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:47:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:30,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:47:30,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:30,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:47:30,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:30,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:47:30,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:30,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:47:30,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:30,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:47:30,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:30,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:47:30,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:30,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:47:30,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:30,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:47:30,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:30,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:47:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:30,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:47:30,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:30,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:47:30,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:30,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:47:30,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:30,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:47:30,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:30,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:47:30,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:30,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:47:30,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:30,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:47:30,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:30,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:47:30,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:30,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:47:30,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:30,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:47:30,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:30,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:47:30,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:30,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:47:30,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:30,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:47:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:30,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:47:30,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:30,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:47:30,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:47:30,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64712404] [2024-10-24 11:47:30,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64712404] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:47:30,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:47:30,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:47:30,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987437106] [2024-10-24 11:47:30,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:47:30,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:47:30,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:47:30,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:47:30,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:47:30,412 INFO L87 Difference]: Start difference. First operand 158 states and 221 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:47:30,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:47:30,443 INFO L93 Difference]: Finished difference Result 320 states and 448 transitions. [2024-10-24 11:47:30,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:47:30,444 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2024-10-24 11:47:30,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:47:30,445 INFO L225 Difference]: With dead ends: 320 [2024-10-24 11:47:30,445 INFO L226 Difference]: Without dead ends: 163 [2024-10-24 11:47:30,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:47:30,446 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 1 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:47:30,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 432 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:47:30,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-24 11:47:30,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2024-10-24 11:47:30,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 137 states have (on average 1.3065693430656935) internal successors, (179), 137 states have internal predecessors, (179), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 11:47:30,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 225 transitions. [2024-10-24 11:47:30,459 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 225 transitions. Word has length 175 [2024-10-24 11:47:30,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:47:30,459 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 225 transitions. [2024-10-24 11:47:30,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:47:30,460 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 225 transitions. [2024-10-24 11:47:30,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-24 11:47:30,462 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:47:30,462 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:47:30,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 11:47:30,462 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:47:30,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:47:30,463 INFO L85 PathProgramCache]: Analyzing trace with hash -2041690198, now seen corresponding path program 1 times [2024-10-24 11:47:30,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:47:30,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126989241] [2024-10-24 11:47:30,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:47:30,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:47:30,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:30,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:47:30,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:30,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:47:30,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:30,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:47:30,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:30,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:47:30,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:30,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:47:30,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:30,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:47:30,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:30,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:47:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:30,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:47:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:30,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:47:30,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:30,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:47:30,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:30,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:47:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:30,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:47:30,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:30,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:47:30,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:30,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:47:30,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:30,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:47:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:30,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:47:30,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:30,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:47:30,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:30,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:47:30,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:30,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:47:30,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:30,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:47:30,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:30,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:47:30,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:30,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:47:30,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:30,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:47:30,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:30,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:47:30,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:47:30,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126989241] [2024-10-24 11:47:30,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126989241] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:47:30,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:47:30,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:47:30,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49155923] [2024-10-24 11:47:30,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:47:30,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:47:30,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:47:30,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:47:30,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:47:30,872 INFO L87 Difference]: Start difference. First operand 162 states and 225 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:47:31,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:47:31,064 INFO L93 Difference]: Finished difference Result 368 states and 505 transitions. [2024-10-24 11:47:31,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:47:31,064 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2024-10-24 11:47:31,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:47:31,066 INFO L225 Difference]: With dead ends: 368 [2024-10-24 11:47:31,066 INFO L226 Difference]: Without dead ends: 207 [2024-10-24 11:47:31,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:47:31,067 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 39 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:47:31,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 596 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:47:31,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-10-24 11:47:31,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 199. [2024-10-24 11:47:31,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 171 states have (on average 1.2982456140350878) internal successors, (222), 172 states have internal predecessors, (222), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-24 11:47:31,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 272 transitions. [2024-10-24 11:47:31,081 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 272 transitions. Word has length 175 [2024-10-24 11:47:31,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:47:31,082 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 272 transitions. [2024-10-24 11:47:31,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:47:31,082 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 272 transitions. [2024-10-24 11:47:31,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-24 11:47:31,084 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:47:31,085 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:47:31,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 11:47:31,085 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:47:31,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:47:31,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1242159848, now seen corresponding path program 1 times [2024-10-24 11:47:31,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:47:31,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879310135] [2024-10-24 11:47:31,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:47:31,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:47:31,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:32,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:47:32,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:32,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:47:32,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:32,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:47:32,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:32,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:47:32,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:32,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:47:32,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:32,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:47:32,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:32,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:47:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:32,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:47:32,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:32,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:47:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:32,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:47:32,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:32,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:47:32,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:32,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:47:32,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:32,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:47:32,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:32,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:47:32,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:32,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:47:32,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:32,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:47:32,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:32,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:47:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:32,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:47:32,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:32,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:47:32,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:32,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:47:32,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:32,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:47:32,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:32,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:47:32,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:32,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:47:32,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:32,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:47:32,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:47:32,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879310135] [2024-10-24 11:47:32,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879310135] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:47:32,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:47:32,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:47:32,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035725895] [2024-10-24 11:47:32,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:47:32,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:47:32,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:47:32,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:47:32,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:47:32,445 INFO L87 Difference]: Start difference. First operand 199 states and 272 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 11:47:32,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:47:32,694 INFO L93 Difference]: Finished difference Result 515 states and 698 transitions. [2024-10-24 11:47:32,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:47:32,694 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 175 [2024-10-24 11:47:32,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:47:32,698 INFO L225 Difference]: With dead ends: 515 [2024-10-24 11:47:32,698 INFO L226 Difference]: Without dead ends: 317 [2024-10-24 11:47:32,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:47:32,699 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 41 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:47:32,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 497 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:47:32,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-10-24 11:47:32,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 261. [2024-10-24 11:47:32,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 233 states have (on average 1.3047210300429184) internal successors, (304), 234 states have internal predecessors, (304), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-24 11:47:32,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 354 transitions. [2024-10-24 11:47:32,714 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 354 transitions. Word has length 175 [2024-10-24 11:47:32,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:47:32,714 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 354 transitions. [2024-10-24 11:47:32,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 11:47:32,715 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 354 transitions. [2024-10-24 11:47:32,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-24 11:47:32,716 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:47:32,716 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:47:32,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 11:47:32,717 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:47:32,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:47:32,717 INFO L85 PathProgramCache]: Analyzing trace with hash -2040842132, now seen corresponding path program 1 times [2024-10-24 11:47:32,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:47:32,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636296938] [2024-10-24 11:47:32,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:47:32,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:47:32,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:32,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:47:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:32,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:47:32,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:32,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:47:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:32,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:47:32,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:32,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:47:32,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:32,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:47:32,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:32,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:47:32,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:32,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:47:32,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:32,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:47:32,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:32,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:47:32,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:32,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:47:32,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:32,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:47:32,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:32,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:47:32,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:32,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:47:32,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:32,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:47:32,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:32,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:47:32,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:32,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:47:32,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:32,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:47:32,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:32,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:47:32,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:32,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:47:32,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:32,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:47:32,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:32,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:47:32,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:32,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:47:32,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:32,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:47:32,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:47:32,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636296938] [2024-10-24 11:47:32,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636296938] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:47:32,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:47:32,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:47:32,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941023319] [2024-10-24 11:47:32,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:47:32,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:47:32,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:47:32,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:47:32,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:47:32,859 INFO L87 Difference]: Start difference. First operand 261 states and 354 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:47:32,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:47:32,895 INFO L93 Difference]: Finished difference Result 492 states and 669 transitions. [2024-10-24 11:47:32,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:47:32,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2024-10-24 11:47:32,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:47:32,897 INFO L225 Difference]: With dead ends: 492 [2024-10-24 11:47:32,897 INFO L226 Difference]: Without dead ends: 232 [2024-10-24 11:47:32,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:47:32,899 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 1 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:47:32,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 432 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:47:32,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-10-24 11:47:32,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2024-10-24 11:47:32,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 204 states have (on average 1.2941176470588236) internal successors, (264), 205 states have internal predecessors, (264), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-24 11:47:32,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 314 transitions. [2024-10-24 11:47:32,912 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 314 transitions. Word has length 175 [2024-10-24 11:47:32,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:47:32,912 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 314 transitions. [2024-10-24 11:47:32,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:47:32,913 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 314 transitions. [2024-10-24 11:47:32,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-24 11:47:32,914 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:47:32,915 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:47:32,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 11:47:32,915 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:47:32,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:47:32,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1304199462, now seen corresponding path program 1 times [2024-10-24 11:47:32,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:47:32,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167757992] [2024-10-24 11:47:32,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:47:32,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:47:32,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:34,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:47:34,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:34,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:47:34,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:34,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:47:34,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:34,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:47:34,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:34,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:47:34,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:34,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:47:34,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:34,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:47:34,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:34,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:47:34,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:34,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:47:34,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:34,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:47:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:34,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:47:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:34,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:47:34,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:34,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:47:34,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:34,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:47:34,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:34,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:47:34,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:34,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:47:34,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:34,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:47:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:34,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:47:34,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:34,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:47:34,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:34,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:47:34,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:34,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:47:34,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:34,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:47:34,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:34,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:47:34,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:34,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:47:34,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:47:34,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167757992] [2024-10-24 11:47:34,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167757992] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:47:34,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:47:34,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:47:34,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119342469] [2024-10-24 11:47:34,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:47:34,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:47:34,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:47:34,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:47:34,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:47:34,250 INFO L87 Difference]: Start difference. First operand 232 states and 314 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 11:47:34,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:47:34,454 INFO L93 Difference]: Finished difference Result 615 states and 827 transitions. [2024-10-24 11:47:34,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:47:34,455 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 175 [2024-10-24 11:47:34,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:47:34,457 INFO L225 Difference]: With dead ends: 615 [2024-10-24 11:47:34,457 INFO L226 Difference]: Without dead ends: 384 [2024-10-24 11:47:34,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:47:34,458 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 99 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:47:34,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 404 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:47:34,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-10-24 11:47:34,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 319. [2024-10-24 11:47:34,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 291 states have (on average 1.302405498281787) internal successors, (379), 292 states have internal predecessors, (379), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-24 11:47:34,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 429 transitions. [2024-10-24 11:47:34,474 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 429 transitions. Word has length 175 [2024-10-24 11:47:34,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:47:34,476 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 429 transitions. [2024-10-24 11:47:34,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 11:47:34,477 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 429 transitions. [2024-10-24 11:47:34,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-24 11:47:34,478 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:47:34,479 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:47:34,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 11:47:34,479 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:47:34,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:47:34,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1978802518, now seen corresponding path program 1 times [2024-10-24 11:47:34,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:47:34,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383307317] [2024-10-24 11:47:34,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:47:34,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:47:34,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:34,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:47:34,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:34,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:47:34,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:34,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:47:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:34,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:47:34,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:34,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:47:34,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:34,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:47:34,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:34,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:47:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:34,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:47:34,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:34,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:47:34,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:34,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:47:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:34,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:47:34,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:34,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:47:34,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:34,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:47:34,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:34,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:47:34,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:34,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:47:34,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:34,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:47:34,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:34,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:47:34,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:34,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:47:34,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:34,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:47:34,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:34,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:47:34,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:34,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:47:34,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:34,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:47:34,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:34,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:47:34,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:34,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:47:34,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:47:34,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383307317] [2024-10-24 11:47:34,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383307317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:47:34,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:47:34,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:47:34,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495192094] [2024-10-24 11:47:34,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:47:34,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:47:34,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:47:34,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:47:34,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:47:34,786 INFO L87 Difference]: Start difference. First operand 319 states and 429 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:47:35,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:47:35,015 INFO L93 Difference]: Finished difference Result 648 states and 868 transitions. [2024-10-24 11:47:35,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:47:35,015 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2024-10-24 11:47:35,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:47:35,018 INFO L225 Difference]: With dead ends: 648 [2024-10-24 11:47:35,018 INFO L226 Difference]: Without dead ends: 330 [2024-10-24 11:47:35,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:47:35,021 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 62 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:47:35,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 562 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:47:35,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-10-24 11:47:35,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 294. [2024-10-24 11:47:35,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 266 states have (on average 1.2932330827067668) internal successors, (344), 267 states have internal predecessors, (344), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-24 11:47:35,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 394 transitions. [2024-10-24 11:47:35,038 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 394 transitions. Word has length 175 [2024-10-24 11:47:35,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:47:35,038 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 394 transitions. [2024-10-24 11:47:35,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:47:35,039 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 394 transitions. [2024-10-24 11:47:35,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-24 11:47:35,041 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:47:35,041 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:47:35,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 11:47:35,041 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:47:35,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:47:35,042 INFO L85 PathProgramCache]: Analyzing trace with hash 794726372, now seen corresponding path program 1 times [2024-10-24 11:47:35,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:47:35,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196317951] [2024-10-24 11:47:35,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:47:35,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:47:35,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:35,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:47:35,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:35,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:47:35,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:35,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:47:35,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:35,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:47:35,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:35,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:47:35,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:35,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:47:35,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:35,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:47:35,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:35,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:47:35,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:35,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:47:35,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:35,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:47:35,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:35,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:47:35,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:35,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:47:35,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:35,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:47:35,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:35,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:47:35,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:35,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:47:35,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:35,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:47:35,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:35,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:47:35,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:35,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:47:35,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:35,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:47:35,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:35,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:47:35,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:35,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:47:35,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:35,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:47:35,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:35,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:47:35,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:35,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:47:35,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:47:35,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196317951] [2024-10-24 11:47:35,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196317951] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:47:35,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:47:35,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:47:35,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867752613] [2024-10-24 11:47:35,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:47:35,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:47:35,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:47:35,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:47:35,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:47:35,358 INFO L87 Difference]: Start difference. First operand 294 states and 394 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:47:35,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:47:35,578 INFO L93 Difference]: Finished difference Result 596 states and 791 transitions. [2024-10-24 11:47:35,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:47:35,578 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2024-10-24 11:47:35,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:47:35,580 INFO L225 Difference]: With dead ends: 596 [2024-10-24 11:47:35,580 INFO L226 Difference]: Without dead ends: 303 [2024-10-24 11:47:35,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:47:35,581 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 64 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:47:35,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 675 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:47:35,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-10-24 11:47:35,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 234. [2024-10-24 11:47:35,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 208 states have (on average 1.2788461538461537) internal successors, (266), 208 states have internal predecessors, (266), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 11:47:35,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 312 transitions. [2024-10-24 11:47:35,598 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 312 transitions. Word has length 175 [2024-10-24 11:47:35,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:47:35,599 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 312 transitions. [2024-10-24 11:47:35,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:47:35,599 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 312 transitions. [2024-10-24 11:47:35,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-24 11:47:35,601 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:47:35,601 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:47:35,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 11:47:35,601 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:47:35,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:47:35,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1806691688, now seen corresponding path program 1 times [2024-10-24 11:47:35,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:47:35,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22504138] [2024-10-24 11:47:35,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:47:35,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:47:35,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:36,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:47:36,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:36,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:47:36,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:36,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:47:36,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:36,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:47:36,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:36,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:47:36,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:36,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:47:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:36,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:47:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:36,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:47:36,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:36,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:47:36,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:36,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:47:36,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:36,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:47:36,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:36,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:47:36,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:36,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:47:36,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:36,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:47:36,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:36,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:47:36,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:36,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:47:36,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:36,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:47:36,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:36,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:47:36,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:36,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:47:36,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:36,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:47:36,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:36,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:47:36,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:36,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:47:36,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:36,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:47:36,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:36,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:47:36,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:47:36,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22504138] [2024-10-24 11:47:36,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22504138] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:47:36,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:47:36,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:47:36,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559360464] [2024-10-24 11:47:36,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:47:36,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:47:36,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:47:36,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:47:36,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:47:36,890 INFO L87 Difference]: Start difference. First operand 234 states and 312 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 11:47:37,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:47:37,137 INFO L93 Difference]: Finished difference Result 491 states and 653 transitions. [2024-10-24 11:47:37,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:47:37,137 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 175 [2024-10-24 11:47:37,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:47:37,139 INFO L225 Difference]: With dead ends: 491 [2024-10-24 11:47:37,139 INFO L226 Difference]: Without dead ends: 258 [2024-10-24 11:47:37,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:47:37,140 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 42 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:47:37,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 594 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:47:37,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-10-24 11:47:37,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 234. [2024-10-24 11:47:37,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 208 states have (on average 1.2644230769230769) internal successors, (263), 208 states have internal predecessors, (263), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 11:47:37,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 309 transitions. [2024-10-24 11:47:37,154 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 309 transitions. Word has length 175 [2024-10-24 11:47:37,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:47:37,154 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 309 transitions. [2024-10-24 11:47:37,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 11:47:37,154 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 309 transitions. [2024-10-24 11:47:37,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-24 11:47:37,156 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:47:37,156 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:47:37,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 11:47:37,156 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:47:37,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:47:37,157 INFO L85 PathProgramCache]: Analyzing trace with hash 2064857126, now seen corresponding path program 1 times [2024-10-24 11:47:37,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:47:37,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328878742] [2024-10-24 11:47:37,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:47:37,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:47:37,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:38,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:47:38,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:38,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:47:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:38,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:47:38,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:38,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:47:38,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:38,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:47:38,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:38,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:47:38,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:38,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:47:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:38,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:47:38,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:38,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:47:38,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:38,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:47:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:38,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:47:38,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:38,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:47:38,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:38,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:47:38,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:38,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:47:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:38,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:47:38,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:38,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:47:38,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:38,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:47:38,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:38,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:47:38,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:38,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:47:38,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:38,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:47:38,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:38,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:47:38,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:38,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:47:38,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:38,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:47:38,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:38,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:47:38,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:47:38,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328878742] [2024-10-24 11:47:38,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328878742] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:47:38,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:47:38,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:47:38,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219644871] [2024-10-24 11:47:38,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:47:38,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:47:38,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:47:38,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:47:38,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:47:38,350 INFO L87 Difference]: Start difference. First operand 234 states and 309 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 11:47:38,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:47:38,579 INFO L93 Difference]: Finished difference Result 497 states and 654 transitions. [2024-10-24 11:47:38,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:47:38,579 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 175 [2024-10-24 11:47:38,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:47:38,581 INFO L225 Difference]: With dead ends: 497 [2024-10-24 11:47:38,581 INFO L226 Difference]: Without dead ends: 264 [2024-10-24 11:47:38,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:47:38,582 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 101 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:47:38,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 531 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:47:38,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-10-24 11:47:38,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 230. [2024-10-24 11:47:38,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 204 states have (on average 1.2598039215686274) internal successors, (257), 204 states have internal predecessors, (257), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 11:47:38,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 303 transitions. [2024-10-24 11:47:38,600 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 303 transitions. Word has length 175 [2024-10-24 11:47:38,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:47:38,600 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 303 transitions. [2024-10-24 11:47:38,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 11:47:38,601 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 303 transitions. [2024-10-24 11:47:38,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-24 11:47:38,603 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:47:38,603 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:47:38,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 11:47:38,603 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:47:38,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:47:38,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1053739876, now seen corresponding path program 1 times [2024-10-24 11:47:38,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:47:38,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750985733] [2024-10-24 11:47:38,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:47:38,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:47:38,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:38,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:47:38,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:38,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:47:38,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:38,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:47:38,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:38,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:47:38,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:38,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:47:38,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:38,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:47:38,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:38,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:47:38,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:38,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:47:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:38,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:47:38,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:38,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:47:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:38,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:47:38,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:38,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:47:38,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:38,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:47:38,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:38,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:47:38,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:38,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:47:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:38,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:47:38,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:38,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:47:38,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:38,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:47:38,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:38,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:47:38,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:38,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:47:38,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:38,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:47:38,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:38,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:47:38,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:38,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:47:38,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:38,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:47:38,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:47:38,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750985733] [2024-10-24 11:47:38,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750985733] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:47:38,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:47:38,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:47:38,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211753327] [2024-10-24 11:47:38,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:47:38,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:47:38,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:47:38,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:47:38,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:47:38,940 INFO L87 Difference]: Start difference. First operand 230 states and 303 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:47:39,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:47:39,101 INFO L93 Difference]: Finished difference Result 493 states and 646 transitions. [2024-10-24 11:47:39,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:47:39,102 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2024-10-24 11:47:39,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:47:39,104 INFO L225 Difference]: With dead ends: 493 [2024-10-24 11:47:39,104 INFO L226 Difference]: Without dead ends: 264 [2024-10-24 11:47:39,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:47:39,105 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 73 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:47:39,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 555 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:47:39,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-10-24 11:47:39,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 230. [2024-10-24 11:47:39,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 204 states have (on average 1.2549019607843137) internal successors, (256), 204 states have internal predecessors, (256), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 11:47:39,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 302 transitions. [2024-10-24 11:47:39,118 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 302 transitions. Word has length 175 [2024-10-24 11:47:39,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:47:39,118 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 302 transitions. [2024-10-24 11:47:39,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:47:39,119 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 302 transitions. [2024-10-24 11:47:39,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-24 11:47:39,120 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:47:39,120 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:47:39,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 11:47:39,120 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:47:39,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:47:39,121 INFO L85 PathProgramCache]: Analyzing trace with hash 660712866, now seen corresponding path program 1 times [2024-10-24 11:47:39,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:47:39,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497046855] [2024-10-24 11:47:39,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:47:39,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:47:39,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:40,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:47:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:40,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:47:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:40,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:47:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:40,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:47:40,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:40,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:47:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:40,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:47:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:40,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:47:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:40,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:47:40,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:40,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:47:40,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:40,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:47:40,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:40,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:47:40,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:40,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:47:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:40,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:47:40,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:40,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:47:40,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:40,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:47:40,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:40,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:47:40,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:40,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:47:40,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:40,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:47:40,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:40,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:47:40,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:40,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:47:40,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:40,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:47:40,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:40,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:47:40,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:40,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:47:40,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:40,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:47:40,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:47:40,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497046855] [2024-10-24 11:47:40,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497046855] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:47:40,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:47:40,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 11:47:40,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419160311] [2024-10-24 11:47:40,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:47:40,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 11:47:40,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:47:40,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 11:47:40,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:47:40,951 INFO L87 Difference]: Start difference. First operand 230 states and 302 transitions. Second operand has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 3 states have call successors, (23) [2024-10-24 11:47:41,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:47:41,684 INFO L93 Difference]: Finished difference Result 502 states and 659 transitions. [2024-10-24 11:47:41,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 11:47:41,685 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 3 states have call successors, (23) Word has length 175 [2024-10-24 11:47:41,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:47:41,687 INFO L225 Difference]: With dead ends: 502 [2024-10-24 11:47:41,687 INFO L226 Difference]: Without dead ends: 273 [2024-10-24 11:47:41,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-10-24 11:47:41,688 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 64 mSDsluCounter, 1264 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1451 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:47:41,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 1451 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 11:47:41,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-10-24 11:47:41,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 270. [2024-10-24 11:47:41,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 237 states have (on average 1.261603375527426) internal successors, (299), 238 states have internal predecessors, (299), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 11:47:41,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 355 transitions. [2024-10-24 11:47:41,703 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 355 transitions. Word has length 175 [2024-10-24 11:47:41,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:47:41,704 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 355 transitions. [2024-10-24 11:47:41,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 3 states have call successors, (23) [2024-10-24 11:47:41,704 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 355 transitions. [2024-10-24 11:47:41,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-24 11:47:41,706 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:47:41,706 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:47:41,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 11:47:41,707 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:47:41,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:47:41,707 INFO L85 PathProgramCache]: Analyzing trace with hash 715202965, now seen corresponding path program 1 times [2024-10-24 11:47:41,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:47:41,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632804439] [2024-10-24 11:47:41,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:47:41,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:47:41,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:41,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:47:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:41,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:47:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:41,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:47:41,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:41,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:47:41,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:41,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:47:41,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:41,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:47:41,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:41,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:47:41,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:41,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:47:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:41,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:47:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:41,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:47:41,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:41,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:47:41,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:41,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:47:41,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:41,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:47:41,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:41,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:47:41,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:41,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:47:41,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:41,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:47:41,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:41,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:47:41,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:41,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:47:41,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:41,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:47:41,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:41,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:47:41,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:41,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:47:41,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:41,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:47:41,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:41,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:47:41,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:41,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:47:41,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:47:41,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632804439] [2024-10-24 11:47:41,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632804439] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:47:41,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:47:41,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:47:41,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796043207] [2024-10-24 11:47:41,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:47:41,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:47:41,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:47:41,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:47:41,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:47:41,900 INFO L87 Difference]: Start difference. First operand 270 states and 355 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:47:42,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:47:42,144 INFO L93 Difference]: Finished difference Result 708 states and 930 transitions. [2024-10-24 11:47:42,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:47:42,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2024-10-24 11:47:42,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:47:42,147 INFO L225 Difference]: With dead ends: 708 [2024-10-24 11:47:42,147 INFO L226 Difference]: Without dead ends: 439 [2024-10-24 11:47:42,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:47:42,151 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 101 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:47:42,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 346 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:47:42,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-10-24 11:47:42,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 331. [2024-10-24 11:47:42,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 273 states have (on average 1.2380952380952381) internal successors, (338), 274 states have internal predecessors, (338), 51 states have call successors, (51), 6 states have call predecessors, (51), 6 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-24 11:47:42,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 440 transitions. [2024-10-24 11:47:42,176 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 440 transitions. Word has length 175 [2024-10-24 11:47:42,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:47:42,176 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 440 transitions. [2024-10-24 11:47:42,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:47:42,176 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 440 transitions. [2024-10-24 11:47:42,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-24 11:47:42,178 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:47:42,178 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:47:42,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 11:47:42,178 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:47:42,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:47:42,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1506119645, now seen corresponding path program 1 times [2024-10-24 11:47:42,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:47:42,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957659240] [2024-10-24 11:47:42,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:47:42,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:47:42,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:42,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:47:42,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:42,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:47:42,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:42,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:47:42,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:42,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:47:42,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:42,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:47:42,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:42,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:47:42,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:42,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:47:42,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:42,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:47:42,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:42,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:47:42,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:42,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:47:42,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:42,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:47:42,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:42,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:47:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:42,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:47:42,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:42,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:47:42,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:42,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:47:42,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:42,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:47:42,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:42,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:47:42,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:42,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:47:42,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:42,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:47:42,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:42,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:47:42,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:42,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:47:42,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:42,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:47:42,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:42,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:47:42,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:42,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:47:42,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:47:42,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957659240] [2024-10-24 11:47:42,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957659240] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:47:42,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:47:42,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:47:42,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176570301] [2024-10-24 11:47:42,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:47:42,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:47:42,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:47:42,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:47:42,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:47:42,361 INFO L87 Difference]: Start difference. First operand 331 states and 440 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:47:42,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:47:42,405 INFO L93 Difference]: Finished difference Result 606 states and 802 transitions. [2024-10-24 11:47:42,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:47:42,406 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 177 [2024-10-24 11:47:42,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:47:42,408 INFO L225 Difference]: With dead ends: 606 [2024-10-24 11:47:42,408 INFO L226 Difference]: Without dead ends: 337 [2024-10-24 11:47:42,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:47:42,409 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:47:42,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 574 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:47:42,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-10-24 11:47:42,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2024-10-24 11:47:42,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 279 states have (on average 1.2329749103942653) internal successors, (344), 280 states have internal predecessors, (344), 51 states have call successors, (51), 6 states have call predecessors, (51), 6 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-24 11:47:42,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 446 transitions. [2024-10-24 11:47:42,429 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 446 transitions. Word has length 177 [2024-10-24 11:47:42,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:47:42,429 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 446 transitions. [2024-10-24 11:47:42,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:47:42,430 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 446 transitions. [2024-10-24 11:47:42,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-24 11:47:42,431 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:47:42,432 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:47:42,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-24 11:47:42,432 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:47:42,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:47:42,432 INFO L85 PathProgramCache]: Analyzing trace with hash -305973112, now seen corresponding path program 1 times [2024-10-24 11:47:42,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:47:42,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920246414] [2024-10-24 11:47:42,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:47:42,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:47:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:42,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:47:42,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:42,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:47:42,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:42,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:47:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:42,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:47:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:42,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:47:42,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:42,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:47:42,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:42,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:47:42,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:42,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:47:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:42,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:47:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:42,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:47:42,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:42,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:47:42,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:42,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:47:42,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:42,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:47:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:42,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:47:42,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:42,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:47:42,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:42,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:47:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:42,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:47:42,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:42,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:47:42,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:42,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:47:42,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:42,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:47:42,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:42,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:47:42,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:42,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:47:42,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:42,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:47:42,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:42,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:47:42,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:47:42,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920246414] [2024-10-24 11:47:42,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920246414] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:47:42,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:47:42,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:47:42,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711678237] [2024-10-24 11:47:42,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:47:42,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:47:42,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:47:42,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:47:42,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:47:42,879 INFO L87 Difference]: Start difference. First operand 337 states and 446 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:47:43,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:47:43,158 INFO L93 Difference]: Finished difference Result 608 states and 797 transitions. [2024-10-24 11:47:43,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:47:43,158 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 179 [2024-10-24 11:47:43,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:47:43,162 INFO L225 Difference]: With dead ends: 608 [2024-10-24 11:47:43,162 INFO L226 Difference]: Without dead ends: 606 [2024-10-24 11:47:43,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:47:43,162 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 92 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:47:43,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 750 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:47:43,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-10-24 11:47:43,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 603. [2024-10-24 11:47:43,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 517 states have (on average 1.2379110251450678) internal successors, (640), 520 states have internal predecessors, (640), 75 states have call successors, (75), 10 states have call predecessors, (75), 10 states have return successors, (75), 72 states have call predecessors, (75), 75 states have call successors, (75) [2024-10-24 11:47:43,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 790 transitions. [2024-10-24 11:47:43,197 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 790 transitions. Word has length 179 [2024-10-24 11:47:43,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:47:43,198 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 790 transitions. [2024-10-24 11:47:43,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:47:43,199 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 790 transitions. [2024-10-24 11:47:43,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-24 11:47:43,200 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:47:43,200 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:47:43,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-24 11:47:43,200 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:47:43,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:47:43,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1745010886, now seen corresponding path program 1 times [2024-10-24 11:47:43,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:47:43,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824812236] [2024-10-24 11:47:43,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:47:43,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:47:43,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:47:43,266 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:47:43,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:47:43,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:47:43,383 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:47:43,384 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:47:43,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-24 11:47:43,389 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:47:43,479 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:47:43,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:47:43 BoogieIcfgContainer [2024-10-24 11:47:43,483 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:47:43,484 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:47:43,484 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:47:43,484 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:47:43,484 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:47:24" (3/4) ... [2024-10-24 11:47:43,486 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:47:43,487 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:47:43,488 INFO L158 Benchmark]: Toolchain (without parser) took 20572.72ms. Allocated memory was 176.2MB in the beginning and 796.9MB in the end (delta: 620.8MB). Free memory was 119.0MB in the beginning and 460.5MB in the end (delta: -341.5MB). Peak memory consumption was 279.7MB. Max. memory is 16.1GB. [2024-10-24 11:47:43,488 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 176.2MB. Free memory is still 141.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:47:43,491 INFO L158 Benchmark]: CACSL2BoogieTranslator took 377.95ms. Allocated memory is still 176.2MB. Free memory was 119.0MB in the beginning and 100.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 11:47:43,491 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.17ms. Allocated memory is still 176.2MB. Free memory was 100.1MB in the beginning and 96.3MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 11:47:43,491 INFO L158 Benchmark]: Boogie Preprocessor took 74.18ms. Allocated memory is still 176.2MB. Free memory was 96.3MB in the beginning and 91.7MB in the end (delta: 4.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 11:47:43,492 INFO L158 Benchmark]: RCFGBuilder took 739.63ms. Allocated memory is still 176.2MB. Free memory was 91.7MB in the beginning and 57.4MB in the end (delta: 34.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-24 11:47:43,492 INFO L158 Benchmark]: TraceAbstraction took 19275.73ms. Allocated memory was 176.2MB in the beginning and 796.9MB in the end (delta: 620.8MB). Free memory was 56.6MB in the beginning and 461.5MB in the end (delta: -404.9MB). Peak memory consumption was 218.9MB. Max. memory is 16.1GB. [2024-10-24 11:47:43,492 INFO L158 Benchmark]: Witness Printer took 3.90ms. Allocated memory is still 796.9MB. Free memory was 461.5MB in the beginning and 460.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:47:43,493 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 176.2MB. Free memory is still 141.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 377.95ms. Allocated memory is still 176.2MB. Free memory was 119.0MB in the beginning and 100.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.17ms. Allocated memory is still 176.2MB. Free memory was 100.1MB in the beginning and 96.3MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.18ms. Allocated memory is still 176.2MB. Free memory was 96.3MB in the beginning and 91.7MB in the end (delta: 4.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 739.63ms. Allocated memory is still 176.2MB. Free memory was 91.7MB in the beginning and 57.4MB in the end (delta: 34.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 19275.73ms. Allocated memory was 176.2MB in the beginning and 796.9MB in the end (delta: 620.8MB). Free memory was 56.6MB in the beginning and 461.5MB in the end (delta: -404.9MB). Peak memory consumption was 218.9MB. Max. memory is 16.1GB. * Witness Printer took 3.90ms. Allocated memory is still 796.9MB. Free memory was 461.5MB in the beginning and 460.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 127. Possible FailurePath: [L40] unsigned char isInitial = 0; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L59] unsigned char last_1_WrapperStruct00_var_1_5 = 0; [L131] isInitial = 1 [L132] FCALL initially() [L133] COND TRUE 1 [L134] CALL updateLastVariables() [L124] EXPR WrapperStruct00.var_1_5 [L124] last_1_WrapperStruct00_var_1_5 = WrapperStruct00.var_1_5 [L134] RET updateLastVariables() [L135] CALL updateVariables() [L87] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L88] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L89] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L90] WrapperStruct00.var_1_3 = __VERIFIER_nondet_uchar() [L91] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L92] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L93] WrapperStruct00.var_1_4 = __VERIFIER_nondet_double() [L94] EXPR WrapperStruct00.var_1_4 [L94] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L94] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F [L94] EXPR WrapperStruct00.var_1_4 [L94] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L94] EXPR (WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L94] EXPR (WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L94] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L94] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L95] WrapperStruct00.var_1_7 = __VERIFIER_nondet_uchar() [L96] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L97] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L98] WrapperStruct00.var_1_8 = __VERIFIER_nondet_uchar() [L99] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L100] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L101] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L102] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L103] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L104] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L105] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L106] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 128) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 128) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L107] WrapperStruct00.var_1_12 = __VERIFIER_nondet_uchar() [L108] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 64) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 64) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L109] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L110] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L111] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L112] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L113] WrapperStruct00.var_1_14 = __VERIFIER_nondet_char() [L114] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= -63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= -63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L115] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L116] WrapperStruct00.var_1_15 = __VERIFIER_nondet_char() [L117] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= -63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= -63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L118] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L119] WrapperStruct00.var_1_16 = __VERIFIER_nondet_char() [L120] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L121] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L121] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L121] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L135] RET updateVariables() [L136] CALL step() [L63] COND FALSE !(\read(last_1_WrapperStruct00_var_1_5)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L68] EXPR WrapperStruct00.var_1_1 [L68] EXPR WrapperStruct00.var_1_4 [L68] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L68] COND FALSE !(WrapperStruct00.var_1_1 >= (- (WrapperStruct00.var_1_4 * WrapperStruct00.var_1_1))) [L71] EXPR WrapperStruct00.var_1_3 [L71] WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L71] WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L71] COND TRUE WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4)) [L72] EXPR WrapperStruct00.var_1_2 [L72] EXPR WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L72] EXPR WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L72] EXPR (WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L72] EXPR (WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L72] WrapperStruct00.var_1_5 = ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7) [L76] EXPR WrapperStruct00.var_1_11 [L76] EXPR WrapperStruct00.var_1_12 [L76] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L76] EXPR ((WrapperStruct00.var_1_13) < (1)) ? (WrapperStruct00.var_1_13) : (1) [L76] EXPR WrapperStruct00.var_1_13 [L76] EXPR ((WrapperStruct00.var_1_13) < (1)) ? (WrapperStruct00.var_1_13) : (1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L76] signed long int stepLocal_1 = (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12) - ((((WrapperStruct00.var_1_13) < (1)) ? (WrapperStruct00.var_1_13) : (1))); [L77] EXPR WrapperStruct00.var_1_17 [L77] signed char stepLocal_0 = WrapperStruct00.var_1_17; [L78] COND FALSE !(-10 >= stepLocal_0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L136] RET step() [L137] CALL, EXPR property() [L127] EXPR last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : 1 [L127] EXPR last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR (last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : 1) && ((WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4))) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_5 == ((unsigned char) (! (! (WrapperStruct00.var_1_8 || WrapperStruct00.var_1_9)))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR (last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : 1) && ((WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4))) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_5 == ((unsigned char) (! (! (WrapperStruct00.var_1_8 || WrapperStruct00.var_1_9)))))) [L127] EXPR WrapperStruct00.var_1_3 [L127] EXPR WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR (WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4))) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_5 == ((unsigned char) (! (! (WrapperStruct00.var_1_8 || WrapperStruct00.var_1_9))))) [L127] EXPR WrapperStruct00.var_1_5 [L127] EXPR WrapperStruct00.var_1_2 [L127] EXPR WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR (WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR (WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR (WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4))) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_5 == ((unsigned char) (! (! (WrapperStruct00.var_1_8 || WrapperStruct00.var_1_9))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR (last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : 1) && ((WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4))) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_5 == ((unsigned char) (! (! (WrapperStruct00.var_1_8 || WrapperStruct00.var_1_9)))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR ((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : 1) && ((WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4))) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_5 == ((unsigned char) (! (! (WrapperStruct00.var_1_8 || WrapperStruct00.var_1_9))))))) && ((-10 >= WrapperStruct00.var_1_17) ? ((((WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12) - ((((WrapperStruct00.var_1_13) < (1)) ? (WrapperStruct00.var_1_13) : (1)))) > (~ WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_16))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR ((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : 1) && ((WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4))) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_5 == ((unsigned char) (! (! (WrapperStruct00.var_1_8 || WrapperStruct00.var_1_9))))))) && ((-10 >= WrapperStruct00.var_1_17) ? ((((WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12) - ((((WrapperStruct00.var_1_13) < (1)) ? (WrapperStruct00.var_1_13) : (1)))) > (~ WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_16))) : 1) [L127] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR (-10 >= WrapperStruct00.var_1_17) ? ((((WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12) - ((((WrapperStruct00.var_1_13) < (1)) ? (WrapperStruct00.var_1_13) : (1)))) > (~ WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_16))) : 1 [L127] EXPR (-10 >= WrapperStruct00.var_1_17) ? ((((WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12) - ((((WrapperStruct00.var_1_13) < (1)) ? (WrapperStruct00.var_1_13) : (1)))) > (~ WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_16))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR ((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : 1) && ((WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4))) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_5 == ((unsigned char) (! (! (WrapperStruct00.var_1_8 || WrapperStruct00.var_1_9))))))) && ((-10 >= WrapperStruct00.var_1_17) ? ((((WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12) - ((((WrapperStruct00.var_1_13) < (1)) ? (WrapperStruct00.var_1_13) : (1)))) > (~ WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_16))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR (((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : 1) && ((WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4))) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_5 == ((unsigned char) (! (! (WrapperStruct00.var_1_8 || WrapperStruct00.var_1_9))))))) && ((-10 >= WrapperStruct00.var_1_17) ? ((((WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12) - ((((WrapperStruct00.var_1_13) < (1)) ? (WrapperStruct00.var_1_13) : (1)))) > (~ WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_16))) : 1)) && ((WrapperStruct00.var_1_1 >= (- (WrapperStruct00.var_1_4 * WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_17 == ((signed char) WrapperStruct00.var_1_15)) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR (((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : 1) && ((WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4))) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_5 == ((unsigned char) (! (! (WrapperStruct00.var_1_8 || WrapperStruct00.var_1_9))))))) && ((-10 >= WrapperStruct00.var_1_17) ? ((((WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12) - ((((WrapperStruct00.var_1_13) < (1)) ? (WrapperStruct00.var_1_13) : (1)))) > (~ WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_16))) : 1)) && ((WrapperStruct00.var_1_1 >= (- (WrapperStruct00.var_1_4 * WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_17 == ((signed char) WrapperStruct00.var_1_15)) : 1) [L127] EXPR WrapperStruct00.var_1_1 [L127] EXPR WrapperStruct00.var_1_4 [L127] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR (WrapperStruct00.var_1_1 >= (- (WrapperStruct00.var_1_4 * WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_17 == ((signed char) WrapperStruct00.var_1_15)) : 1 [L127] EXPR WrapperStruct00.var_1_17 [L127] EXPR WrapperStruct00.var_1_15 [L127] EXPR (WrapperStruct00.var_1_1 >= (- (WrapperStruct00.var_1_4 * WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_17 == ((signed char) WrapperStruct00.var_1_15)) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR (((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : 1) && ((WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4))) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_5 == ((unsigned char) (! (! (WrapperStruct00.var_1_8 || WrapperStruct00.var_1_9))))))) && ((-10 >= WrapperStruct00.var_1_17) ? ((((WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12) - ((((WrapperStruct00.var_1_13) < (1)) ? (WrapperStruct00.var_1_13) : (1)))) > (~ WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_16))) : 1)) && ((WrapperStruct00.var_1_1 >= (- (WrapperStruct00.var_1_4 * WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_17 == ((signed char) WrapperStruct00.var_1_15)) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127-L128] return (((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : 1) && ((WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4))) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_5 == ((unsigned char) (! (! (WrapperStruct00.var_1_8 || WrapperStruct00.var_1_9))))))) && ((-10 >= WrapperStruct00.var_1_17) ? ((((WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12) - ((((WrapperStruct00.var_1_13) < (1)) ? (WrapperStruct00.var_1_13) : (1)))) > (~ WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_16))) : 1)) && ((WrapperStruct00.var_1_1 >= (- (WrapperStruct00.var_1_4 * WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_17 == ((signed char) WrapperStruct00.var_1_15)) : 1) ; [L137] RET, EXPR property() [L137] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 113 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.1s, OverallIterations: 24, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1373 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1367 mSDsluCounter, 12244 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8801 mSDsCounter, 421 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4130 IncrementalHoareTripleChecker+Invalid, 4551 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 421 mSolverCounterUnsat, 3443 mSDtfsCounter, 4130 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1312 GetRequests, 1205 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=603occurred in iteration=23, InterpolantAutomatonStates: 128, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 23 MinimizatonAttempts, 598 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 12.0s InterpolantComputationTime, 4164 NumberOfCodeBlocks, 4164 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 3962 ConstructedInterpolants, 0 QuantifiedInterpolants, 6516 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 23276/23276 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 11:47:43,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-34.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c1e424fdb45007bba7dcf6b9c7609abd758db94a72eb27633df48ff94056907f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:47:45,784 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:47:45,863 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:47:45,870 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:47:45,871 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:47:45,899 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:47:45,901 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:47:45,902 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:47:45,902 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:47:45,903 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:47:45,903 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:47:45,903 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:47:45,904 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:47:45,905 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:47:45,906 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:47:45,906 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:47:45,907 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:47:45,909 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:47:45,909 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:47:45,910 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:47:45,910 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:47:45,910 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:47:45,911 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:47:45,911 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:47:45,912 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:47:45,912 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:47:45,913 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:47:45,913 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:47:45,913 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:47:45,914 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:47:45,914 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:47:45,914 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:47:45,915 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:47:45,915 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:47:45,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:47:45,916 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:47:45,916 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:47:45,916 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:47:45,917 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:47:45,917 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:47:45,917 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:47:45,917 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:47:45,918 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:47:45,918 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:47:45,918 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:47:45,918 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c1e424fdb45007bba7dcf6b9c7609abd758db94a72eb27633df48ff94056907f [2024-10-24 11:47:46,235 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:47:46,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:47:46,262 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:47:46,263 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:47:46,264 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:47:46,266 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-34.i [2024-10-24 11:47:47,821 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:47:48,049 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:47:48,050 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-34.i [2024-10-24 11:47:48,063 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af219b113/c5ef82e1e78d453ba2797e958a51fbd7/FLAG220942c93 [2024-10-24 11:47:48,081 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af219b113/c5ef82e1e78d453ba2797e958a51fbd7 [2024-10-24 11:47:48,084 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:47:48,085 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:47:48,088 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:47:48,089 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:47:48,094 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:47:48,095 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:47:48" (1/1) ... [2024-10-24 11:47:48,096 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eff6e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:47:48, skipping insertion in model container [2024-10-24 11:47:48,096 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:47:48" (1/1) ... [2024-10-24 11:47:48,129 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:47:48,311 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-34.i[916,929] [2024-10-24 11:47:48,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:47:48,401 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:47:48,415 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-34.i[916,929] [2024-10-24 11:47:48,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:47:48,499 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:47:48,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:47:48 WrapperNode [2024-10-24 11:47:48,500 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:47:48,501 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:47:48,501 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:47:48,501 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:47:48,508 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:47:48" (1/1) ... [2024-10-24 11:47:48,523 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:47:48" (1/1) ... [2024-10-24 11:47:48,575 INFO L138 Inliner]: procedures = 30, calls = 150, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 432 [2024-10-24 11:47:48,579 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:47:48,580 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:47:48,580 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:47:48,581 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:47:48,591 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:47:48" (1/1) ... [2024-10-24 11:47:48,591 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:47:48" (1/1) ... [2024-10-24 11:47:48,599 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:47:48" (1/1) ... [2024-10-24 11:47:48,620 INFO L175 MemorySlicer]: Split 115 memory accesses to 2 slices as follows [2, 113]. 98 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 16]. The 18 writes are split as follows [0, 18]. [2024-10-24 11:47:48,620 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:47:48" (1/1) ... [2024-10-24 11:47:48,620 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:47:48" (1/1) ... [2024-10-24 11:47:48,649 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:47:48" (1/1) ... [2024-10-24 11:47:48,657 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:47:48" (1/1) ... [2024-10-24 11:47:48,662 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:47:48" (1/1) ... [2024-10-24 11:47:48,665 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:47:48" (1/1) ... [2024-10-24 11:47:48,671 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:47:48,672 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:47:48,676 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:47:48,676 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:47:48,678 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:47:48" (1/1) ... [2024-10-24 11:47:48,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:47:48,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:47:48,711 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:47:48,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:47:48,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:47:48,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-24 11:47:48,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-24 11:47:48,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-24 11:47:48,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-24 11:47:48,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 11:47:48,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 11:47:48,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:47:48,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 11:47:48,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-24 11:47:48,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-24 11:47:48,754 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:47:48,754 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:47:48,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:47:48,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:47:48,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-24 11:47:48,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-24 11:47:48,860 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:47:48,862 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:47:59,428 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2024-10-24 11:47:59,428 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:47:59,500 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:47:59,502 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:47:59,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:47:59 BoogieIcfgContainer [2024-10-24 11:47:59,502 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:47:59,504 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:47:59,505 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:47:59,508 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:47:59,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:47:48" (1/3) ... [2024-10-24 11:47:59,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8f4e9df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:47:59, skipping insertion in model container [2024-10-24 11:47:59,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:47:48" (2/3) ... [2024-10-24 11:47:59,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8f4e9df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:47:59, skipping insertion in model container [2024-10-24 11:47:59,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:47:59" (3/3) ... [2024-10-24 11:47:59,511 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-34.i [2024-10-24 11:47:59,524 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:47:59,524 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:47:59,573 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:47:59,579 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@53a1f59f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:47:59,579 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:47:59,583 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 88 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 11:47:59,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-24 11:47:59,595 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:47:59,597 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:47:59,597 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:47:59,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:47:59,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1982887210, now seen corresponding path program 1 times [2024-10-24 11:47:59,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:47:59,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [368242149] [2024-10-24 11:47:59,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:47:59,614 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:47:59,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:47:59,616 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:47:59,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 11:48:00,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:00,061 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:48:00,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:48:00,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 492 proven. 0 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2024-10-24 11:48:00,127 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:48:00,128 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:48:00,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [368242149] [2024-10-24 11:48:00,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [368242149] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:48:00,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:48:00,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:48:00,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038242264] [2024-10-24 11:48:00,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:48:00,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:48:00,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:48:00,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:48:00,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:48:00,168 INFO L87 Difference]: Start difference. First operand has 113 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 88 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 11:48:00,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:48:00,237 INFO L93 Difference]: Finished difference Result 223 states and 357 transitions. [2024-10-24 11:48:00,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:48:00,241 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 166 [2024-10-24 11:48:00,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:48:00,248 INFO L225 Difference]: With dead ends: 223 [2024-10-24 11:48:00,249 INFO L226 Difference]: Without dead ends: 111 [2024-10-24 11:48:00,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:48:00,259 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:48:00,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:48:00,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-24 11:48:00,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-10-24 11:48:00,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 11:48:00,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 163 transitions. [2024-10-24 11:48:00,318 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 163 transitions. Word has length 166 [2024-10-24 11:48:00,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:48:00,318 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 163 transitions. [2024-10-24 11:48:00,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 11:48:00,319 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 163 transitions. [2024-10-24 11:48:00,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-24 11:48:00,322 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:48:00,322 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:48:00,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-24 11:48:00,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:48:00,523 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:48:00,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:48:00,524 INFO L85 PathProgramCache]: Analyzing trace with hash 799028980, now seen corresponding path program 1 times [2024-10-24 11:48:00,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:48:00,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1986245475] [2024-10-24 11:48:00,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:48:00,525 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:48:00,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:48:00,527 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:48:00,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 11:48:00,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:00,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 11:48:00,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:48:00,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:48:00,980 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:48:00,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:48:00,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1986245475] [2024-10-24 11:48:00,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1986245475] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:48:00,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:48:00,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:48:00,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259689651] [2024-10-24 11:48:00,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:48:00,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:48:00,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:48:00,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:48:00,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:48:00,985 INFO L87 Difference]: Start difference. First operand 111 states and 163 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:48:01,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:48:01,078 INFO L93 Difference]: Finished difference Result 219 states and 322 transitions. [2024-10-24 11:48:01,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:48:01,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 166 [2024-10-24 11:48:01,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:48:01,081 INFO L225 Difference]: With dead ends: 219 [2024-10-24 11:48:01,083 INFO L226 Difference]: Without dead ends: 109 [2024-10-24 11:48:01,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:48:01,087 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:48:01,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 304 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:48:01,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-24 11:48:01,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-10-24 11:48:01,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 84 states have (on average 1.3452380952380953) internal successors, (113), 84 states have internal predecessors, (113), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 11:48:01,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 159 transitions. [2024-10-24 11:48:01,102 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 159 transitions. Word has length 166 [2024-10-24 11:48:01,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:48:01,109 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 159 transitions. [2024-10-24 11:48:01,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:48:01,109 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 159 transitions. [2024-10-24 11:48:01,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-24 11:48:01,113 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:48:01,113 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:48:01,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 11:48:01,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:48:01,319 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:48:01,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:48:01,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1403213728, now seen corresponding path program 1 times [2024-10-24 11:48:01,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:48:01,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [203374151] [2024-10-24 11:48:01,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:48:01,321 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:48:01,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:48:01,322 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:48:01,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 11:48:01,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:01,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:48:01,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:48:01,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:48:01,763 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:48:01,763 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:48:01,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [203374151] [2024-10-24 11:48:01,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [203374151] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:48:01,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:48:01,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:48:01,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539755155] [2024-10-24 11:48:01,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:48:01,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:48:01,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:48:01,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:48:01,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:48:01,766 INFO L87 Difference]: Start difference. First operand 109 states and 159 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:48:01,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:48:01,908 INFO L93 Difference]: Finished difference Result 219 states and 320 transitions. [2024-10-24 11:48:01,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:48:01,909 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 168 [2024-10-24 11:48:01,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:48:01,911 INFO L225 Difference]: With dead ends: 219 [2024-10-24 11:48:01,911 INFO L226 Difference]: Without dead ends: 111 [2024-10-24 11:48:01,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:48:01,917 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:48:01,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 452 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:48:01,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-24 11:48:01,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-10-24 11:48:01,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 11:48:01,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 161 transitions. [2024-10-24 11:48:01,937 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 161 transitions. Word has length 168 [2024-10-24 11:48:01,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:48:01,938 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 161 transitions. [2024-10-24 11:48:01,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:48:01,940 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 161 transitions. [2024-10-24 11:48:01,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-24 11:48:01,942 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:48:01,945 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:48:01,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-24 11:48:02,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:48:02,146 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:48:02,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:48:02,147 INFO L85 PathProgramCache]: Analyzing trace with hash -165501938, now seen corresponding path program 1 times [2024-10-24 11:48:02,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:48:02,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1295492662] [2024-10-24 11:48:02,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:48:02,148 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:48:02,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:48:02,151 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:48:02,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 11:48:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:02,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:48:02,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:48:02,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-24 11:48:03,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:48:03,706 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:48:03,707 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:48:03,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1295492662] [2024-10-24 11:48:03,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1295492662] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:48:03,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:48:03,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:48:03,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862391860] [2024-10-24 11:48:03,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:48:03,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:48:03,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:48:03,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:48:03,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:48:03,710 INFO L87 Difference]: Start difference. First operand 111 states and 161 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:48:06,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:48:08,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:48:11,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:48:11,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:48:11,817 INFO L93 Difference]: Finished difference Result 333 states and 483 transitions. [2024-10-24 11:48:11,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:48:11,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 170 [2024-10-24 11:48:11,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:48:11,821 INFO L225 Difference]: With dead ends: 333 [2024-10-24 11:48:11,821 INFO L226 Difference]: Without dead ends: 223 [2024-10-24 11:48:11,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:48:11,823 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 94 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:48:11,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 360 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2024-10-24 11:48:11,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-10-24 11:48:11,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 184. [2024-10-24 11:48:11,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 135 states have (on average 1.288888888888889) internal successors, (174), 135 states have internal predecessors, (174), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-24 11:48:11,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 266 transitions. [2024-10-24 11:48:11,846 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 266 transitions. Word has length 170 [2024-10-24 11:48:11,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:48:11,847 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 266 transitions. [2024-10-24 11:48:11,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:48:11,847 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 266 transitions. [2024-10-24 11:48:11,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-24 11:48:11,849 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:48:11,849 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:48:11,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-24 11:48:12,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:48:12,050 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:48:12,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:48:12,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1516518554, now seen corresponding path program 1 times [2024-10-24 11:48:12,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:48:12,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2113566565] [2024-10-24 11:48:12,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:48:12,051 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:48:12,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:48:12,053 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:48:12,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-24 11:48:12,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:12,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 11:48:12,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:48:12,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:48:12,411 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:48:12,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:48:12,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2113566565] [2024-10-24 11:48:12,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2113566565] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:48:12,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:48:12,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:48:12,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24156132] [2024-10-24 11:48:12,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:48:12,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:48:12,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:48:12,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:48:12,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:48:12,415 INFO L87 Difference]: Start difference. First operand 184 states and 266 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:48:12,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:48:12,483 INFO L93 Difference]: Finished difference Result 308 states and 446 transitions. [2024-10-24 11:48:12,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:48:12,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 173 [2024-10-24 11:48:12,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:48:12,486 INFO L225 Difference]: With dead ends: 308 [2024-10-24 11:48:12,486 INFO L226 Difference]: Without dead ends: 182 [2024-10-24 11:48:12,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:48:12,487 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:48:12,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 296 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:48:12,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-10-24 11:48:12,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2024-10-24 11:48:12,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 133 states have (on average 1.2781954887218046) internal successors, (170), 133 states have internal predecessors, (170), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-24 11:48:12,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 262 transitions. [2024-10-24 11:48:12,505 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 262 transitions. Word has length 173 [2024-10-24 11:48:12,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:48:12,506 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 262 transitions. [2024-10-24 11:48:12,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:48:12,506 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 262 transitions. [2024-10-24 11:48:12,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-24 11:48:12,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:48:12,508 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:48:12,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-24 11:48:12,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:48:12,709 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:48:12,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:48:12,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1906828626, now seen corresponding path program 1 times [2024-10-24 11:48:12,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:48:12,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1651420278] [2024-10-24 11:48:12,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:48:12,711 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:48:12,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:48:12,714 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:48:12,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-24 11:48:13,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:13,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 11:48:13,124 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:48:13,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-24 11:48:13,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-24 11:48:13,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:48:13,650 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:48:13,650 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:48:13,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1651420278] [2024-10-24 11:48:13,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1651420278] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:48:13,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:48:13,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 11:48:13,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770930216] [2024-10-24 11:48:13,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:48:13,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 11:48:13,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:48:13,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 11:48:13,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:48:13,652 INFO L87 Difference]: Start difference. First operand 182 states and 262 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:48:18,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:48:22,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:48:25,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:48:26,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:48:26,218 INFO L93 Difference]: Finished difference Result 448 states and 644 transitions. [2024-10-24 11:48:26,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 11:48:26,219 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2024-10-24 11:48:26,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:48:26,221 INFO L225 Difference]: With dead ends: 448 [2024-10-24 11:48:26,222 INFO L226 Difference]: Without dead ends: 324 [2024-10-24 11:48:26,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2024-10-24 11:48:26,223 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 140 mSDsluCounter, 1129 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1304 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:48:26,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1304 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 12.2s Time] [2024-10-24 11:48:26,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-10-24 11:48:26,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 221. [2024-10-24 11:48:26,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 172 states have (on average 1.2906976744186047) internal successors, (222), 172 states have internal predecessors, (222), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-24 11:48:26,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 314 transitions. [2024-10-24 11:48:26,242 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 314 transitions. Word has length 175 [2024-10-24 11:48:26,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:48:26,243 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 314 transitions. [2024-10-24 11:48:26,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:48:26,243 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 314 transitions. [2024-10-24 11:48:26,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-24 11:48:26,245 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:48:26,245 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:48:26,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-24 11:48:26,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:48:26,450 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:48:26,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:48:26,450 INFO L85 PathProgramCache]: Analyzing trace with hash -2041690198, now seen corresponding path program 1 times [2024-10-24 11:48:26,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:48:26,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1928041544] [2024-10-24 11:48:26,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:48:26,451 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:48:26,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:48:26,452 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:48:26,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-24 11:48:26,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:26,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 11:48:26,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:48:26,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:48:26,971 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:48:26,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:48:26,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1928041544] [2024-10-24 11:48:26,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1928041544] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:48:26,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:48:26,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:48:26,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100221818] [2024-10-24 11:48:26,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:48:26,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:48:26,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:48:26,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:48:26,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:48:26,973 INFO L87 Difference]: Start difference. First operand 221 states and 314 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:48:29,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:48:31,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:48:32,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:48:33,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:48:33,244 INFO L93 Difference]: Finished difference Result 433 states and 605 transitions. [2024-10-24 11:48:33,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:48:33,245 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2024-10-24 11:48:33,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:48:33,247 INFO L225 Difference]: With dead ends: 433 [2024-10-24 11:48:33,247 INFO L226 Difference]: Without dead ends: 270 [2024-10-24 11:48:33,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:48:33,248 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 39 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:48:33,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 611 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2024-10-24 11:48:33,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-10-24 11:48:33,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 264. [2024-10-24 11:48:33,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 211 states have (on average 1.2796208530805686) internal successors, (270), 212 states have internal predecessors, (270), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-24 11:48:33,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 366 transitions. [2024-10-24 11:48:33,271 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 366 transitions. Word has length 175 [2024-10-24 11:48:33,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:48:33,273 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 366 transitions. [2024-10-24 11:48:33,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:48:33,276 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 366 transitions. [2024-10-24 11:48:33,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-24 11:48:33,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:48:33,278 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:48:33,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-24 11:48:33,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:48:33,479 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:48:33,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:48:33,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1242159848, now seen corresponding path program 1 times [2024-10-24 11:48:33,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:48:33,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [49994901] [2024-10-24 11:48:33,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:48:33,481 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:48:33,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:48:33,482 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:48:33,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-24 11:48:33,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:33,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-24 11:48:33,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:48:33,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-24 11:48:34,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2024-10-24 11:48:38,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:48:38,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 51 [2024-10-24 11:48:38,805 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:48:38,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 54 [2024-10-24 11:48:39,293 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:48:39,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 54