./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-sp_file-42.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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-sp_file-42.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 3d976df0441559782faf2252bd19993d5a8987fee3e7cd12d006e6d9859f8f01 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:38:39,858 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:38:39,935 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 06:38:39,944 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:38:39,945 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:38:39,978 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:38:39,979 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:38:39,980 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:38:39,981 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:38:39,982 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:38:39,983 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:38:39,983 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:38:39,984 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:38:39,986 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:38:39,986 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:38:39,986 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:38:39,987 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:38:39,987 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:38:39,987 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 06:38:39,988 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:38:39,988 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:38:39,991 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:38:39,992 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:38:39,992 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:38:39,992 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:38:39,992 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:38:39,993 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:38:39,993 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:38:39,993 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:38:39,994 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:38:39,994 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:38:39,994 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:38:39,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:38:39,995 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:38:39,995 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:38:39,996 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:38:39,997 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 06:38:39,997 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 06:38:39,998 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:38:39,998 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:38:39,998 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:38:39,999 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:38:39,999 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 -> 3d976df0441559782faf2252bd19993d5a8987fee3e7cd12d006e6d9859f8f01 [2024-10-13 06:38:40,324 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:38:40,352 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:38:40,356 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:38:40,358 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:38:40,358 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:38:40,359 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-42.i [2024-10-13 06:38:41,853 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:38:42,076 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:38:42,077 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-42.i [2024-10-13 06:38:42,098 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f2d84df4/bea024024bb74145a827f30764e4cbc1/FLAGea0266827 [2024-10-13 06:38:42,115 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f2d84df4/bea024024bb74145a827f30764e4cbc1 [2024-10-13 06:38:42,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:38:42,119 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:38:42,121 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:38:42,122 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:38:42,127 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:38:42,128 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:38:42" (1/1) ... [2024-10-13 06:38:42,129 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61186348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:38:42, skipping insertion in model container [2024-10-13 06:38:42,129 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:38:42" (1/1) ... [2024-10-13 06:38:42,160 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:38:42,345 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-sp_file-42.i[917,930] [2024-10-13 06:38:42,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:38:42,420 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:38:42,433 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-sp_file-42.i[917,930] [2024-10-13 06:38:42,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:38:42,504 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:38:42,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:38:42 WrapperNode [2024-10-13 06:38:42,504 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:38:42,505 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:38:42,506 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:38:42,506 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:38:42,513 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:38:42" (1/1) ... [2024-10-13 06:38:42,525 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:38:42" (1/1) ... [2024-10-13 06:38:42,580 INFO L138 Inliner]: procedures = 29, calls = 138, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 445 [2024-10-13 06:38:42,581 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:38:42,584 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:38:42,584 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:38:42,584 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:38:42,597 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:38:42" (1/1) ... [2024-10-13 06:38:42,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:38:42" (1/1) ... [2024-10-13 06:38:42,604 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:38:42" (1/1) ... [2024-10-13 06:38:42,638 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 13 initializations are split as follows [2, 11]. The 15 writes are split as follows [0, 15]. [2024-10-13 06:38:42,639 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:38:42" (1/1) ... [2024-10-13 06:38:42,639 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:38:42" (1/1) ... [2024-10-13 06:38:42,656 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:38:42" (1/1) ... [2024-10-13 06:38:42,664 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:38:42" (1/1) ... [2024-10-13 06:38:42,667 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:38:42" (1/1) ... [2024-10-13 06:38:42,670 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:38:42" (1/1) ... [2024-10-13 06:38:42,676 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:38:42,677 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:38:42,677 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:38:42,677 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:38:42,679 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:38:42" (1/1) ... [2024-10-13 06:38:42,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:38:42,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:38:42,717 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-13 06:38:42,720 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-13 06:38:42,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:38:42,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-13 06:38:42,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-13 06:38:42,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 06:38:42,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 06:38:42,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-13 06:38:42,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-13 06:38:42,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 06:38:42,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 06:38:42,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-13 06:38:42,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-13 06:38:42,777 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:38:42,777 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:38:42,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 06:38:42,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 06:38:42,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:38:42,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:38:42,917 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:38:42,920 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:38:43,447 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2024-10-13 06:38:43,447 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:38:43,495 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:38:43,496 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:38:43,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:38:43 BoogieIcfgContainer [2024-10-13 06:38:43,496 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:38:43,500 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:38:43,501 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:38:43,505 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:38:43,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:38:42" (1/3) ... [2024-10-13 06:38:43,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71a4e4a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:38:43, skipping insertion in model container [2024-10-13 06:38:43,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:38:42" (2/3) ... [2024-10-13 06:38:43,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71a4e4a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:38:43, skipping insertion in model container [2024-10-13 06:38:43,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:38:43" (3/3) ... [2024-10-13 06:38:43,509 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-42.i [2024-10-13 06:38:43,527 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:38:43,529 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:38:43,614 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:38:43,622 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;@11ddf4ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:38:43,623 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:38:43,627 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 80 states have internal predecessors, (115), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:38:43,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 06:38:43,641 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:38:43,642 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:38:43,643 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:38:43,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:38:43,649 INFO L85 PathProgramCache]: Analyzing trace with hash -64383572, now seen corresponding path program 1 times [2024-10-13 06:38:43,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:38:43,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868670407] [2024-10-13 06:38:43,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:38:43,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:38:43,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:44,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:38:44,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:44,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:38:44,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:44,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 06:38:44,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:44,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 06:38:44,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:44,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:38:44,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:44,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 06:38:44,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:44,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 06:38:44,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:44,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:38:44,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:44,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:38:44,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:44,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 06:38:44,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:44,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:38:44,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:44,099 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:38:44,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:38:44,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868670407] [2024-10-13 06:38:44,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868670407] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:38:44,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:38:44,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:38:44,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538179766] [2024-10-13 06:38:44,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:38:44,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:38:44,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:38:44,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:38:44,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:38:44,144 INFO L87 Difference]: Start difference. First operand has 93 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 80 states have internal predecessors, (115), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:38:44,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:38:44,201 INFO L93 Difference]: Finished difference Result 183 states and 283 transitions. [2024-10-13 06:38:44,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:38:44,207 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2024-10-13 06:38:44,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:38:44,216 INFO L225 Difference]: With dead ends: 183 [2024-10-13 06:38:44,216 INFO L226 Difference]: Without dead ends: 91 [2024-10-13 06:38:44,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 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-13 06:38:44,227 INFO L432 NwaCegarLoop]: 126 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, 126 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-13 06:38:44,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:38:44,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-13 06:38:44,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-13 06:38:44,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 78 states have internal predecessors, (108), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:38:44,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 130 transitions. [2024-10-13 06:38:44,290 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 130 transitions. Word has length 98 [2024-10-13 06:38:44,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:38:44,291 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 130 transitions. [2024-10-13 06:38:44,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:38:44,291 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 130 transitions. [2024-10-13 06:38:44,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 06:38:44,295 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:38:44,295 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:38:44,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 06:38:44,296 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:38:44,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:38:44,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1768429254, now seen corresponding path program 1 times [2024-10-13 06:38:44,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:38:44,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241267556] [2024-10-13 06:38:44,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:38:44,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:38:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:44,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:38:44,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:44,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:38:44,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:44,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 06:38:44,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:44,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 06:38:44,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:44,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:38:44,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:44,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 06:38:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:44,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 06:38:44,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:44,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:38:44,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:44,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:38:44,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:44,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 06:38:44,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:44,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:38:44,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:44,716 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:38:44,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:38:44,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241267556] [2024-10-13 06:38:44,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241267556] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:38:44,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:38:44,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:38:44,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395954060] [2024-10-13 06:38:44,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:38:44,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:38:44,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:38:44,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:38:44,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:38:44,724 INFO L87 Difference]: Start difference. First operand 91 states and 130 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:38:44,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:38:44,789 INFO L93 Difference]: Finished difference Result 183 states and 262 transitions. [2024-10-13 06:38:44,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:38:44,790 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2024-10-13 06:38:44,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:38:44,791 INFO L225 Difference]: With dead ends: 183 [2024-10-13 06:38:44,791 INFO L226 Difference]: Without dead ends: 93 [2024-10-13 06:38:44,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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-13 06:38:44,794 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 365 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-13 06:38:44,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 365 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:38:44,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-13 06:38:44,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-13 06:38:44,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 80 states have (on average 1.375) internal successors, (110), 80 states have internal predecessors, (110), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:38:44,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 132 transitions. [2024-10-13 06:38:44,815 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 132 transitions. Word has length 98 [2024-10-13 06:38:44,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:38:44,817 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 132 transitions. [2024-10-13 06:38:44,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:38:44,818 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 132 transitions. [2024-10-13 06:38:44,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 06:38:44,823 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:38:44,823 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:38:44,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 06:38:44,824 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:38:44,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:38:44,824 INFO L85 PathProgramCache]: Analyzing trace with hash 110701692, now seen corresponding path program 1 times [2024-10-13 06:38:44,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:38:44,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791091868] [2024-10-13 06:38:44,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:38:44,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:38:45,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:45,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:38:45,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:45,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:38:45,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:45,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 06:38:45,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:45,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 06:38:45,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:45,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:38:45,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:45,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 06:38:45,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:45,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 06:38:45,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:45,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:38:45,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:45,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:38:45,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:45,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 06:38:45,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:45,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:38:45,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:45,673 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:38:45,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:38:45,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791091868] [2024-10-13 06:38:45,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791091868] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:38:45,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:38:45,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:38:45,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214112066] [2024-10-13 06:38:45,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:38:45,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:38:45,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:38:45,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:38:45,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:38:45,678 INFO L87 Difference]: Start difference. First operand 93 states and 132 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:38:45,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:38:45,826 INFO L93 Difference]: Finished difference Result 185 states and 263 transitions. [2024-10-13 06:38:45,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:38:45,831 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-13 06:38:45,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:38:45,832 INFO L225 Difference]: With dead ends: 185 [2024-10-13 06:38:45,833 INFO L226 Difference]: Without dead ends: 93 [2024-10-13 06:38:45,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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-13 06:38:45,835 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:38:45,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 319 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:38:45,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-13 06:38:45,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-13 06:38:45,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 80 states have (on average 1.3625) internal successors, (109), 80 states have internal predecessors, (109), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:38:45,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 131 transitions. [2024-10-13 06:38:45,845 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 131 transitions. Word has length 98 [2024-10-13 06:38:45,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:38:45,845 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 131 transitions. [2024-10-13 06:38:45,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:38:45,846 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 131 transitions. [2024-10-13 06:38:45,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 06:38:45,847 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:38:45,848 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:38:45,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 06:38:45,848 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:38:45,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:38:45,849 INFO L85 PathProgramCache]: Analyzing trace with hash -23311814, now seen corresponding path program 1 times [2024-10-13 06:38:45,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:38:45,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943877040] [2024-10-13 06:38:45,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:38:45,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:38:45,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:46,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:38:46,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:46,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:38:46,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:46,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 06:38:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:46,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 06:38:46,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:46,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:38:46,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:46,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 06:38:46,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:46,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 06:38:46,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:46,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:38:46,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:46,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:38:46,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:46,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 06:38:46,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:46,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:38:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:46,397 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:38:46,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:38:46,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943877040] [2024-10-13 06:38:46,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943877040] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:38:46,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:38:46,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:38:46,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609206438] [2024-10-13 06:38:46,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:38:46,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:38:46,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:38:46,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:38:46,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:38:46,404 INFO L87 Difference]: Start difference. First operand 93 states and 131 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:38:46,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:38:46,508 INFO L93 Difference]: Finished difference Result 185 states and 261 transitions. [2024-10-13 06:38:46,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:38:46,509 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-13 06:38:46,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:38:46,511 INFO L225 Difference]: With dead ends: 185 [2024-10-13 06:38:46,511 INFO L226 Difference]: Without dead ends: 93 [2024-10-13 06:38:46,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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-13 06:38:46,512 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:38:46,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 318 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:38:46,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-13 06:38:46,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-13 06:38:46,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 80 states have (on average 1.35) internal successors, (108), 80 states have internal predecessors, (108), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:38:46,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 130 transitions. [2024-10-13 06:38:46,524 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 130 transitions. Word has length 98 [2024-10-13 06:38:46,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:38:46,525 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 130 transitions. [2024-10-13 06:38:46,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:38:46,526 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 130 transitions. [2024-10-13 06:38:46,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 06:38:46,527 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:38:46,527 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:38:46,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 06:38:46,528 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:38:46,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:38:46,528 INFO L85 PathProgramCache]: Analyzing trace with hash -610117828, now seen corresponding path program 1 times [2024-10-13 06:38:46,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:38:46,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506829378] [2024-10-13 06:38:46,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:38:46,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:38:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:49,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:38:49,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:49,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:38:49,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:49,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 06:38:49,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:49,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 06:38:49,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:49,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:38:49,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:49,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 06:38:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:49,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 06:38:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:49,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:38:49,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:49,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:38:49,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:49,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 06:38:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:49,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:38:49,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:49,537 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:38:49,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:38:49,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506829378] [2024-10-13 06:38:49,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506829378] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:38:49,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:38:49,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-13 06:38:49,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579228888] [2024-10-13 06:38:49,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:38:49,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 06:38:49,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:38:49,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 06:38:49,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-10-13 06:38:49,540 INFO L87 Difference]: Start difference. First operand 93 states and 130 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:38:50,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:38:50,183 INFO L93 Difference]: Finished difference Result 188 states and 263 transitions. [2024-10-13 06:38:50,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 06:38:50,184 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-13 06:38:50,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:38:50,186 INFO L225 Difference]: With dead ends: 188 [2024-10-13 06:38:50,186 INFO L226 Difference]: Without dead ends: 96 [2024-10-13 06:38:50,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2024-10-13 06:38:50,188 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 252 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:38:50,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 369 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 06:38:50,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-13 06:38:50,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-10-13 06:38:50,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 82 states have (on average 1.3414634146341464) internal successors, (110), 82 states have internal predecessors, (110), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:38:50,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 132 transitions. [2024-10-13 06:38:50,208 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 132 transitions. Word has length 98 [2024-10-13 06:38:50,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:38:50,209 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 132 transitions. [2024-10-13 06:38:50,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:38:50,210 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 132 transitions. [2024-10-13 06:38:50,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 06:38:50,211 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:38:50,211 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:38:50,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 06:38:50,212 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:38:50,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:38:50,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1003144838, now seen corresponding path program 1 times [2024-10-13 06:38:50,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:38:50,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182427456] [2024-10-13 06:38:50,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:38:50,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:38:50,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:51,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:38:51,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:51,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:38:51,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:51,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 06:38:51,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:51,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 06:38:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:51,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:38:51,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:51,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 06:38:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:51,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 06:38:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:51,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:38:51,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:51,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:38:51,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:51,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 06:38:51,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:51,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:38:51,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:51,916 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-13 06:38:51,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:38:51,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182427456] [2024-10-13 06:38:51,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182427456] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:38:51,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770364881] [2024-10-13 06:38:51,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:38:51,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:38:51,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:38:51,922 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 06:38:51,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 06:38:52,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:52,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-10-13 06:38:52,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:38:54,610 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2024-10-13 06:38:54,611 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 1 case distinctions, treesize of input 19 treesize of output 27 [2024-10-13 06:38:54,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:38:54,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-10-13 06:38:54,956 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-13 06:38:54,957 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 1 case distinctions, treesize of input 26 treesize of output 25 [2024-10-13 06:38:55,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:38:55,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:38:55,171 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-13 06:38:55,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 29 [2024-10-13 06:38:55,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:38:55,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:38:55,328 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-13 06:38:55,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 29 [2024-10-13 06:38:55,569 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-13 06:38:55,569 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:38:56,515 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:38:56,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770364881] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 06:38:56,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-13 06:38:56,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [14, 14] total 36 [2024-10-13 06:38:56,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161249878] [2024-10-13 06:38:56,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:38:56,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 06:38:56,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:38:56,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 06:38:56,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1128, Unknown=0, NotChecked=0, Total=1260 [2024-10-13 06:38:56,519 INFO L87 Difference]: Start difference. First operand 95 states and 132 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:38:57,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:38:57,308 INFO L93 Difference]: Finished difference Result 245 states and 341 transitions. [2024-10-13 06:38:57,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 06:38:57,309 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-13 06:38:57,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:38:57,311 INFO L225 Difference]: With dead ends: 245 [2024-10-13 06:38:57,311 INFO L226 Difference]: Without dead ends: 151 [2024-10-13 06:38:57,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 196 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=167, Invalid=1393, Unknown=0, NotChecked=0, Total=1560 [2024-10-13 06:38:57,313 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 237 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 06:38:57,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 616 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 06:38:57,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-13 06:38:57,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 115. [2024-10-13 06:38:57,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 102 states have (on average 1.3529411764705883) internal successors, (138), 102 states have internal predecessors, (138), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:38:57,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 160 transitions. [2024-10-13 06:38:57,340 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 160 transitions. Word has length 98 [2024-10-13 06:38:57,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:38:57,340 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 160 transitions. [2024-10-13 06:38:57,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:38:57,340 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 160 transitions. [2024-10-13 06:38:57,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 06:38:57,342 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:38:57,342 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:38:57,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 06:38:57,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-13 06:38:57,546 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:38:57,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:38:57,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1317604097, now seen corresponding path program 1 times [2024-10-13 06:38:57,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:38:57,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569234704] [2024-10-13 06:38:57,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:38:57,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:38:57,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:57,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:38:57,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:57,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:38:57,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:57,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 06:38:57,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:57,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 06:38:57,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:57,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:38:57,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:57,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 06:38:57,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:57,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 06:38:57,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:57,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:38:57,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:57,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:38:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:57,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 06:38:57,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:57,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:38:57,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:57,706 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:38:57,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:38:57,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569234704] [2024-10-13 06:38:57,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569234704] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:38:57,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:38:57,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:38:57,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160068823] [2024-10-13 06:38:57,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:38:57,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:38:57,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:38:57,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:38:57,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:38:57,708 INFO L87 Difference]: Start difference. First operand 115 states and 160 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:38:57,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:38:57,786 INFO L93 Difference]: Finished difference Result 229 states and 319 transitions. [2024-10-13 06:38:57,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:38:57,787 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-13 06:38:57,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:38:57,788 INFO L225 Difference]: With dead ends: 229 [2024-10-13 06:38:57,788 INFO L226 Difference]: Without dead ends: 115 [2024-10-13 06:38:57,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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-13 06:38:57,789 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:38:57,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 316 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:38:57,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-13 06:38:57,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-10-13 06:38:57,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 102 states have (on average 1.3431372549019607) internal successors, (137), 102 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:38:57,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 159 transitions. [2024-10-13 06:38:57,833 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 159 transitions. Word has length 98 [2024-10-13 06:38:57,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:38:57,833 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 159 transitions. [2024-10-13 06:38:57,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:38:57,834 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 159 transitions. [2024-10-13 06:38:57,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 06:38:57,835 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:38:57,835 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:38:57,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 06:38:57,835 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:38:57,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:38:57,836 INFO L85 PathProgramCache]: Analyzing trace with hash 730798083, now seen corresponding path program 1 times [2024-10-13 06:38:57,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:38:57,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018185715] [2024-10-13 06:38:57,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:38:57,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:38:57,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:57,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:38:57,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:57,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:38:57,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:57,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 06:38:57,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:57,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 06:38:57,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:57,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:38:57,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:57,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 06:38:57,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:57,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 06:38:57,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:57,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:38:57,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:57,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:38:57,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:57,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 06:38:57,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:57,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:38:57,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:57,955 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:38:57,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:38:57,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018185715] [2024-10-13 06:38:57,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018185715] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:38:57,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:38:57,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 06:38:57,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499655888] [2024-10-13 06:38:57,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:38:57,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 06:38:57,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:38:57,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 06:38:57,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:38:57,957 INFO L87 Difference]: Start difference. First operand 115 states and 159 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:38:57,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:38:57,981 INFO L93 Difference]: Finished difference Result 227 states and 315 transitions. [2024-10-13 06:38:57,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 06:38:57,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-13 06:38:57,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:38:57,982 INFO L225 Difference]: With dead ends: 227 [2024-10-13 06:38:57,982 INFO L226 Difference]: Without dead ends: 113 [2024-10-13 06:38:57,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 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-13 06:38:57,984 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:38:57,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 237 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:38:57,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-13 06:38:58,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-10-13 06:38:58,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 100 states have (on average 1.33) internal successors, (133), 100 states have internal predecessors, (133), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:38:58,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 155 transitions. [2024-10-13 06:38:58,001 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 155 transitions. Word has length 98 [2024-10-13 06:38:58,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:38:58,001 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 155 transitions. [2024-10-13 06:38:58,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:38:58,002 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 155 transitions. [2024-10-13 06:38:58,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 06:38:58,005 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:38:58,005 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:38:58,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 06:38:58,005 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:38:58,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:38:58,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1364001389, now seen corresponding path program 1 times [2024-10-13 06:38:58,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:38:58,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007342624] [2024-10-13 06:38:58,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:38:58,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:38:58,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:58,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:38:58,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:58,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:38:58,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:58,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 06:38:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:58,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 06:38:58,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:58,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:38:58,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:58,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 06:38:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:58,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 06:38:58,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:58,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:38:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:58,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:38:58,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:58,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 06:38:58,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:58,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:38:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:58,161 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:38:58,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:38:58,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007342624] [2024-10-13 06:38:58,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007342624] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:38:58,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:38:58,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:38:58,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863011842] [2024-10-13 06:38:58,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:38:58,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:38:58,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:38:58,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:38:58,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:38:58,164 INFO L87 Difference]: Start difference. First operand 113 states and 155 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:38:58,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:38:58,243 INFO L93 Difference]: Finished difference Result 225 states and 309 transitions. [2024-10-13 06:38:58,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:38:58,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-13 06:38:58,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:38:58,245 INFO L225 Difference]: With dead ends: 225 [2024-10-13 06:38:58,245 INFO L226 Difference]: Without dead ends: 113 [2024-10-13 06:38:58,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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-13 06:38:58,246 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:38:58,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 306 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:38:58,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-13 06:38:58,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-10-13 06:38:58,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 100 states have (on average 1.32) internal successors, (132), 100 states have internal predecessors, (132), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:38:58,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 154 transitions. [2024-10-13 06:38:58,255 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 154 transitions. Word has length 98 [2024-10-13 06:38:58,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:38:58,255 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 154 transitions. [2024-10-13 06:38:58,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:38:58,256 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 154 transitions. [2024-10-13 06:38:58,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 06:38:58,256 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:38:58,256 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:38:58,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 06:38:58,257 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:38:58,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:38:58,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1498014895, now seen corresponding path program 1 times [2024-10-13 06:38:58,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:38:58,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548632215] [2024-10-13 06:38:58,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:38:58,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:38:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:58,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:38:58,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:58,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:38:58,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:58,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 06:38:58,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:58,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 06:38:58,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:58,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:38:58,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:58,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 06:38:58,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:58,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 06:38:58,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:58,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:38:58,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:58,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:38:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:58,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 06:38:58,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:58,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:38:58,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:58,375 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:38:58,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:38:58,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548632215] [2024-10-13 06:38:58,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548632215] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:38:58,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:38:58,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 06:38:58,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001846954] [2024-10-13 06:38:58,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:38:58,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 06:38:58,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:38:58,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 06:38:58,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:38:58,377 INFO L87 Difference]: Start difference. First operand 113 states and 154 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:38:58,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:38:58,399 INFO L93 Difference]: Finished difference Result 201 states and 274 transitions. [2024-10-13 06:38:58,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 06:38:58,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-13 06:38:58,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:38:58,400 INFO L225 Difference]: With dead ends: 201 [2024-10-13 06:38:58,400 INFO L226 Difference]: Without dead ends: 89 [2024-10-13 06:38:58,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 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-13 06:38:58,401 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:38:58,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 224 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:38:58,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-13 06:38:58,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-13 06:38:58,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 76 states have (on average 1.2894736842105263) internal successors, (98), 76 states have internal predecessors, (98), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:38:58,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 120 transitions. [2024-10-13 06:38:58,412 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 120 transitions. Word has length 98 [2024-10-13 06:38:58,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:38:58,413 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 120 transitions. [2024-10-13 06:38:58,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:38:58,413 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 120 transitions. [2024-10-13 06:38:58,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-13 06:38:58,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:38:58,414 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:38:58,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 06:38:58,414 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:38:58,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:38:58,415 INFO L85 PathProgramCache]: Analyzing trace with hash -2023181535, now seen corresponding path program 1 times [2024-10-13 06:38:58,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:38:58,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770345374] [2024-10-13 06:38:58,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:38:58,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:38:58,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:59,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:38:59,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:59,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:38:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:59,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 06:38:59,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:59,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 06:38:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:59,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:38:59,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:59,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 06:38:59,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:59,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 06:38:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:59,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:38:59,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:59,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:38:59,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:59,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 06:38:59,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:59,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:38:59,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:59,828 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-13 06:38:59,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:38:59,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770345374] [2024-10-13 06:38:59,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770345374] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:38:59,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086291228] [2024-10-13 06:38:59,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:38:59,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:38:59,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:38:59,830 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 06:38:59,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 06:39:00,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:00,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-10-13 06:39:00,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:39:00,834 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 15 treesize of output 1 [2024-10-13 06:39:01,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-13 06:39:01,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-13 06:39:02,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-13 06:39:02,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:39:02,550 INFO L349 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2024-10-13 06:39:02,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 39 [2024-10-13 06:39:02,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:39:02,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:39:02,705 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-10-13 06:39:02,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 30 [2024-10-13 06:39:02,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:39:02,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-13 06:39:02,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:39:02,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-13 06:39:02,914 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 35 treesize of output 23 [2024-10-13 06:39:02,918 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 80 proven. 84 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-13 06:39:02,918 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:39:19,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086291228] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:39:19,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 06:39:19,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2024-10-13 06:39:19,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98960132] [2024-10-13 06:39:19,439 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 06:39:19,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-13 06:39:19,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:39:19,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-13 06:39:19,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=605, Unknown=4, NotChecked=0, Total=756 [2024-10-13 06:39:19,441 INFO L87 Difference]: Start difference. First operand 89 states and 120 transitions. Second operand has 24 states, 22 states have (on average 4.045454545454546) internal successors, (89), 24 states have internal predecessors, (89), 9 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (22), 7 states have call predecessors, (22), 9 states have call successors, (22) [2024-10-13 06:39:20,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:39:20,433 INFO L93 Difference]: Finished difference Result 199 states and 266 transitions. [2024-10-13 06:39:20,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 06:39:20,435 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 4.045454545454546) internal successors, (89), 24 states have internal predecessors, (89), 9 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (22), 7 states have call predecessors, (22), 9 states have call successors, (22) Word has length 100 [2024-10-13 06:39:20,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:39:20,437 INFO L225 Difference]: With dead ends: 199 [2024-10-13 06:39:20,437 INFO L226 Difference]: Without dead ends: 111 [2024-10-13 06:39:20,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 140 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=290, Invalid=896, Unknown=4, NotChecked=0, Total=1190 [2024-10-13 06:39:20,440 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 286 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 77 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 06:39:20,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 424 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 609 Invalid, 1 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 06:39:20,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-13 06:39:20,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2024-10-13 06:39:20,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.2696629213483146) internal successors, (113), 90 states have internal predecessors, (113), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 06:39:20,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 141 transitions. [2024-10-13 06:39:20,460 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 141 transitions. Word has length 100 [2024-10-13 06:39:20,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:39:20,461 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 141 transitions. [2024-10-13 06:39:20,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 4.045454545454546) internal successors, (89), 24 states have internal predecessors, (89), 9 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (22), 7 states have call predecessors, (22), 9 states have call successors, (22) [2024-10-13 06:39:20,461 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 141 transitions. [2024-10-13 06:39:20,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-13 06:39:20,462 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:39:20,462 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:39:20,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 06:39:20,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-13 06:39:20,663 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:39:20,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:39:20,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1438086298, now seen corresponding path program 1 times [2024-10-13 06:39:20,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:39:20,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506036477] [2024-10-13 06:39:20,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:39:20,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:39:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:21,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:39:21,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:21,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:39:21,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:21,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 06:39:21,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:21,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 06:39:21,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:21,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:39:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:21,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 06:39:21,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:21,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 06:39:21,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:21,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:39:21,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:21,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:39:21,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:21,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 06:39:21,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:21,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:39:21,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:21,183 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:39:21,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:39:21,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506036477] [2024-10-13 06:39:21,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506036477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:39:21,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:39:21,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 06:39:21,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603362453] [2024-10-13 06:39:21,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:39:21,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 06:39:21,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:39:21,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 06:39:21,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:39:21,185 INFO L87 Difference]: Start difference. First operand 106 states and 141 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:39:21,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:39:21,499 INFO L93 Difference]: Finished difference Result 198 states and 262 transitions. [2024-10-13 06:39:21,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:39:21,500 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 100 [2024-10-13 06:39:21,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:39:21,503 INFO L225 Difference]: With dead ends: 198 [2024-10-13 06:39:21,503 INFO L226 Difference]: Without dead ends: 106 [2024-10-13 06:39:21,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:39:21,504 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 80 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:39:21,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 387 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:39:21,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-13 06:39:21,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-10-13 06:39:21,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.2584269662921348) internal successors, (112), 90 states have internal predecessors, (112), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 06:39:21,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 140 transitions. [2024-10-13 06:39:21,528 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 140 transitions. Word has length 100 [2024-10-13 06:39:21,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:39:21,528 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 140 transitions. [2024-10-13 06:39:21,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:39:21,528 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 140 transitions. [2024-10-13 06:39:21,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-13 06:39:21,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:39:21,529 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:39:21,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 06:39:21,530 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:39:21,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:39:21,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1167937256, now seen corresponding path program 1 times [2024-10-13 06:39:21,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:39:21,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899280087] [2024-10-13 06:39:21,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:39:21,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:39:21,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:39:21,683 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 06:39:21,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:39:21,882 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 06:39:21,882 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 06:39:21,884 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 06:39:21,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 06:39:21,893 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:39:22,047 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 06:39:22,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 06:39:22 BoogieIcfgContainer [2024-10-13 06:39:22,052 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 06:39:22,053 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 06:39:22,053 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 06:39:22,053 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 06:39:22,054 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:38:43" (3/4) ... [2024-10-13 06:39:22,056 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 06:39:22,057 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 06:39:22,058 INFO L158 Benchmark]: Toolchain (without parser) took 39938.37ms. Allocated memory was 138.4MB in the beginning and 526.4MB in the end (delta: 388.0MB). Free memory was 83.6MB in the beginning and 309.3MB in the end (delta: -225.7MB). Peak memory consumption was 163.2MB. Max. memory is 16.1GB. [2024-10-13 06:39:22,058 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 138.4MB. Free memory is still 111.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 06:39:22,058 INFO L158 Benchmark]: CACSL2BoogieTranslator took 383.24ms. Allocated memory is still 138.4MB. Free memory was 83.4MB in the beginning and 67.2MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 06:39:22,058 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.92ms. Allocated memory was 138.4MB in the beginning and 201.3MB in the end (delta: 62.9MB). Free memory was 67.2MB in the beginning and 171.2MB in the end (delta: -104.0MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2024-10-13 06:39:22,059 INFO L158 Benchmark]: Boogie Preprocessor took 92.61ms. Allocated memory is still 201.3MB. Free memory was 171.2MB in the beginning and 167.9MB in the end (delta: 3.3MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2024-10-13 06:39:22,059 INFO L158 Benchmark]: RCFGBuilder took 819.61ms. Allocated memory is still 201.3MB. Free memory was 167.9MB in the beginning and 131.2MB in the end (delta: 36.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-13 06:39:22,060 INFO L158 Benchmark]: TraceAbstraction took 38551.77ms. Allocated memory was 201.3MB in the beginning and 526.4MB in the end (delta: 325.1MB). Free memory was 130.1MB in the beginning and 310.3MB in the end (delta: -180.2MB). Peak memory consumption was 144.9MB. Max. memory is 16.1GB. [2024-10-13 06:39:22,060 INFO L158 Benchmark]: Witness Printer took 4.42ms. Allocated memory is still 526.4MB. Free memory was 310.3MB in the beginning and 309.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 06:39:22,061 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.16ms. Allocated memory is still 138.4MB. Free memory is still 111.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 383.24ms. Allocated memory is still 138.4MB. Free memory was 83.4MB in the beginning and 67.2MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.92ms. Allocated memory was 138.4MB in the beginning and 201.3MB in the end (delta: 62.9MB). Free memory was 67.2MB in the beginning and 171.2MB in the end (delta: -104.0MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 92.61ms. Allocated memory is still 201.3MB. Free memory was 171.2MB in the beginning and 167.9MB in the end (delta: 3.3MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. * RCFGBuilder took 819.61ms. Allocated memory is still 201.3MB. Free memory was 167.9MB in the beginning and 131.2MB in the end (delta: 36.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 38551.77ms. Allocated memory was 201.3MB in the beginning and 526.4MB in the end (delta: 325.1MB). Free memory was 130.1MB in the beginning and 310.3MB in the end (delta: -180.2MB). Peak memory consumption was 144.9MB. Max. memory is 16.1GB. * Witness Printer took 4.42ms. Allocated memory is still 526.4MB. Free memory was 310.3MB in the beginning and 309.3MB 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 someBinaryFLOATComparisonOperation at line 109. Possible FailurePath: [L35] unsigned char isInitial = 0; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -1, 5, 4, 16.5, 127.25, 1, 0, 0, 0, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -1, 5, 4, 16.5, 127.25, 1, 0, 0, 0, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -1, 5, 4, 16.5, 127.25, 1, 0, 0, 0, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -1, 5, 4, 16.5, 127.25, 1, 0, 0, 0, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -1, 5, 4, 16.5, 127.25, 1, 0, 0, 0, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -1, 5, 4, 16.5, 127.25, 1, 0, 0, 0, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -1, 5, 4, 16.5, 127.25, 1, 0, 0, 0, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -1, 5, 4, 16.5, 127.25, 1, 0, 0, 0, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -1, 5, 4, 16.5, 127.25, 1, 0, 0, 0, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -1, 5, 4, 16.5, 127.25, 1, 0, 0, 0, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -1, 5, 4, 16.5, 127.25, 1, 0, 0, 0, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -1, 5, 4, 16.5, 127.25, 1, 0, 0, 0, 0, 0 }; [L49] signed long int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L50] unsigned char* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L51] unsigned char* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L52] float* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L53] float* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L54] unsigned char* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L55] unsigned char* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L56] unsigned char* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L57] unsigned char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L58] unsigned char* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L59] unsigned char* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L113] isInitial = 1 [L114] FCALL initially() [L115] COND TRUE 1 [L116] FCALL updateLastVariables() [L117] CALL updateVariables() [L88] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L89] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L90] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L91] WrapperStruct00.var_1_11 = __VERIFIER_nondet_float() [L92] EXPR WrapperStruct00.var_1_11 [L92] EXPR WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L92] EXPR WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F [L92] EXPR WrapperStruct00.var_1_11 [L92] EXPR WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L92] EXPR (WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L92] EXPR (WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L92] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L92] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L93] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L94] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L95] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L96] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L97] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L98] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L99] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L100] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L101] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L102] WrapperStruct00.var_1_18 = __VERIFIER_nondet_uchar() [L103] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L104] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_18 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_18 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L117] RET updateVariables() [L118] CALL step() [L63] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L63] (*(WrapperStruct00_var_1_8_Pointer)) = ((*(WrapperStruct00_var_1_9_Pointer)) + 100) [L64] EXPR \read(*WrapperStruct00_var_1_11_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L64] EXPR (((*(WrapperStruct00_var_1_11_Pointer))) < (64.15f)) ? ((*(WrapperStruct00_var_1_11_Pointer))) : (64.15f) [L64] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L64] EXPR (((*(WrapperStruct00_var_1_11_Pointer))) < (64.15f)) ? ((*(WrapperStruct00_var_1_11_Pointer))) : (64.15f) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L64] (*(WrapperStruct00_var_1_10_Pointer)) = (((((*(WrapperStruct00_var_1_11_Pointer))) < (64.15f)) ? ((*(WrapperStruct00_var_1_11_Pointer))) : (64.15f))) [L65] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L65] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L65] COND FALSE !((*(WrapperStruct00_var_1_8_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) [L68] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L68] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L68] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L68] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L68] EXPR ((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) [L68] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L68] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L68] EXPR ((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L68] (*(WrapperStruct00_var_1_1_Pointer)) = ((((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))))) [L70] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L70] EXPR \read(*WrapperStruct00_var_1_10_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L70] COND TRUE (*(WrapperStruct00_var_1_11_Pointer)) <= (*(WrapperStruct00_var_1_10_Pointer)) [L71] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L71] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L71] COND TRUE (*(WrapperStruct00_var_1_1_Pointer)) != (*(WrapperStruct00_var_1_8_Pointer)) [L72] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L72] (*(WrapperStruct00_var_1_17_Pointer)) = (*(WrapperStruct00_var_1_18_Pointer)) [L81] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L81] EXPR \read(*WrapperStruct00_var_1_11_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L81] COND FALSE !((- (*(WrapperStruct00_var_1_10_Pointer))) > (*(WrapperStruct00_var_1_11_Pointer))) [L84] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L84] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L84] EXPR ((*(WrapperStruct00_var_1_1_Pointer)) <= (*(WrapperStruct00_var_1_9_Pointer))) && (*(WrapperStruct00_var_1_16_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L84] EXPR ((*(WrapperStruct00_var_1_1_Pointer)) <= (*(WrapperStruct00_var_1_9_Pointer))) && (*(WrapperStruct00_var_1_16_Pointer)) [L84] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L84] EXPR ((*(WrapperStruct00_var_1_1_Pointer)) <= (*(WrapperStruct00_var_1_9_Pointer))) && (*(WrapperStruct00_var_1_16_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L84] (*(WrapperStruct00_var_1_12_Pointer)) = (((*(WrapperStruct00_var_1_1_Pointer)) <= (*(WrapperStruct00_var_1_9_Pointer))) && (*(WrapperStruct00_var_1_16_Pointer))) [L118] RET step() [L119] CALL, EXPR property() [L109] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L109] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L109] EXPR ((*(WrapperStruct00_var_1_8_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) - 10))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))))))) [L109] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L109] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L109] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L109] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L109] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L109] EXPR ((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) [L109] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L109] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L109] EXPR ((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L109] EXPR ((*(WrapperStruct00_var_1_8_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) - 10))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L109] EXPR (((*(WrapperStruct00_var_1_8_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) - 10))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))))))) && ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_9_Pointer)) + 100))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L109] EXPR (((*(WrapperStruct00_var_1_8_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) - 10))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))))))) && ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_9_Pointer)) + 100))) [L109] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L109] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L109] EXPR (((*(WrapperStruct00_var_1_8_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) - 10))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))))))) && ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_9_Pointer)) + 100))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L109] EXPR ((((*(WrapperStruct00_var_1_8_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) - 10))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))))))) && ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_9_Pointer)) + 100)))) && ((*(WrapperStruct00_var_1_10_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_11_Pointer))) < (64.15f)) ? ((*(WrapperStruct00_var_1_11_Pointer))) : (64.15f))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L109] EXPR ((((*(WrapperStruct00_var_1_8_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) - 10))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))))))) && ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_9_Pointer)) + 100)))) && ((*(WrapperStruct00_var_1_10_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_11_Pointer))) < (64.15f)) ? ((*(WrapperStruct00_var_1_11_Pointer))) : (64.15f))))) [L109] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L109] EXPR \read(*WrapperStruct00_var_1_11_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L109] EXPR (((*(WrapperStruct00_var_1_11_Pointer))) < (64.15f)) ? ((*(WrapperStruct00_var_1_11_Pointer))) : (64.15f) [L109] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L109] EXPR (((*(WrapperStruct00_var_1_11_Pointer))) < (64.15f)) ? ((*(WrapperStruct00_var_1_11_Pointer))) : (64.15f) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L109] EXPR ((((*(WrapperStruct00_var_1_8_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) - 10))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))))))) && ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_9_Pointer)) + 100)))) && ((*(WrapperStruct00_var_1_10_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_11_Pointer))) < (64.15f)) ? ((*(WrapperStruct00_var_1_11_Pointer))) : (64.15f))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L109] EXPR (((((*(WrapperStruct00_var_1_8_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) - 10))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))))))) && ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_9_Pointer)) + 100)))) && ((*(WrapperStruct00_var_1_10_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_11_Pointer))) < (64.15f)) ? ((*(WrapperStruct00_var_1_11_Pointer))) : (64.15f)))))) && (((- (*(WrapperStruct00_var_1_10_Pointer))) > (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_13_Pointer)) || ((*(WrapperStruct00_var_1_17_Pointer)) && ((*(WrapperStruct00_var_1_15_Pointer)) || (*(WrapperStruct00_var_1_16_Pointer))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) <= (*(WrapperStruct00_var_1_9_Pointer))) && (*(WrapperStruct00_var_1_16_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L109] EXPR (((((*(WrapperStruct00_var_1_8_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) - 10))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))))))) && ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_9_Pointer)) + 100)))) && ((*(WrapperStruct00_var_1_10_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_11_Pointer))) < (64.15f)) ? ((*(WrapperStruct00_var_1_11_Pointer))) : (64.15f)))))) && (((- (*(WrapperStruct00_var_1_10_Pointer))) > (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_13_Pointer)) || ((*(WrapperStruct00_var_1_17_Pointer)) && ((*(WrapperStruct00_var_1_15_Pointer)) || (*(WrapperStruct00_var_1_16_Pointer))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) <= (*(WrapperStruct00_var_1_9_Pointer))) && (*(WrapperStruct00_var_1_16_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L109] EXPR ((((((*(WrapperStruct00_var_1_8_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) - 10))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))))))) && ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_9_Pointer)) + 100)))) && ((*(WrapperStruct00_var_1_10_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_11_Pointer))) < (64.15f)) ? ((*(WrapperStruct00_var_1_11_Pointer))) : (64.15f)))))) && (((- (*(WrapperStruct00_var_1_10_Pointer))) > (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_13_Pointer)) || ((*(WrapperStruct00_var_1_17_Pointer)) && ((*(WrapperStruct00_var_1_15_Pointer)) || (*(WrapperStruct00_var_1_16_Pointer))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) <= (*(WrapperStruct00_var_1_9_Pointer))) && (*(WrapperStruct00_var_1_16_Pointer))))))) && (((*(WrapperStruct00_var_1_11_Pointer)) <= (*(WrapperStruct00_var_1_10_Pointer))) ? (((*(WrapperStruct00_var_1_1_Pointer)) != (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_18_Pointer)))) : 1) : (((*(WrapperStruct00_var_1_8_Pointer)) <= 1000000) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) 0)) : ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) 0)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L109] EXPR ((((((*(WrapperStruct00_var_1_8_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) - 10))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))))))) && ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_9_Pointer)) + 100)))) && ((*(WrapperStruct00_var_1_10_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_11_Pointer))) < (64.15f)) ? ((*(WrapperStruct00_var_1_11_Pointer))) : (64.15f)))))) && (((- (*(WrapperStruct00_var_1_10_Pointer))) > (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_13_Pointer)) || ((*(WrapperStruct00_var_1_17_Pointer)) && ((*(WrapperStruct00_var_1_15_Pointer)) || (*(WrapperStruct00_var_1_16_Pointer))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) <= (*(WrapperStruct00_var_1_9_Pointer))) && (*(WrapperStruct00_var_1_16_Pointer))))))) && (((*(WrapperStruct00_var_1_11_Pointer)) <= (*(WrapperStruct00_var_1_10_Pointer))) ? (((*(WrapperStruct00_var_1_1_Pointer)) != (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_18_Pointer)))) : 1) : (((*(WrapperStruct00_var_1_8_Pointer)) <= 1000000) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) 0)) : ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) 0)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L109-L110] return ((((((*(WrapperStruct00_var_1_8_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) - 10))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))))))) && ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_9_Pointer)) + 100)))) && ((*(WrapperStruct00_var_1_10_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_11_Pointer))) < (64.15f)) ? ((*(WrapperStruct00_var_1_11_Pointer))) : (64.15f)))))) && (((- (*(WrapperStruct00_var_1_10_Pointer))) > (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_13_Pointer)) || ((*(WrapperStruct00_var_1_17_Pointer)) && ((*(WrapperStruct00_var_1_15_Pointer)) || (*(WrapperStruct00_var_1_16_Pointer))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) <= (*(WrapperStruct00_var_1_9_Pointer))) && (*(WrapperStruct00_var_1_16_Pointer))))))) && (((*(WrapperStruct00_var_1_11_Pointer)) <= (*(WrapperStruct00_var_1_10_Pointer))) ? (((*(WrapperStruct00_var_1_1_Pointer)) != (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_18_Pointer)))) : 1) : (((*(WrapperStruct00_var_1_8_Pointer)) <= 1000000) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) 0)) : ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) 0)))) ; [L119] RET, EXPR property() [L119] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 93 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 38.3s, OverallIterations: 13, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 861 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 855 mSDsluCounter, 4007 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2727 mSDsCounter, 97 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2004 IncrementalHoareTripleChecker+Invalid, 2102 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 97 mSolverCounterUnsat, 1280 mSDtfsCounter, 2004 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 698 GetRequests, 589 SyntacticMatches, 4 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 746 ImplicationChecksByTransitivity, 19.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=6, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 42 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 32.3s InterpolantComputationTime, 1478 NumberOfCodeBlocks, 1478 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1461 ConstructedInterpolants, 15 QuantifiedInterpolants, 14895 SizeOfPredicates, 38 NumberOfNonLiveVariables, 803 ConjunctsInSsa, 104 ConjunctsInUnsatCore, 15 InterpolantComputations, 11 PerfectInterpolantSequences, 3150/3300 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-13 06:39:22,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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-sp_file-42.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 3d976df0441559782faf2252bd19993d5a8987fee3e7cd12d006e6d9859f8f01 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:39:24,566 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:39:24,639 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 06:39:24,651 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:39:24,653 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:39:24,691 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:39:24,692 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:39:24,692 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:39:24,693 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:39:24,693 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:39:24,693 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:39:24,694 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:39:24,694 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:39:24,695 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:39:24,695 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:39:24,695 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:39:24,696 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:39:24,696 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:39:24,696 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:39:24,697 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:39:24,701 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:39:24,702 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:39:24,703 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:39:24,703 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 06:39:24,703 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 06:39:24,704 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:39:24,704 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 06:39:24,704 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:39:24,705 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:39:24,705 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:39:24,705 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:39:24,706 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:39:24,706 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:39:24,710 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:39:24,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:39:24,711 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:39:24,711 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:39:24,711 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:39:24,711 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 06:39:24,712 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 06:39:24,712 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:39:24,712 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:39:24,712 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:39:24,713 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:39:24,713 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 06:39:24,713 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 -> 3d976df0441559782faf2252bd19993d5a8987fee3e7cd12d006e6d9859f8f01 [2024-10-13 06:39:25,059 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:39:25,085 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:39:25,088 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:39:25,090 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:39:25,092 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:39:25,094 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-42.i [2024-10-13 06:39:26,864 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:39:27,138 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:39:27,138 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-42.i [2024-10-13 06:39:27,149 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4b790313/bd205ad0e92b40c5b03afb084df8ccb6/FLAG12b1ea401 [2024-10-13 06:39:27,458 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4b790313/bd205ad0e92b40c5b03afb084df8ccb6 [2024-10-13 06:39:27,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:39:27,462 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:39:27,463 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:39:27,464 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:39:27,471 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:39:27,471 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:39:27" (1/1) ... [2024-10-13 06:39:27,472 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ddef736 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:39:27, skipping insertion in model container [2024-10-13 06:39:27,473 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:39:27" (1/1) ... [2024-10-13 06:39:27,503 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:39:27,700 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-sp_file-42.i[917,930] [2024-10-13 06:39:27,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:39:27,812 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:39:27,830 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-sp_file-42.i[917,930] [2024-10-13 06:39:27,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:39:27,923 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:39:27,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:39:27 WrapperNode [2024-10-13 06:39:27,924 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:39:27,925 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:39:27,925 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:39:27,925 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:39:27,933 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:39:27" (1/1) ... [2024-10-13 06:39:27,959 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:39:27" (1/1) ... [2024-10-13 06:39:28,006 INFO L138 Inliner]: procedures = 33, calls = 138, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 445 [2024-10-13 06:39:28,006 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:39:28,008 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:39:28,008 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:39:28,008 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:39:28,020 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:39:27" (1/1) ... [2024-10-13 06:39:28,020 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:39:27" (1/1) ... [2024-10-13 06:39:28,031 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:39:27" (1/1) ... [2024-10-13 06:39:28,067 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 13 initializations are split as follows [2, 11]. The 15 writes are split as follows [0, 15]. [2024-10-13 06:39:28,068 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:39:27" (1/1) ... [2024-10-13 06:39:28,068 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:39:27" (1/1) ... [2024-10-13 06:39:28,091 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:39:27" (1/1) ... [2024-10-13 06:39:28,095 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:39:27" (1/1) ... [2024-10-13 06:39:28,098 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:39:27" (1/1) ... [2024-10-13 06:39:28,107 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:39:27" (1/1) ... [2024-10-13 06:39:28,117 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:39:28,118 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:39:28,118 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:39:28,121 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:39:28,122 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:39:27" (1/1) ... [2024-10-13 06:39:28,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:39:28,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:39:28,164 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-13 06:39:28,168 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-13 06:39:28,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:39:28,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 06:39:28,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 06:39:28,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 06:39:28,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 06:39:28,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-13 06:39:28,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-13 06:39:28,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-13 06:39:28,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-13 06:39:28,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 06:39:28,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 06:39:28,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-13 06:39:28,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-13 06:39:28,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-13 06:39:28,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-13 06:39:28,222 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:39:28,222 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:39:28,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:39:28,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:39:28,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-13 06:39:28,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-13 06:39:28,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 06:39:28,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 06:39:28,357 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:39:28,359 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:39:29,038 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2024-10-13 06:39:29,038 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:39:29,097 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:39:29,097 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:39:29,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:39:29 BoogieIcfgContainer [2024-10-13 06:39:29,098 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:39:29,100 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:39:29,100 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:39:29,105 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:39:29,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:39:27" (1/3) ... [2024-10-13 06:39:29,107 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4558503d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:39:29, skipping insertion in model container [2024-10-13 06:39:29,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:39:27" (2/3) ... [2024-10-13 06:39:29,107 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4558503d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:39:29, skipping insertion in model container [2024-10-13 06:39:29,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:39:29" (3/3) ... [2024-10-13 06:39:29,109 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-42.i [2024-10-13 06:39:29,129 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:39:29,130 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:39:29,192 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:39:29,198 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;@9e3cba4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:39:29,198 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:39:29,203 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 80 states have internal predecessors, (115), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:39:29,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 06:39:29,218 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:39:29,218 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:39:29,219 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:39:29,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:39:29,224 INFO L85 PathProgramCache]: Analyzing trace with hash -64383572, now seen corresponding path program 1 times [2024-10-13 06:39:29,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:39:29,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1674132641] [2024-10-13 06:39:29,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:39:29,240 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-13 06:39:29,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:39:29,244 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-13 06:39:29,246 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-13 06:39:29,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:29,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 06:39:29,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:39:29,621 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-10-13 06:39:29,621 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:39:29,622 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:39:29,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1674132641] [2024-10-13 06:39:29,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1674132641] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:39:29,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:39:29,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:39:29,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554038678] [2024-10-13 06:39:29,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:39:29,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:39:29,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:39:29,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:39:29,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:39:29,660 INFO L87 Difference]: Start difference. First operand has 93 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 80 states have internal predecessors, (115), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:39:29,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:39:29,714 INFO L93 Difference]: Finished difference Result 183 states and 283 transitions. [2024-10-13 06:39:29,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:39:29,719 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2024-10-13 06:39:29,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:39:29,729 INFO L225 Difference]: With dead ends: 183 [2024-10-13 06:39:29,730 INFO L226 Difference]: Without dead ends: 91 [2024-10-13 06:39:29,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 97 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-13 06:39:29,739 INFO L432 NwaCegarLoop]: 126 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, 126 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-13 06:39:29,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:39:29,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-13 06:39:29,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-13 06:39:29,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 78 states have internal predecessors, (108), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:39:29,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 130 transitions. [2024-10-13 06:39:29,787 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 130 transitions. Word has length 98 [2024-10-13 06:39:29,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:39:29,788 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 130 transitions. [2024-10-13 06:39:29,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:39:29,792 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 130 transitions. [2024-10-13 06:39:29,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 06:39:29,796 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:39:29,797 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:39:29,804 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 (2)] Ended with exit code 0 [2024-10-13 06:39:29,997 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-13 06:39:29,998 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:39:29,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:39:29,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1768429254, now seen corresponding path program 1 times [2024-10-13 06:39:30,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:39:30,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1575201332] [2024-10-13 06:39:30,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:39:30,000 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-13 06:39:30,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:39:30,004 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-13 06:39:30,007 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-13 06:39:30,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:30,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 06:39:30,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:39:30,362 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-10-13 06:39:30,362 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:39:30,363 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:39:30,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1575201332] [2024-10-13 06:39:30,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1575201332] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:39:30,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:39:30,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:39:30,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152928819] [2024-10-13 06:39:30,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:39:30,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:39:30,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:39:30,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:39:30,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:39:30,368 INFO L87 Difference]: Start difference. First operand 91 states and 130 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:39:30,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:39:30,445 INFO L93 Difference]: Finished difference Result 183 states and 262 transitions. [2024-10-13 06:39:30,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:39:30,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2024-10-13 06:39:30,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:39:30,449 INFO L225 Difference]: With dead ends: 183 [2024-10-13 06:39:30,449 INFO L226 Difference]: Without dead ends: 93 [2024-10-13 06:39:30,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 95 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-13 06:39:30,453 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 365 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-13 06:39:30,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 365 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:39:30,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-13 06:39:30,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-13 06:39:30,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 80 states have (on average 1.375) internal successors, (110), 80 states have internal predecessors, (110), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:39:30,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 132 transitions. [2024-10-13 06:39:30,478 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 132 transitions. Word has length 98 [2024-10-13 06:39:30,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:39:30,480 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 132 transitions. [2024-10-13 06:39:30,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:39:30,481 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 132 transitions. [2024-10-13 06:39:30,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 06:39:30,486 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:39:30,486 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:39:30,495 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-13 06:39:30,687 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-13 06:39:30,687 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:39:30,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:39:30,688 INFO L85 PathProgramCache]: Analyzing trace with hash 110701692, now seen corresponding path program 1 times [2024-10-13 06:39:30,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:39:30,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1274661041] [2024-10-13 06:39:30,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:39:30,689 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-13 06:39:30,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:39:30,691 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-13 06:39:30,692 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-13 06:39:30,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:30,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 06:39:30,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:39:31,001 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 33 treesize of output 17 [2024-10-13 06:39:31,048 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:39:31,049 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:39:31,049 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:39:31,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1274661041] [2024-10-13 06:39:31,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1274661041] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:39:31,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:39:31,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 06:39:31,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695588117] [2024-10-13 06:39:31,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:39:31,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 06:39:31,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:39:31,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 06:39:31,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:39:31,053 INFO L87 Difference]: Start difference. First operand 93 states and 132 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:39:31,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:39:31,127 INFO L93 Difference]: Finished difference Result 185 states and 263 transitions. [2024-10-13 06:39:31,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 06:39:31,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-13 06:39:31,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:39:31,142 INFO L225 Difference]: With dead ends: 185 [2024-10-13 06:39:31,142 INFO L226 Difference]: Without dead ends: 93 [2024-10-13 06:39:31,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 96 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-13 06:39:31,144 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:39:31,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 245 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:39:31,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-13 06:39:31,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-13 06:39:31,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 80 states have (on average 1.3625) internal successors, (109), 80 states have internal predecessors, (109), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:39:31,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 131 transitions. [2024-10-13 06:39:31,167 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 131 transitions. Word has length 98 [2024-10-13 06:39:31,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:39:31,172 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 131 transitions. [2024-10-13 06:39:31,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:39:31,172 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 131 transitions. [2024-10-13 06:39:31,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 06:39:31,174 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:39:31,175 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:39:31,189 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-13 06:39:31,375 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-13 06:39:31,376 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:39:31,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:39:31,377 INFO L85 PathProgramCache]: Analyzing trace with hash -23311814, now seen corresponding path program 1 times [2024-10-13 06:39:31,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:39:31,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [950552785] [2024-10-13 06:39:31,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:39:31,378 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-13 06:39:31,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:39:31,382 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-13 06:39:31,386 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-13 06:39:31,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:31,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 06:39:31,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:39:31,626 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 33 treesize of output 17 [2024-10-13 06:39:31,670 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:39:31,671 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:39:31,671 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:39:31,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [950552785] [2024-10-13 06:39:31,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [950552785] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:39:31,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:39:31,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 06:39:31,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357196956] [2024-10-13 06:39:31,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:39:31,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 06:39:31,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:39:31,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 06:39:31,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:39:31,677 INFO L87 Difference]: Start difference. First operand 93 states and 131 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:39:31,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:39:31,736 INFO L93 Difference]: Finished difference Result 185 states and 261 transitions. [2024-10-13 06:39:31,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 06:39:31,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-13 06:39:31,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:39:31,738 INFO L225 Difference]: With dead ends: 185 [2024-10-13 06:39:31,738 INFO L226 Difference]: Without dead ends: 93 [2024-10-13 06:39:31,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 96 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-13 06:39:31,740 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:39:31,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 244 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:39:31,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-13 06:39:31,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-13 06:39:31,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 80 states have (on average 1.35) internal successors, (108), 80 states have internal predecessors, (108), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:39:31,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 130 transitions. [2024-10-13 06:39:31,748 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 130 transitions. Word has length 98 [2024-10-13 06:39:31,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:39:31,749 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 130 transitions. [2024-10-13 06:39:31,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:39:31,749 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 130 transitions. [2024-10-13 06:39:31,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 06:39:31,751 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:39:31,751 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:39:31,760 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-13 06:39:31,952 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-13 06:39:31,952 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:39:31,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:39:31,953 INFO L85 PathProgramCache]: Analyzing trace with hash -610117828, now seen corresponding path program 1 times [2024-10-13 06:39:31,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:39:31,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1540246215] [2024-10-13 06:39:31,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:39:31,954 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-13 06:39:31,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:39:31,958 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-13 06:39:31,959 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-13 06:39:32,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:32,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-13 06:39:32,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:39:33,633 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-13 06:39:34,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2024-10-13 06:39:35,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2024-10-13 06:39:36,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2024-10-13 06:39:37,205 INFO L349 Elim1Store]: treesize reduction 59, result has 20.3 percent of original size [2024-10-13 06:39:37,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 63 [2024-10-13 06:39:37,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 51 [2024-10-13 06:39:37,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 51 [2024-10-13 06:39:37,822 INFO L349 Elim1Store]: treesize reduction 67, result has 18.3 percent of original size [2024-10-13 06:39:37,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 56 treesize of output 75 [2024-10-13 06:39:37,970 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:39:37,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 71 treesize of output 43 [2024-10-13 06:39:38,009 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 80 proven. 84 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-13 06:39:38,010 INFO L311 TraceCheckSpWp]: Computing backward predicates...