./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-14.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-14.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 57bda971cc74fc0d01c70e8ff55abb0ecbc2be19f4d9bb39359109904330c6bf --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:35:32,558 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:35:32,614 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 06:35:32,619 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:35:32,619 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:35:32,645 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:35:32,645 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:35:32,646 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:35:32,646 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:35:32,646 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:35:32,647 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:35:32,647 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:35:32,648 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:35:32,648 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:35:32,648 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:35:32,649 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:35:32,649 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:35:32,649 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:35:32,649 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 06:35:32,650 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:35:32,650 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:35:32,653 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:35:32,653 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:35:32,654 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:35:32,656 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:35:32,656 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:35:32,657 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:35:32,657 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:35:32,657 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:35:32,657 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:35:32,657 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:35:32,658 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:35:32,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:35:32,658 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:35:32,658 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:35:32,658 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:35:32,659 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 06:35:32,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 06:35:32,659 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:35:32,659 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:35:32,660 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:35:32,661 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:35:32,661 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 -> 57bda971cc74fc0d01c70e8ff55abb0ecbc2be19f4d9bb39359109904330c6bf [2024-10-13 06:35:32,874 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:35:32,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:35:32,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:35:32,910 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:35:32,911 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:35:32,912 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-14.i [2024-10-13 06:35:34,346 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:35:34,533 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:35:34,534 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-14.i [2024-10-13 06:35:34,543 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/506ced63c/91523b88bb534a7c804ba0a9b3165da8/FLAGd0bfab339 [2024-10-13 06:35:34,558 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/506ced63c/91523b88bb534a7c804ba0a9b3165da8 [2024-10-13 06:35:34,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:35:34,563 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:35:34,564 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:35:34,565 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:35:34,571 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:35:34,571 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:35:34" (1/1) ... [2024-10-13 06:35:34,574 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2729bfe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:35:34, skipping insertion in model container [2024-10-13 06:35:34,574 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:35:34" (1/1) ... [2024-10-13 06:35:34,598 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:35:34,738 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-14.i[917,930] [2024-10-13 06:35:34,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:35:34,829 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:35:34,840 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-14.i[917,930] [2024-10-13 06:35:34,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:35:34,888 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:35:34,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:35:34 WrapperNode [2024-10-13 06:35:34,888 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:35:34,891 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:35:34,892 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:35:34,892 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:35:34,897 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:35:34" (1/1) ... [2024-10-13 06:35:34,909 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:35:34" (1/1) ... [2024-10-13 06:35:34,980 INFO L138 Inliner]: procedures = 29, calls = 183, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 575 [2024-10-13 06:35:34,981 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:35:34,982 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:35:34,982 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:35:34,982 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:35:34,994 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:35:34" (1/1) ... [2024-10-13 06:35:34,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:35:34" (1/1) ... [2024-10-13 06:35:35,025 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:35:34" (1/1) ... [2024-10-13 06:35:35,062 INFO L175 MemorySlicer]: Split 150 memory accesses to 2 slices as follows [2, 148]. 99 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 16]. The 20 writes are split as follows [0, 20]. [2024-10-13 06:35:35,062 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:35:34" (1/1) ... [2024-10-13 06:35:35,063 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:35:34" (1/1) ... [2024-10-13 06:35:35,083 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:35:34" (1/1) ... [2024-10-13 06:35:35,089 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:35:34" (1/1) ... [2024-10-13 06:35:35,095 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:35:34" (1/1) ... [2024-10-13 06:35:35,098 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:35:34" (1/1) ... [2024-10-13 06:35:35,106 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:35:35,107 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:35:35,108 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:35:35,108 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:35:35,108 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:35:34" (1/1) ... [2024-10-13 06:35:35,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:35:35,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:35:35,158 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:35:35,160 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:35:35,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:35:35,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-13 06:35:35,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-13 06:35:35,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 06:35:35,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 06:35:35,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-13 06:35:35,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-13 06:35:35,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 06:35:35,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 06:35:35,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-13 06:35:35,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-13 06:35:35,193 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:35:35,193 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:35:35,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 06:35:35,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 06:35:35,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:35:35,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:35:35,284 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:35:35,287 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:35:35,792 INFO L? ?]: Removed 141 outVars from TransFormulas that were not future-live. [2024-10-13 06:35:35,792 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:35:35,819 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:35:35,820 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:35:35,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:35:35 BoogieIcfgContainer [2024-10-13 06:35:35,821 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:35:35,822 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:35:35,823 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:35:35,825 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:35:35,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:35:34" (1/3) ... [2024-10-13 06:35:35,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a883db4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:35:35, skipping insertion in model container [2024-10-13 06:35:35,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:35:34" (2/3) ... [2024-10-13 06:35:35,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a883db4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:35:35, skipping insertion in model container [2024-10-13 06:35:35,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:35:35" (3/3) ... [2024-10-13 06:35:35,833 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-14.i [2024-10-13 06:35:35,866 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:35:35,866 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:35:35,933 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:35:35,943 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;@653872f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:35:35,947 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:35:35,952 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 97 states have (on average 1.4536082474226804) internal successors, (141), 98 states have internal predecessors, (141), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 06:35:35,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-13 06:35:35,966 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:35:35,967 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:35,968 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:35:35,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:35:35,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1045265753, now seen corresponding path program 1 times [2024-10-13 06:35:35,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:35:35,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937539442] [2024-10-13 06:35:35,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:35:35,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:35:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:36,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:35:36,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:36,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:35:36,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:36,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:35:36,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:36,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:35:36,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:36,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:35:36,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:36,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:35:36,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:36,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:35:36,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:36,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:35:36,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:36,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:35:36,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:36,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:35:36,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:36,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:35:36,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:36,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:35:36,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:36,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:35:36,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:36,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:35:36,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:36,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:35:36,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:36,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:35:36,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:36,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:35:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:36,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:35:36,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:36,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 06:35:36,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:36,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:35:36,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:36,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 06:35:36,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:36,516 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:35:36,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:35:36,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937539442] [2024-10-13 06:35:36,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937539442] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:35:36,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:35:36,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:35:36,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341532284] [2024-10-13 06:35:36,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:35:36,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:35:36,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:35:36,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:35:36,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:35:36,548 INFO L87 Difference]: Start difference. First operand has 121 states, 97 states have (on average 1.4536082474226804) internal successors, (141), 98 states have internal predecessors, (141), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 06:35:36,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:35:36,593 INFO L93 Difference]: Finished difference Result 239 states and 385 transitions. [2024-10-13 06:35:36,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:35:36,596 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 163 [2024-10-13 06:35:36,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:35:36,603 INFO L225 Difference]: With dead ends: 239 [2024-10-13 06:35:36,604 INFO L226 Difference]: Without dead ends: 119 [2024-10-13 06:35:36,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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:35:36,612 INFO L432 NwaCegarLoop]: 174 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, 174 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:35:36,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 174 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:35:36,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-13 06:35:36,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-10-13 06:35:36,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 96 states have (on average 1.4166666666666667) internal successors, (136), 96 states have internal predecessors, (136), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 06:35:36,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 178 transitions. [2024-10-13 06:35:36,660 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 178 transitions. Word has length 163 [2024-10-13 06:35:36,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:35:36,661 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 178 transitions. [2024-10-13 06:35:36,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 06:35:36,661 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 178 transitions. [2024-10-13 06:35:36,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-13 06:35:36,665 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:35:36,666 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:36,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 06:35:36,667 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:35:36,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:35:36,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1512887547, now seen corresponding path program 1 times [2024-10-13 06:35:36,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:35:36,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397115322] [2024-10-13 06:35:36,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:35:36,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:35:36,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:37,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:35:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:37,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:35:37,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:37,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:35:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:37,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:35:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:37,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:35:37,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:37,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:35:37,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:37,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:35:37,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:37,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:35:37,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:37,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:35:37,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:37,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:35:37,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:37,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:35:37,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:37,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:35:37,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:37,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:35:37,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:37,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:35:37,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:37,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:35:37,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:37,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:35:37,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:37,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:35:37,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:37,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:35:37,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:37,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 06:35:37,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:37,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:35:37,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:37,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 06:35:37,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:37,098 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:35:37,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:35:37,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397115322] [2024-10-13 06:35:37,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397115322] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:35:37,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:35:37,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:35:37,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774537570] [2024-10-13 06:35:37,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:35:37,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:35:37,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:35:37,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:35:37,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:35:37,102 INFO L87 Difference]: Start difference. First operand 119 states and 178 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:35:37,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:35:37,158 INFO L93 Difference]: Finished difference Result 240 states and 360 transitions. [2024-10-13 06:35:37,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:35:37,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2024-10-13 06:35:37,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:35:37,166 INFO L225 Difference]: With dead ends: 240 [2024-10-13 06:35:37,166 INFO L226 Difference]: Without dead ends: 122 [2024-10-13 06:35:37,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 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:35:37,170 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 1 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:35:37,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 505 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:35:37,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-13 06:35:37,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-10-13 06:35:37,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 99 states have (on average 1.404040404040404) internal successors, (139), 99 states have internal predecessors, (139), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 06:35:37,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 181 transitions. [2024-10-13 06:35:37,188 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 181 transitions. Word has length 163 [2024-10-13 06:35:37,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:35:37,189 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 181 transitions. [2024-10-13 06:35:37,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:35:37,189 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 181 transitions. [2024-10-13 06:35:37,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-13 06:35:37,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:35:37,191 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:37,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 06:35:37,192 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:35:37,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:35:37,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1093136007, now seen corresponding path program 1 times [2024-10-13 06:35:37,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:35:37,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266305121] [2024-10-13 06:35:37,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:35:37,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:35:37,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:37,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:35:37,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:37,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:35:37,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:37,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:35:37,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:37,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:35:37,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:37,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:35:37,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:37,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:35:37,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:37,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:35:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:37,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:35:37,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:37,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:35:37,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:37,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:35:37,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:37,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:35:37,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:37,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:35:37,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:37,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:35:37,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:37,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:35:37,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:37,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:35:37,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:37,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:35:37,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:37,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:35:37,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:37,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:35:37,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:37,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 06:35:37,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:37,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:35:37,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:37,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 06:35:37,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:37,625 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:35:37,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:35:37,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266305121] [2024-10-13 06:35:37,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266305121] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:35:37,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:35:37,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:35:37,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468960544] [2024-10-13 06:35:37,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:35:37,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:35:37,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:35:37,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:35:37,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:35:37,630 INFO L87 Difference]: Start difference. First operand 122 states and 181 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:35:37,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:35:37,996 INFO L93 Difference]: Finished difference Result 365 states and 542 transitions. [2024-10-13 06:35:37,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:35:37,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2024-10-13 06:35:37,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:35:37,999 INFO L225 Difference]: With dead ends: 365 [2024-10-13 06:35:37,999 INFO L226 Difference]: Without dead ends: 244 [2024-10-13 06:35:38,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:35:38,004 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 144 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:35:38,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 410 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:35:38,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-10-13 06:35:38,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 217. [2024-10-13 06:35:38,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 172 states have (on average 1.3837209302325582) internal successors, (238), 172 states have internal predecessors, (238), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 06:35:38,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 322 transitions. [2024-10-13 06:35:38,031 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 322 transitions. Word has length 163 [2024-10-13 06:35:38,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:35:38,032 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 322 transitions. [2024-10-13 06:35:38,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:35:38,032 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 322 transitions. [2024-10-13 06:35:38,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-13 06:35:38,034 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:35:38,034 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:38,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 06:35:38,035 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:35:38,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:35:38,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1396392955, now seen corresponding path program 1 times [2024-10-13 06:35:38,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:35:38,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735764181] [2024-10-13 06:35:38,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:35:38,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:35:38,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:38,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:35:38,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:38,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:35:38,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:38,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:35:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:38,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:35:38,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:38,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:35:38,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:38,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:35:38,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:38,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:35:38,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:38,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:35:38,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:38,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:35:38,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:38,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:35:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:38,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:35:38,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:38,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:35:38,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:38,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:35:38,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:38,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:35:38,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:38,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:35:38,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:38,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:35:38,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:38,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:35:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:38,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:35:38,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:38,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 06:35:38,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:38,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:35:38,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:38,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 06:35:38,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:38,629 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:35:38,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:35:38,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735764181] [2024-10-13 06:35:38,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735764181] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:35:38,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:35:38,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:35:38,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584970034] [2024-10-13 06:35:38,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:35:38,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:35:38,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:35:38,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:35:38,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:35:38,632 INFO L87 Difference]: Start difference. First operand 217 states and 322 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:35:38,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:35:38,818 INFO L93 Difference]: Finished difference Result 385 states and 572 transitions. [2024-10-13 06:35:38,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:35:38,819 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2024-10-13 06:35:38,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:35:38,821 INFO L225 Difference]: With dead ends: 385 [2024-10-13 06:35:38,821 INFO L226 Difference]: Without dead ends: 258 [2024-10-13 06:35:38,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:35:38,823 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 52 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:35:38,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 637 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:35:38,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-10-13 06:35:38,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 219. [2024-10-13 06:35:38,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 174 states have (on average 1.3793103448275863) internal successors, (240), 174 states have internal predecessors, (240), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 06:35:38,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 324 transitions. [2024-10-13 06:35:38,845 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 324 transitions. Word has length 163 [2024-10-13 06:35:38,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:35:38,846 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 324 transitions. [2024-10-13 06:35:38,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:35:38,847 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 324 transitions. [2024-10-13 06:35:38,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-13 06:35:38,849 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:35:38,849 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:38,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 06:35:38,850 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:35:38,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:35:38,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1983198969, now seen corresponding path program 1 times [2024-10-13 06:35:38,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:35:38,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188007169] [2024-10-13 06:35:38,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:35:38,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:35:38,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:39,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:35:39,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:39,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:35:39,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:39,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:35:39,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:39,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:35:39,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:39,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:35:39,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:39,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:35:39,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:39,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:35:39,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:39,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:35:39,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:39,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:35:39,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:39,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:35:39,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:39,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:35:39,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:39,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:35:39,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:39,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:35:39,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:39,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:35:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:39,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:35:39,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:39,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:35:39,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:39,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:35:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:39,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:35:39,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:39,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 06:35:39,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:39,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:35:39,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:39,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 06:35:39,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:39,448 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:35:39,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:35:39,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188007169] [2024-10-13 06:35:39,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188007169] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:35:39,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:35:39,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:35:39,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414668529] [2024-10-13 06:35:39,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:35:39,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:35:39,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:35:39,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:35:39,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:35:39,451 INFO L87 Difference]: Start difference. First operand 219 states and 324 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:35:39,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:35:39,810 INFO L93 Difference]: Finished difference Result 384 states and 568 transitions. [2024-10-13 06:35:39,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 06:35:39,811 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2024-10-13 06:35:39,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:35:39,812 INFO L225 Difference]: With dead ends: 384 [2024-10-13 06:35:39,812 INFO L226 Difference]: Without dead ends: 262 [2024-10-13 06:35:39,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:35:39,814 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 166 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:35:39,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 612 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:35:39,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-10-13 06:35:39,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 229. [2024-10-13 06:35:39,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 184 states have (on average 1.3804347826086956) internal successors, (254), 184 states have internal predecessors, (254), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 06:35:39,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 338 transitions. [2024-10-13 06:35:39,830 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 338 transitions. Word has length 163 [2024-10-13 06:35:39,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:35:39,830 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 338 transitions. [2024-10-13 06:35:39,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:35:39,831 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 338 transitions. [2024-10-13 06:35:39,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-13 06:35:39,832 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:35:39,832 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:39,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 06:35:39,832 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:35:39,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:35:39,833 INFO L85 PathProgramCache]: Analyzing trace with hash 385275705, now seen corresponding path program 1 times [2024-10-13 06:35:39,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:35:39,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003891822] [2024-10-13 06:35:39,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:35:39,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:35:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:40,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:35:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:40,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:35:40,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:40,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:35:40,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:40,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:35:40,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:40,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:35:40,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:40,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:35:40,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:40,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:35:40,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:40,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:35:40,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:40,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:35:40,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:40,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:35:40,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:40,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:35:40,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:40,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:35:40,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:40,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:35:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:40,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:35:40,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:40,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:35:40,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:40,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:35:40,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:40,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:35:40,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:40,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:35:40,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:40,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 06:35:40,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:40,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:35:40,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:40,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 06:35:40,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:40,366 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:35:40,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:35:40,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003891822] [2024-10-13 06:35:40,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003891822] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:35:40,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:35:40,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:35:40,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106137574] [2024-10-13 06:35:40,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:35:40,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:35:40,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:35:40,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:35:40,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:35:40,368 INFO L87 Difference]: Start difference. First operand 229 states and 338 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:35:40,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:35:40,533 INFO L93 Difference]: Finished difference Result 393 states and 577 transitions. [2024-10-13 06:35:40,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:35:40,534 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2024-10-13 06:35:40,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:35:40,538 INFO L225 Difference]: With dead ends: 393 [2024-10-13 06:35:40,538 INFO L226 Difference]: Without dead ends: 260 [2024-10-13 06:35:40,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:35:40,539 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 90 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:35:40,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 599 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:35:40,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-10-13 06:35:40,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 225. [2024-10-13 06:35:40,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 180 states have (on average 1.3555555555555556) internal successors, (244), 180 states have internal predecessors, (244), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 06:35:40,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 328 transitions. [2024-10-13 06:35:40,559 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 328 transitions. Word has length 163 [2024-10-13 06:35:40,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:35:40,560 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 328 transitions. [2024-10-13 06:35:40,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:35:40,560 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 328 transitions. [2024-10-13 06:35:40,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-13 06:35:40,562 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:35:40,562 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:40,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 06:35:40,562 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:35:40,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:35:40,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1081671008, now seen corresponding path program 1 times [2024-10-13 06:35:40,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:35:40,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003778624] [2024-10-13 06:35:40,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:35:40,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:35:40,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:42,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:35:42,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:42,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:35:42,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:42,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:35:42,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:42,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:35:42,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:42,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:35:42,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:42,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:35:42,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:42,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:35:42,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:42,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:35:42,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:42,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:35:42,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:42,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:35:42,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:42,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:35:42,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:42,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:35:42,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:42,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:35:42,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:42,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:35:42,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:42,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:35:42,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:42,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:35:42,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:42,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:35:42,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:42,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:35:42,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:42,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 06:35:42,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:42,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:35:42,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:42,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 06:35:42,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:42,265 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-10-13 06:35:42,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:35:42,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003778624] [2024-10-13 06:35:42,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003778624] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:35:42,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473082140] [2024-10-13 06:35:42,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:35:42,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:35:42,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:35:42,268 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:35:42,273 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:35:42,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:42,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-10-13 06:35:42,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:35:43,724 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:35:44,047 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:35:44,243 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:35:44,403 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:35:44,694 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:35:44,880 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:35:45,061 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:35:45,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:35:45,267 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:35:45,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:35:45,307 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:35:45,388 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2024-10-13 06:35:45,389 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 21 treesize of output 28 [2024-10-13 06:35:45,471 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 358 proven. 176 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2024-10-13 06:35:45,471 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:35:45,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473082140] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:35:45,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 06:35:45,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2024-10-13 06:35:45,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940982277] [2024-10-13 06:35:45,617 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 06:35:45,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-13 06:35:45,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:35:45,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-13 06:35:45,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=536, Unknown=0, NotChecked=0, Total=650 [2024-10-13 06:35:45,619 INFO L87 Difference]: Start difference. First operand 225 states and 328 transitions. Second operand has 23 states, 20 states have (on average 6.2) internal successors, (124), 23 states have internal predecessors, (124), 10 states have call successors, (42), 4 states have call predecessors, (42), 6 states have return successors, (42), 7 states have call predecessors, (42), 10 states have call successors, (42) [2024-10-13 06:35:46,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:35:46,853 INFO L93 Difference]: Finished difference Result 417 states and 594 transitions. [2024-10-13 06:35:46,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 06:35:46,854 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 6.2) internal successors, (124), 23 states have internal predecessors, (124), 10 states have call successors, (42), 4 states have call predecessors, (42), 6 states have return successors, (42), 7 states have call predecessors, (42), 10 states have call successors, (42) Word has length 165 [2024-10-13 06:35:46,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:35:46,856 INFO L225 Difference]: With dead ends: 417 [2024-10-13 06:35:46,858 INFO L226 Difference]: Without dead ends: 284 [2024-10-13 06:35:46,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 226 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=252, Invalid=1008, Unknown=0, NotChecked=0, Total=1260 [2024-10-13 06:35:46,860 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 487 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 1141 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 1263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 06:35:46,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 557 Invalid, 1263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1141 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 06:35:46,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-10-13 06:35:46,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 237. [2024-10-13 06:35:46,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 190 states have (on average 1.3263157894736841) internal successors, (252), 190 states have internal predecessors, (252), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 06:35:46,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 336 transitions. [2024-10-13 06:35:46,890 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 336 transitions. Word has length 165 [2024-10-13 06:35:46,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:35:46,892 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 336 transitions. [2024-10-13 06:35:46,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 6.2) internal successors, (124), 23 states have internal predecessors, (124), 10 states have call successors, (42), 4 states have call predecessors, (42), 6 states have return successors, (42), 7 states have call predecessors, (42), 10 states have call successors, (42) [2024-10-13 06:35:46,893 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 336 transitions. [2024-10-13 06:35:46,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-13 06:35:46,894 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:35:46,894 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:46,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 06:35:47,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:35:47,095 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:35:47,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:35:47,096 INFO L85 PathProgramCache]: Analyzing trace with hash 583723680, now seen corresponding path program 1 times [2024-10-13 06:35:47,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:35:47,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107744724] [2024-10-13 06:35:47,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:35:47,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:35:47,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:50,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:35:50,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:50,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:35:50,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:50,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:35:50,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:50,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:35:50,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:50,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:35:50,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:50,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:35:50,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:50,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:35:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:50,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:35:50,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:50,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:35:50,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:50,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:35:50,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:50,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:35:50,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:50,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:35:50,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:50,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:35:50,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:50,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:35:50,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:50,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:35:50,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:50,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:35:50,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:50,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:35:50,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:51,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:35:51,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:51,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 06:35:51,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:51,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:35:51,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:51,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 06:35:51,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:51,053 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:35:51,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:35:51,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107744724] [2024-10-13 06:35:51,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107744724] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:35:51,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:35:51,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-13 06:35:51,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38781819] [2024-10-13 06:35:51,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:35:51,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 06:35:51,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:35:51,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 06:35:51,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-10-13 06:35:51,057 INFO L87 Difference]: Start difference. First operand 237 states and 336 transitions. Second operand has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-10-13 06:35:52,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:35:52,806 INFO L93 Difference]: Finished difference Result 511 states and 715 transitions. [2024-10-13 06:35:52,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 06:35:52,807 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 165 [2024-10-13 06:35:52,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:35:52,809 INFO L225 Difference]: With dead ends: 511 [2024-10-13 06:35:52,809 INFO L226 Difference]: Without dead ends: 380 [2024-10-13 06:35:52,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=139, Invalid=367, Unknown=0, NotChecked=0, Total=506 [2024-10-13 06:35:52,811 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 418 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:35:52,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 785 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1008 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 06:35:52,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-10-13 06:35:52,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 279. [2024-10-13 06:35:52,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 232 states have (on average 1.3232758620689655) internal successors, (307), 232 states have internal predecessors, (307), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 06:35:52,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 391 transitions. [2024-10-13 06:35:52,837 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 391 transitions. Word has length 165 [2024-10-13 06:35:52,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:35:52,838 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 391 transitions. [2024-10-13 06:35:52,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-10-13 06:35:52,838 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 391 transitions. [2024-10-13 06:35:52,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-13 06:35:52,839 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:35:52,839 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:52,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 06:35:52,840 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:35:52,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:35:52,840 INFO L85 PathProgramCache]: Analyzing trace with hash 2123473950, now seen corresponding path program 1 times [2024-10-13 06:35:52,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:35:52,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10584075] [2024-10-13 06:35:52,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:35:52,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:35:52,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:53,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:35:53,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:53,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:35:53,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:53,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:35:53,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:53,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:35:53,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:53,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:35:53,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:53,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:35:53,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:53,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:35:53,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:53,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:35:53,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:53,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:35:53,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:53,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:35:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:53,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:35:53,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:53,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:35:53,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:53,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:35:53,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:53,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:35:53,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:53,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:35:53,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:53,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:35:53,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:53,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:35:53,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:53,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:35:53,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:53,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 06:35:53,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:53,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:35:53,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:53,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 06:35:53,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:53,131 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:35:53,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:35:53,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10584075] [2024-10-13 06:35:53,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10584075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:35:53,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:35:53,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:35:53,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301316099] [2024-10-13 06:35:53,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:35:53,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:35:53,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:35:53,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:35:53,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:35:53,133 INFO L87 Difference]: Start difference. First operand 279 states and 391 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:35:53,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:35:53,299 INFO L93 Difference]: Finished difference Result 518 states and 716 transitions. [2024-10-13 06:35:53,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:35:53,300 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 167 [2024-10-13 06:35:53,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:35:53,303 INFO L225 Difference]: With dead ends: 518 [2024-10-13 06:35:53,303 INFO L226 Difference]: Without dead ends: 349 [2024-10-13 06:35:53,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:35:53,304 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 47 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:35:53,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 624 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:35:53,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-10-13 06:35:53,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 285. [2024-10-13 06:35:53,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 238 states have (on average 1.315126050420168) internal successors, (313), 238 states have internal predecessors, (313), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 06:35:53,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 397 transitions. [2024-10-13 06:35:53,333 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 397 transitions. Word has length 167 [2024-10-13 06:35:53,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:35:53,333 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 397 transitions. [2024-10-13 06:35:53,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:35:53,334 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 397 transitions. [2024-10-13 06:35:53,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-13 06:35:53,335 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:35:53,335 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:53,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 06:35:53,335 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:35:53,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:35:53,336 INFO L85 PathProgramCache]: Analyzing trace with hash -506098658, now seen corresponding path program 1 times [2024-10-13 06:35:53,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:35:53,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463792304] [2024-10-13 06:35:53,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:35:53,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:35:53,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:35:56,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:35:56,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:35:56,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:35:56,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:35:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:35:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:35:56,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:35:56,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:35:56,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:35:56,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:35:56,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:35:56,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:35:56,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:35:56,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:35:56,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:35:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:35:56,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:35:56,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 06:35:56,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:35:56,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 06:35:56,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,940 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:35:56,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:35:56,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463792304] [2024-10-13 06:35:56,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463792304] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:35:56,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:35:56,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-13 06:35:56,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279399459] [2024-10-13 06:35:56,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:35:56,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 06:35:56,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:35:56,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 06:35:56,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-13 06:35:56,943 INFO L87 Difference]: Start difference. First operand 285 states and 397 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-10-13 06:35:58,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:35:58,032 INFO L93 Difference]: Finished difference Result 530 states and 734 transitions. [2024-10-13 06:35:58,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 06:35:58,033 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 167 [2024-10-13 06:35:58,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:35:58,035 INFO L225 Difference]: With dead ends: 530 [2024-10-13 06:35:58,035 INFO L226 Difference]: Without dead ends: 367 [2024-10-13 06:35:58,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2024-10-13 06:35:58,036 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 273 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 06:35:58,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 672 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 06:35:58,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-10-13 06:35:58,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 276. [2024-10-13 06:35:58,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 229 states have (on average 1.3187772925764192) internal successors, (302), 229 states have internal predecessors, (302), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 06:35:58,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 386 transitions. [2024-10-13 06:35:58,062 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 386 transitions. Word has length 167 [2024-10-13 06:35:58,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:35:58,064 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 386 transitions. [2024-10-13 06:35:58,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-10-13 06:35:58,064 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 386 transitions. [2024-10-13 06:35:58,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-13 06:35:58,067 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:35:58,067 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:58,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 06:35:58,067 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:35:58,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:35:58,068 INFO L85 PathProgramCache]: Analyzing trace with hash 434530208, now seen corresponding path program 1 times [2024-10-13 06:35:58,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:35:58,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236896096] [2024-10-13 06:35:58,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:35:58,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:35:58,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:59,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:35:59,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:59,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:35:59,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:59,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:35:59,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:59,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:35:59,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:59,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:35:59,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:59,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:35:59,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:59,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:35:59,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:59,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:35:59,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:59,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:35:59,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:59,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:35:59,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:59,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:35:59,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:59,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:35:59,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:59,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:35:59,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:59,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:35:59,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:59,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:35:59,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:59,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:35:59,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:59,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:35:59,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:59,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:35:59,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:59,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 06:35:59,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:59,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:35:59,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:59,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 06:35:59,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:59,724 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-10-13 06:35:59,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:35:59,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236896096] [2024-10-13 06:35:59,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236896096] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:35:59,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821699841] [2024-10-13 06:35:59,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:35:59,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:35:59,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:35:59,730 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:35:59,731 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:35:59,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:59,944 INFO L255 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-10-13 06:35:59,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:36:00,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 06:36:01,353 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:36:01,578 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:36:01,762 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:36:02,046 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:36:02,195 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:36:02,346 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:36:02,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:36:02,564 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:36:02,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:36:02,610 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:36:02,701 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2024-10-13 06:36:02,701 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 21 treesize of output 28 [2024-10-13 06:36:02,775 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 358 proven. 176 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2024-10-13 06:36:02,775 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:36:02,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821699841] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:36:02,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 06:36:02,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 26 [2024-10-13 06:36:02,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531918149] [2024-10-13 06:36:02,970 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 06:36:02,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-13 06:36:02,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:36:02,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-13 06:36:02,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=686, Unknown=0, NotChecked=0, Total=812 [2024-10-13 06:36:02,972 INFO L87 Difference]: Start difference. First operand 276 states and 386 transitions. Second operand has 26 states, 23 states have (on average 5.521739130434782) internal successors, (127), 26 states have internal predecessors, (127), 10 states have call successors, (42), 4 states have call predecessors, (42), 6 states have return successors, (42), 7 states have call predecessors, (42), 10 states have call successors, (42) [2024-10-13 06:36:04,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:36:04,211 INFO L93 Difference]: Finished difference Result 443 states and 618 transitions. [2024-10-13 06:36:04,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 06:36:04,212 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 5.521739130434782) internal successors, (127), 26 states have internal predecessors, (127), 10 states have call successors, (42), 4 states have call predecessors, (42), 6 states have return successors, (42), 7 states have call predecessors, (42), 10 states have call successors, (42) Word has length 167 [2024-10-13 06:36:04,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:36:04,214 INFO L225 Difference]: With dead ends: 443 [2024-10-13 06:36:04,214 INFO L226 Difference]: Without dead ends: 270 [2024-10-13 06:36:04,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 228 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=276, Invalid=1206, Unknown=0, NotChecked=0, Total=1482 [2024-10-13 06:36:04,216 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 474 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 1304 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 1459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 1304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 06:36:04,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 648 Invalid, 1459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 1304 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 06:36:04,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-10-13 06:36:04,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 255. [2024-10-13 06:36:04,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 208 states have (on average 1.3173076923076923) internal successors, (274), 208 states have internal predecessors, (274), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 06:36:04,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 358 transitions. [2024-10-13 06:36:04,244 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 358 transitions. Word has length 167 [2024-10-13 06:36:04,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:36:04,245 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 358 transitions. [2024-10-13 06:36:04,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 5.521739130434782) internal successors, (127), 26 states have internal predecessors, (127), 10 states have call successors, (42), 4 states have call predecessors, (42), 6 states have return successors, (42), 7 states have call predecessors, (42), 10 states have call successors, (42) [2024-10-13 06:36:04,245 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 358 transitions. [2024-10-13 06:36:04,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-13 06:36:04,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:36:04,247 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:04,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 06:36:04,448 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:36:04,449 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:36:04,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:36:04,449 INFO L85 PathProgramCache]: Analyzing trace with hash -337744197, now seen corresponding path program 1 times [2024-10-13 06:36:04,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:36:04,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842457854] [2024-10-13 06:36:04,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:36:04,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:36:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:06,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:36:06,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:06,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:36:06,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:06,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:36:06,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:06,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:36:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:06,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:36:06,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:06,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:36:06,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:06,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:36:06,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:06,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:36:06,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:06,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:36:06,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:06,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:36:06,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:06,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:36:06,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:06,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:36:06,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:06,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:36:06,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:06,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:36:06,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:06,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:36:06,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:06,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:36:06,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:06,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:36:06,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:06,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:36:06,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:06,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 06:36:06,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:06,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:36:06,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:06,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 06:36:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:06,631 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:36:06,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:36:06,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842457854] [2024-10-13 06:36:06,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842457854] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:36:06,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:36:06,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-13 06:36:06,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840808200] [2024-10-13 06:36:06,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:36:06,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 06:36:06,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:36:06,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 06:36:06,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-10-13 06:36:06,635 INFO L87 Difference]: Start difference. First operand 255 states and 358 transitions. Second operand has 15 states, 13 states have (on average 5.230769230769231) internal successors, (68), 15 states have internal predecessors, (68), 5 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 5 states have call successors, (21) [2024-10-13 06:36:07,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:36:07,602 INFO L93 Difference]: Finished difference Result 482 states and 662 transitions. [2024-10-13 06:36:07,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 06:36:07,603 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 5.230769230769231) internal successors, (68), 15 states have internal predecessors, (68), 5 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 5 states have call successors, (21) Word has length 170 [2024-10-13 06:36:07,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:36:07,605 INFO L225 Difference]: With dead ends: 482 [2024-10-13 06:36:07,605 INFO L226 Difference]: Without dead ends: 327 [2024-10-13 06:36:07,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2024-10-13 06:36:07,608 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 556 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 06:36:07,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 654 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 06:36:07,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-10-13 06:36:07,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 324. [2024-10-13 06:36:07,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 273 states have (on average 1.293040293040293) internal successors, (353), 274 states have internal predecessors, (353), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-13 06:36:07,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 441 transitions. [2024-10-13 06:36:07,655 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 441 transitions. Word has length 170 [2024-10-13 06:36:07,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:36:07,656 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 441 transitions. [2024-10-13 06:36:07,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 5.230769230769231) internal successors, (68), 15 states have internal predecessors, (68), 5 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 5 states have call successors, (21) [2024-10-13 06:36:07,656 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 441 transitions. [2024-10-13 06:36:07,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-13 06:36:07,657 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:36:07,657 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:07,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 06:36:07,658 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:36:07,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:36:07,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1772942339, now seen corresponding path program 1 times [2024-10-13 06:36:07,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:36:07,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980035149] [2024-10-13 06:36:07,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:36:07,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:36:07,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:08,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:36:08,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:08,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:36:08,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:08,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:36:08,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:08,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:36:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:08,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:36:08,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:08,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:36:08,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:08,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:36:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:08,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:36:08,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:08,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:36:08,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:08,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:36:08,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:08,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:36:08,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:08,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:36:08,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:08,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:36:08,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:08,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:36:08,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:08,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:36:08,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:08,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:36:08,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:08,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:36:08,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:08,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:36:08,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:08,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 06:36:08,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:08,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:36:08,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:08,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 06:36:08,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:08,330 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:36:08,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:36:08,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980035149] [2024-10-13 06:36:08,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980035149] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:36:08,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:36:08,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:36:08,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103742344] [2024-10-13 06:36:08,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:36:08,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:36:08,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:36:08,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:36:08,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:36:08,332 INFO L87 Difference]: Start difference. First operand 324 states and 441 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:36:08,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:36:08,718 INFO L93 Difference]: Finished difference Result 603 states and 814 transitions. [2024-10-13 06:36:08,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:36:08,719 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 172 [2024-10-13 06:36:08,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:36:08,722 INFO L225 Difference]: With dead ends: 603 [2024-10-13 06:36:08,723 INFO L226 Difference]: Without dead ends: 392 [2024-10-13 06:36:08,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:36:08,724 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 251 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:36:08,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 468 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:36:08,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-13 06:36:08,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 367. [2024-10-13 06:36:08,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 316 states have (on average 1.2721518987341771) internal successors, (402), 317 states have internal predecessors, (402), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-13 06:36:08,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 490 transitions. [2024-10-13 06:36:08,766 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 490 transitions. Word has length 172 [2024-10-13 06:36:08,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:36:08,766 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 490 transitions. [2024-10-13 06:36:08,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:36:08,767 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 490 transitions. [2024-10-13 06:36:08,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-13 06:36:08,767 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:36:08,768 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:08,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 06:36:08,768 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:36:08,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:36:08,768 INFO L85 PathProgramCache]: Analyzing trace with hash 2128997947, now seen corresponding path program 1 times [2024-10-13 06:36:08,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:36:08,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990688152] [2024-10-13 06:36:08,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:36:08,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:36:08,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:08,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:36:08,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:08,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:36:08,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:08,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:36:08,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:08,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:36:08,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:08,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:36:08,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:08,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:36:08,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:08,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:36:08,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:08,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:36:08,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:08,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:36:08,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:08,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:36:08,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:08,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:36:08,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:08,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:36:08,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:08,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:36:08,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:08,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:36:08,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:08,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:36:08,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:08,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:36:08,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:08,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:36:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:08,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:36:08,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:08,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 06:36:08,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:08,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:36:08,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:08,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 06:36:08,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:08,881 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:36:08,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:36:08,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990688152] [2024-10-13 06:36:08,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990688152] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:36:08,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:36:08,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:36:08,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997390924] [2024-10-13 06:36:08,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:36:08,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:36:08,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:36:08,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:36:08,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:36:08,883 INFO L87 Difference]: Start difference. First operand 367 states and 490 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:36:08,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:36:08,948 INFO L93 Difference]: Finished difference Result 615 states and 825 transitions. [2024-10-13 06:36:08,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:36:08,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 172 [2024-10-13 06:36:08,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:36:08,951 INFO L225 Difference]: With dead ends: 615 [2024-10-13 06:36:08,951 INFO L226 Difference]: Without dead ends: 373 [2024-10-13 06:36:08,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 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:36:08,953 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 0 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:36:08,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 496 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:36:08,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-10-13 06:36:08,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2024-10-13 06:36:08,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 322 states have (on average 1.2670807453416149) internal successors, (408), 323 states have internal predecessors, (408), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-13 06:36:08,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 496 transitions. [2024-10-13 06:36:08,997 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 496 transitions. Word has length 172 [2024-10-13 06:36:08,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:36:08,998 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 496 transitions. [2024-10-13 06:36:08,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:36:08,998 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 496 transitions. [2024-10-13 06:36:08,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-13 06:36:08,999 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:36:09,000 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:09,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 06:36:09,000 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:36:09,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:36:09,001 INFO L85 PathProgramCache]: Analyzing trace with hash 748920061, now seen corresponding path program 1 times [2024-10-13 06:36:09,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:36:09,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134125037] [2024-10-13 06:36:09,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:36:09,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:36:09,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:09,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:36:09,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:09,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:36:09,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:09,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:36:09,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:09,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:36:09,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:09,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:36:09,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:09,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:36:09,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:09,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:36:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:09,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:36:09,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:09,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:36:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:09,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:36:09,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:09,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:36:09,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:09,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:36:09,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:09,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:36:09,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:09,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:36:09,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:09,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:36:09,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:09,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:36:09,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:09,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:36:09,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:09,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:36:09,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:09,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 06:36:09,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:09,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:36:09,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:09,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 06:36:09,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:09,937 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:36:09,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:36:09,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134125037] [2024-10-13 06:36:09,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134125037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:36:09,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:36:09,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 06:36:09,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549783249] [2024-10-13 06:36:09,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:36:09,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 06:36:09,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:36:09,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 06:36:09,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:36:09,940 INFO L87 Difference]: Start difference. First operand 373 states and 496 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:36:10,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:36:10,288 INFO L93 Difference]: Finished difference Result 575 states and 744 transitions. [2024-10-13 06:36:10,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:36:10,289 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 172 [2024-10-13 06:36:10,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:36:10,292 INFO L225 Difference]: With dead ends: 575 [2024-10-13 06:36:10,292 INFO L226 Difference]: Without dead ends: 573 [2024-10-13 06:36:10,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:36:10,293 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 261 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:36:10,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 588 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:36:10,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2024-10-13 06:36:10,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 547. [2024-10-13 06:36:10,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 496 states have (on average 1.2459677419354838) internal successors, (618), 497 states have internal predecessors, (618), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-13 06:36:10,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 706 transitions. [2024-10-13 06:36:10,339 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 706 transitions. Word has length 172 [2024-10-13 06:36:10,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:36:10,340 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 706 transitions. [2024-10-13 06:36:10,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:36:10,340 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 706 transitions. [2024-10-13 06:36:10,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-13 06:36:10,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:36:10,341 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:10,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 06:36:10,342 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:36:10,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:36:10,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1700671487, now seen corresponding path program 1 times [2024-10-13 06:36:10,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:36:10,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223796062] [2024-10-13 06:36:10,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:36:10,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:36:10,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:10,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:36:10,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:10,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:36:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:10,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:36:10,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:10,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:36:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:10,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:36:10,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:10,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:36:10,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:10,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:36:10,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:10,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:36:10,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:10,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:36:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:10,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:36:10,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:10,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:36:10,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:10,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:36:10,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:10,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:36:10,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:10,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:36:10,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:10,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:36:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:10,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:36:10,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:10,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:36:10,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:10,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:36:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:10,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 06:36:10,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:10,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:36:10,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:10,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 06:36:10,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:10,784 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:36:10,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:36:10,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223796062] [2024-10-13 06:36:10,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223796062] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:36:10,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:36:10,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:36:10,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204451782] [2024-10-13 06:36:10,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:36:10,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:36:10,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:36:10,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:36:10,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:36:10,787 INFO L87 Difference]: Start difference. First operand 547 states and 706 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 06:36:11,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:36:11,207 INFO L93 Difference]: Finished difference Result 931 states and 1203 transitions. [2024-10-13 06:36:11,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:36:11,208 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 172 [2024-10-13 06:36:11,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:36:11,211 INFO L225 Difference]: With dead ends: 931 [2024-10-13 06:36:11,211 INFO L226 Difference]: Without dead ends: 549 [2024-10-13 06:36:11,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:36:11,213 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 247 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:36:11,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 338 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:36:11,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2024-10-13 06:36:11,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 547. [2024-10-13 06:36:11,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 496 states have (on average 1.2419354838709677) internal successors, (616), 497 states have internal predecessors, (616), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-13 06:36:11,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 704 transitions. [2024-10-13 06:36:11,268 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 704 transitions. Word has length 172 [2024-10-13 06:36:11,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:36:11,268 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 704 transitions. [2024-10-13 06:36:11,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 06:36:11,268 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 704 transitions. [2024-10-13 06:36:11,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-13 06:36:11,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:36:11,271 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:11,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 06:36:11,272 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:36:11,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:36:11,272 INFO L85 PathProgramCache]: Analyzing trace with hash -2093698497, now seen corresponding path program 1 times [2024-10-13 06:36:11,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:36:11,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286425837] [2024-10-13 06:36:11,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:36:11,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:36:11,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:12,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:36:12,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:12,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:36:12,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:12,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:36:12,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:12,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:36:12,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:12,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:36:12,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:12,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:36:12,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:12,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:36:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:12,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:36:12,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:12,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:36:12,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:12,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:36:12,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:12,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:36:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:12,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:36:12,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:12,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:36:12,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:12,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:36:12,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:12,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:36:12,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:12,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:36:12,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:12,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:36:12,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:12,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:36:12,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:13,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 06:36:13,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:13,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:36:13,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:13,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 06:36:13,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:13,018 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:36:13,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:36:13,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286425837] [2024-10-13 06:36:13,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286425837] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:36:13,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:36:13,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-13 06:36:13,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415611545] [2024-10-13 06:36:13,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:36:13,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 06:36:13,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:36:13,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 06:36:13,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-10-13 06:36:13,020 INFO L87 Difference]: Start difference. First operand 547 states and 704 transitions. Second operand has 14 states, 13 states have (on average 5.384615384615385) internal successors, (70), 14 states have internal predecessors, (70), 4 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2024-10-13 06:36:13,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:36:13,797 INFO L93 Difference]: Finished difference Result 1050 states and 1347 transitions. [2024-10-13 06:36:13,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 06:36:13,798 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.384615384615385) internal successors, (70), 14 states have internal predecessors, (70), 4 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 172 [2024-10-13 06:36:13,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:36:13,801 INFO L225 Difference]: With dead ends: 1050 [2024-10-13 06:36:13,801 INFO L226 Difference]: Without dead ends: 668 [2024-10-13 06:36:13,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2024-10-13 06:36:13,803 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 686 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 06:36:13,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [687 Valid, 529 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 06:36:13,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2024-10-13 06:36:13,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 631. [2024-10-13 06:36:13,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 580 states have (on average 1.2275862068965517) internal successors, (712), 581 states have internal predecessors, (712), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-13 06:36:13,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 800 transitions. [2024-10-13 06:36:13,858 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 800 transitions. Word has length 172 [2024-10-13 06:36:13,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:36:13,858 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 800 transitions. [2024-10-13 06:36:13,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.384615384615385) internal successors, (70), 14 states have internal predecessors, (70), 4 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2024-10-13 06:36:13,859 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 800 transitions. [2024-10-13 06:36:13,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-13 06:36:13,860 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:36:13,860 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:13,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 06:36:13,860 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:36:13,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:36:13,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1835533059, now seen corresponding path program 1 times [2024-10-13 06:36:13,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:36:13,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405303514] [2024-10-13 06:36:13,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:36:13,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:36:13,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:14,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:36:14,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:14,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:36:14,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:14,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:36:14,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:14,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:36:14,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:14,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:36:14,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:14,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:36:14,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:14,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:36:14,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:14,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:36:14,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:14,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:36:14,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:14,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:36:14,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:14,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:36:14,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:14,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:36:14,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:14,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:36:14,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:14,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:36:14,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:14,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:36:14,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:14,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:36:14,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:14,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:36:14,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:14,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:36:14,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:14,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 06:36:14,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:14,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:36:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:14,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 06:36:14,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:14,487 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:36:14,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:36:14,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405303514] [2024-10-13 06:36:14,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405303514] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:36:14,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:36:14,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:36:14,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484998013] [2024-10-13 06:36:14,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:36:14,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:36:14,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:36:14,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:36:14,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:36:14,490 INFO L87 Difference]: Start difference. First operand 631 states and 800 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:36:14,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:36:14,865 INFO L93 Difference]: Finished difference Result 1094 states and 1393 transitions. [2024-10-13 06:36:14,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:36:14,866 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 172 [2024-10-13 06:36:14,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:36:14,869 INFO L225 Difference]: With dead ends: 1094 [2024-10-13 06:36:14,869 INFO L226 Difference]: Without dead ends: 650 [2024-10-13 06:36:14,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:36:14,871 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 246 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:36:14,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 424 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:36:14,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2024-10-13 06:36:14,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 619. [2024-10-13 06:36:14,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 568 states have (on average 1.2183098591549295) internal successors, (692), 569 states have internal predecessors, (692), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-13 06:36:14,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 780 transitions. [2024-10-13 06:36:14,945 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 780 transitions. Word has length 172 [2024-10-13 06:36:14,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:36:14,945 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 780 transitions. [2024-10-13 06:36:14,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:36:14,946 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 780 transitions. [2024-10-13 06:36:14,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-13 06:36:14,947 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:36:14,947 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:14,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 06:36:14,948 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:36:14,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:36:14,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1325508863, now seen corresponding path program 1 times [2024-10-13 06:36:14,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:36:14,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070303553] [2024-10-13 06:36:14,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:36:14,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:36:14,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:15,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:36:15,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:15,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:36:15,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:15,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:36:15,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:15,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:36:15,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:15,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:36:15,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:15,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:36:15,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:15,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:36:15,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:15,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:36:15,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:15,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:36:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:15,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:36:15,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:15,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:36:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:15,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:36:15,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:15,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:36:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:15,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:36:15,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:15,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:36:15,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:15,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:36:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:15,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:36:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:15,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:36:15,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:15,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 06:36:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:15,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:36:15,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:15,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 06:36:15,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:15,393 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:36:15,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:36:15,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070303553] [2024-10-13 06:36:15,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070303553] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:36:15,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:36:15,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 06:36:15,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286928961] [2024-10-13 06:36:15,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:36:15,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 06:36:15,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:36:15,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 06:36:15,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:36:15,396 INFO L87 Difference]: Start difference. First operand 619 states and 780 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 06:36:15,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:36:15,887 INFO L93 Difference]: Finished difference Result 1082 states and 1369 transitions. [2024-10-13 06:36:15,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:36:15,887 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 172 [2024-10-13 06:36:15,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:36:15,890 INFO L225 Difference]: With dead ends: 1082 [2024-10-13 06:36:15,891 INFO L226 Difference]: Without dead ends: 650 [2024-10-13 06:36:15,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-13 06:36:15,892 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 256 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:36:15,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 476 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 06:36:15,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2024-10-13 06:36:15,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 619. [2024-10-13 06:36:15,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 568 states have (on average 1.2183098591549295) internal successors, (692), 569 states have internal predecessors, (692), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-13 06:36:15,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 780 transitions. [2024-10-13 06:36:15,950 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 780 transitions. Word has length 172 [2024-10-13 06:36:15,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:36:15,952 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 780 transitions. [2024-10-13 06:36:15,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 06:36:15,952 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 780 transitions. [2024-10-13 06:36:15,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-13 06:36:15,954 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:36:15,954 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:15,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 06:36:15,955 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:36:15,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:36:15,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1263469249, now seen corresponding path program 1 times [2024-10-13 06:36:15,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:36:15,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898592775] [2024-10-13 06:36:15,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:36:15,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:36:15,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:16,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:36:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:16,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:36:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:16,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:36:16,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:16,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:36:16,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:16,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:36:16,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:16,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:36:16,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:16,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:36:16,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:16,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:36:16,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:16,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:36:16,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:16,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:36:16,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:16,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:36:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:16,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:36:16,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:16,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:36:16,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:16,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:36:16,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:16,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:36:16,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:16,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:36:16,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:16,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:36:16,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:16,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:36:16,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:16,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 06:36:16,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:16,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:36:16,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:16,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 06:36:16,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:16,416 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:36:16,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:36:16,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898592775] [2024-10-13 06:36:16,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898592775] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:36:16,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:36:16,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 06:36:16,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880686492] [2024-10-13 06:36:16,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:36:16,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 06:36:16,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:36:16,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 06:36:16,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:36:16,418 INFO L87 Difference]: Start difference. First operand 619 states and 780 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:36:16,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:36:16,865 INFO L93 Difference]: Finished difference Result 1082 states and 1365 transitions. [2024-10-13 06:36:16,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 06:36:16,866 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 172 [2024-10-13 06:36:16,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:36:16,868 INFO L225 Difference]: With dead ends: 1082 [2024-10-13 06:36:16,868 INFO L226 Difference]: Without dead ends: 650 [2024-10-13 06:36:16,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-10-13 06:36:16,869 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 237 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:36:16,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 750 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:36:16,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2024-10-13 06:36:16,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 613. [2024-10-13 06:36:16,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 562 states have (on average 1.2135231316725978) internal successors, (682), 563 states have internal predecessors, (682), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-13 06:36:16,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 770 transitions. [2024-10-13 06:36:16,922 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 770 transitions. Word has length 172 [2024-10-13 06:36:16,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:36:16,922 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 770 transitions. [2024-10-13 06:36:16,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:36:16,922 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 770 transitions. [2024-10-13 06:36:16,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-13 06:36:16,923 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:36:16,923 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:16,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 06:36:16,924 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:36:16,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:36:16,924 INFO L85 PathProgramCache]: Analyzing trace with hash -2121119771, now seen corresponding path program 1 times [2024-10-13 06:36:16,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:36:16,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510050531] [2024-10-13 06:36:16,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:36:16,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:36:17,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:36:17,042 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 06:36:17,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:36:17,331 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 06:36:17,332 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 06:36:17,333 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 06:36:17,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-13 06:36:17,337 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:36:17,474 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 06:36:17,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 06:36:17 BoogieIcfgContainer [2024-10-13 06:36:17,479 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 06:36:17,479 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 06:36:17,479 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 06:36:17,479 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 06:36:17,480 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:35:35" (3/4) ... [2024-10-13 06:36:17,481 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 06:36:17,482 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 06:36:17,483 INFO L158 Benchmark]: Toolchain (without parser) took 42920.02ms. Allocated memory was 163.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 89.2MB in the beginning and 929.0MB in the end (delta: -839.7MB). Peak memory consumption was 213.4MB. Max. memory is 16.1GB. [2024-10-13 06:36:17,483 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 163.6MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 06:36:17,483 INFO L158 Benchmark]: CACSL2BoogieTranslator took 324.45ms. Allocated memory is still 163.6MB. Free memory was 89.0MB in the beginning and 70.8MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 06:36:17,483 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.02ms. Allocated memory is still 163.6MB. Free memory was 70.7MB in the beginning and 130.2MB in the end (delta: -59.5MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2024-10-13 06:36:17,485 INFO L158 Benchmark]: Boogie Preprocessor took 124.87ms. Allocated memory is still 163.6MB. Free memory was 130.1MB in the beginning and 127.7MB in the end (delta: 2.4MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2024-10-13 06:36:17,485 INFO L158 Benchmark]: RCFGBuilder took 713.52ms. Allocated memory is still 163.6MB. Free memory was 127.7MB in the beginning and 83.7MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-10-13 06:36:17,485 INFO L158 Benchmark]: TraceAbstraction took 41656.52ms. Allocated memory was 163.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 82.8MB in the beginning and 929.0MB in the end (delta: -846.2MB). Peak memory consumption was 205.2MB. Max. memory is 16.1GB. [2024-10-13 06:36:17,485 INFO L158 Benchmark]: Witness Printer took 2.96ms. Allocated memory is still 1.2GB. Free memory is still 929.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 06:36:17,486 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 163.6MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 324.45ms. Allocated memory is still 163.6MB. Free memory was 89.0MB in the beginning and 70.8MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.02ms. Allocated memory is still 163.6MB. Free memory was 70.7MB in the beginning and 130.2MB in the end (delta: -59.5MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 124.87ms. Allocated memory is still 163.6MB. Free memory was 130.1MB in the beginning and 127.7MB in the end (delta: 2.4MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. * RCFGBuilder took 713.52ms. Allocated memory is still 163.6MB. Free memory was 127.7MB in the beginning and 83.7MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * TraceAbstraction took 41656.52ms. Allocated memory was 163.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 82.8MB in the beginning and 929.0MB in the end (delta: -846.2MB). Peak memory consumption was 205.2MB. Max. memory is 16.1GB. * Witness Printer took 2.96ms. Allocated memory is still 1.2GB. Free memory is still 929.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 142, overapproximation of someBinaryDOUBLEComparisonOperation at line 85. Possible FailurePath: [L40] unsigned char isInitial = 0; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 1000000, 0, 1, -64, -64, 10, 8, 0, 1, 0, 2, 32.25, 15.5, 256.25, 8.6, 57581 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 1000000, 0, 1, -64, -64, 10, 8, 0, 1, 0, 2, 32.25, 15.5, 256.25, 8.6, 57581 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 1000000, 0, 1, -64, -64, 10, 8, 0, 1, 0, 2, 32.25, 15.5, 256.25, 8.6, 57581 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 1000000, 0, 1, -64, -64, 10, 8, 0, 1, 0, 2, 32.25, 15.5, 256.25, 8.6, 57581 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 1000000, 0, 1, -64, -64, 10, 8, 0, 1, 0, 2, 32.25, 15.5, 256.25, 8.6, 57581 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 1000000, 0, 1, -64, -64, 10, 8, 0, 1, 0, 2, 32.25, 15.5, 256.25, 8.6, 57581 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 1000000, 0, 1, -64, -64, 10, 8, 0, 1, 0, 2, 32.25, 15.5, 256.25, 8.6, 57581 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 1000000, 0, 1, -64, -64, 10, 8, 0, 1, 0, 2, 32.25, 15.5, 256.25, 8.6, 57581 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 1000000, 0, 1, -64, -64, 10, 8, 0, 1, 0, 2, 32.25, 15.5, 256.25, 8.6, 57581 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 1000000, 0, 1, -64, -64, 10, 8, 0, 1, 0, 2, 32.25, 15.5, 256.25, 8.6, 57581 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 1000000, 0, 1, -64, -64, 10, 8, 0, 1, 0, 2, 32.25, 15.5, 256.25, 8.6, 57581 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 1000000, 0, 1, -64, -64, 10, 8, 0, 1, 0, 2, 32.25, 15.5, 256.25, 8.6, 57581 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 1000000, 0, 1, -64, -64, 10, 8, 0, 1, 0, 2, 32.25, 15.5, 256.25, 8.6, 57581 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 1000000, 0, 1, -64, -64, 10, 8, 0, 1, 0, 2, 32.25, 15.5, 256.25, 8.6, 57581 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 1000000, 0, 1, -64, -64, 10, 8, 0, 1, 0, 2, 32.25, 15.5, 256.25, 8.6, 57581 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 1000000, 0, 1, -64, -64, 10, 8, 0, 1, 0, 2, 32.25, 15.5, 256.25, 8.6, 57581 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 1000000, 0, 1, -64, -64, 10, 8, 0, 1, 0, 2, 32.25, 15.5, 256.25, 8.6, 57581 }; [L59] signed long int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L60] unsigned char* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L61] unsigned char* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L62] signed short int* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L63] signed short int* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L64] signed short int* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L65] signed short int* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L66] unsigned char* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L67] unsigned char* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L68] unsigned char* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L69] unsigned short int* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L70] float* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L71] float* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L72] float* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L73] double* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L74] unsigned short int* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L75] unsigned char last_1_WrapperStruct00_var_1_9 = 0; [L146] isInitial = 1 [L147] FCALL initially() [L148] COND TRUE 1 [L149] CALL updateLastVariables() [L139] EXPR WrapperStruct00.var_1_9 [L139] last_1_WrapperStruct00_var_1_9 = WrapperStruct00.var_1_9 [L149] RET updateLastVariables() [L150] CALL updateVariables() [L104] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L105] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L106] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L107] WrapperStruct00.var_1_3 = __VERIFIER_nondet_uchar() [L108] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L109] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L110] WrapperStruct00.var_1_6 = __VERIFIER_nondet_short() [L111] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= -32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= -32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L112] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 32766) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 32766) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L113] WrapperStruct00.var_1_7 = __VERIFIER_nondet_short() [L114] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L115] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L116] WrapperStruct00.var_1_8 = __VERIFIER_nondet_short() [L117] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L118] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 32766) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 32766) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L119] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L120] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L121] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L121] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L121] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L122] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L123] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L123] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L123] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L124] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L124] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L124] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L125] WrapperStruct00.var_1_13 = __VERIFIER_nondet_float() [L126] EXPR WrapperStruct00.var_1_13 [L126] EXPR WrapperStruct00.var_1_13 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L126] EXPR WrapperStruct00.var_1_13 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L126] EXPR WrapperStruct00.var_1_13 [L126] EXPR WrapperStruct00.var_1_13 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L126] EXPR (WrapperStruct00.var_1_13 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L126] EXPR (WrapperStruct00.var_1_13 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L126] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L126] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L127] WrapperStruct00.var_1_14 = __VERIFIER_nondet_float() [L128] EXPR WrapperStruct00.var_1_14 [L128] EXPR WrapperStruct00.var_1_14 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L128] EXPR WrapperStruct00.var_1_14 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F [L128] EXPR WrapperStruct00.var_1_14 [L128] EXPR WrapperStruct00.var_1_14 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L128] EXPR (WrapperStruct00.var_1_14 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L128] EXPR (WrapperStruct00.var_1_14 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L128] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L128] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L129] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L129] CALL assume_abort_if_not(WrapperStruct00.var_1_14 != 0.0F) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L129] RET assume_abort_if_not(WrapperStruct00.var_1_14 != 0.0F) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L130] WrapperStruct00.var_1_15 = __VERIFIER_nondet_float() [L131] EXPR WrapperStruct00.var_1_15 [L131] EXPR WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L131] EXPR WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F [L131] EXPR WrapperStruct00.var_1_15 [L131] EXPR WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L131] EXPR (WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L131] EXPR (WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L131] CALL assume_abort_if_not((WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L131] RET assume_abort_if_not((WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L132] WrapperStruct00.var_1_16 = __VERIFIER_nondet_double() [L133] EXPR WrapperStruct00.var_1_16 [L133] EXPR WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L133] EXPR WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F [L133] EXPR WrapperStruct00.var_1_16 [L133] EXPR WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L133] EXPR (WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L133] EXPR (WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L133] CALL assume_abort_if_not((WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L133] RET assume_abort_if_not((WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L134] WrapperStruct00.var_1_17 = __VERIFIER_nondet_ushort() [L135] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L135] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L135] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L136] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L136] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L136] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L150] RET updateVariables() [L151] CALL step() [L79] COND FALSE !(\read(last_1_WrapperStruct00_var_1_9)) [L82] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L82] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L82] (*(WrapperStruct00_var_1_5_Pointer)) = (((*(WrapperStruct00_var_1_7_Pointer)) + 16) - (*(WrapperStruct00_var_1_8_Pointer))) [L84] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L84] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L84] EXPR \read(*WrapperStruct00_var_1_15_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L84] COND TRUE ((*(WrapperStruct00_var_1_13_Pointer)) / (*(WrapperStruct00_var_1_14_Pointer))) <= (*(WrapperStruct00_var_1_15_Pointer)) [L85] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L85] EXPR \read(*WrapperStruct00_var_1_14_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L85] COND TRUE ((*(WrapperStruct00_var_1_16_Pointer)) - 2.3) > (*(WrapperStruct00_var_1_14_Pointer)) [L86] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L86] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L86] (*(WrapperStruct00_var_1_12_Pointer)) = ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer))) [L93] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L93] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L93] EXPR ((*(WrapperStruct00_var_1_5_Pointer)) >= (*(WrapperStruct00_var_1_12_Pointer))) && (*(WrapperStruct00_var_1_2_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L93] EXPR ((*(WrapperStruct00_var_1_5_Pointer)) >= (*(WrapperStruct00_var_1_12_Pointer))) && (*(WrapperStruct00_var_1_2_Pointer)) [L93] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L93] EXPR ((*(WrapperStruct00_var_1_5_Pointer)) >= (*(WrapperStruct00_var_1_12_Pointer))) && (*(WrapperStruct00_var_1_2_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L93] (((*(WrapperStruct00_var_1_5_Pointer)) >= (*(WrapperStruct00_var_1_12_Pointer))) && (*(WrapperStruct00_var_1_2_Pointer))) && (*(WrapperStruct00_var_1_3_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L93] (((*(WrapperStruct00_var_1_5_Pointer)) >= (*(WrapperStruct00_var_1_12_Pointer))) && (*(WrapperStruct00_var_1_2_Pointer))) && (*(WrapperStruct00_var_1_3_Pointer)) [L93] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L93] (((*(WrapperStruct00_var_1_5_Pointer)) >= (*(WrapperStruct00_var_1_12_Pointer))) && (*(WrapperStruct00_var_1_2_Pointer))) && (*(WrapperStruct00_var_1_3_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L93] COND TRUE (((*(WrapperStruct00_var_1_5_Pointer)) >= (*(WrapperStruct00_var_1_12_Pointer))) && (*(WrapperStruct00_var_1_2_Pointer))) && (*(WrapperStruct00_var_1_3_Pointer)) [L94] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L94] (*(WrapperStruct00_var_1_9_Pointer)) = (! (*(WrapperStruct00_var_1_10_Pointer))) [L98] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L98] unsigned char stepLocal_0 = (*(WrapperStruct00_var_1_9_Pointer)); [L99] stepLocal_0 && (*(WrapperStruct00_var_1_9_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L99] stepLocal_0 && (*(WrapperStruct00_var_1_9_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L99] COND FALSE !(stepLocal_0 && (*(WrapperStruct00_var_1_9_Pointer))) [L151] RET step() [L152] CALL, EXPR property() [L142] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L142] EXPR (*(WrapperStruct00_var_1_9_Pointer)) && (*(WrapperStruct00_var_1_9_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L142] EXPR (*(WrapperStruct00_var_1_9_Pointer)) && (*(WrapperStruct00_var_1_9_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L142] EXPR ((*(WrapperStruct00_var_1_9_Pointer)) && (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_5_Pointer)))) : 1 [L142] EXPR ((*(WrapperStruct00_var_1_9_Pointer)) && (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_5_Pointer)))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L142] EXPR (((*(WrapperStruct00_var_1_9_Pointer)) && (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_5_Pointer)))) : 1) && (last_1_WrapperStruct00_var_1_9 ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((signed short int) (((*(WrapperStruct00_var_1_7_Pointer)) + 16) - (*(WrapperStruct00_var_1_8_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L142] EXPR (((*(WrapperStruct00_var_1_9_Pointer)) && (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_5_Pointer)))) : 1) && (last_1_WrapperStruct00_var_1_9 ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((signed short int) (((*(WrapperStruct00_var_1_7_Pointer)) + 16) - (*(WrapperStruct00_var_1_8_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L142] EXPR last_1_WrapperStruct00_var_1_9 ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((signed short int) (((*(WrapperStruct00_var_1_7_Pointer)) + 16) - (*(WrapperStruct00_var_1_8_Pointer))))) [L142] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L142] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L142] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L142] EXPR last_1_WrapperStruct00_var_1_9 ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((signed short int) (((*(WrapperStruct00_var_1_7_Pointer)) + 16) - (*(WrapperStruct00_var_1_8_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L142] EXPR (((*(WrapperStruct00_var_1_9_Pointer)) && (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_5_Pointer)))) : 1) && (last_1_WrapperStruct00_var_1_9 ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((signed short int) (((*(WrapperStruct00_var_1_7_Pointer)) + 16) - (*(WrapperStruct00_var_1_8_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L142] EXPR ((((*(WrapperStruct00_var_1_9_Pointer)) && (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_5_Pointer)))) : 1) && (last_1_WrapperStruct00_var_1_9 ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((signed short int) (((*(WrapperStruct00_var_1_7_Pointer)) + 16) - (*(WrapperStruct00_var_1_8_Pointer))))))) && (((((*(WrapperStruct00_var_1_5_Pointer)) >= (*(WrapperStruct00_var_1_12_Pointer))) && (*(WrapperStruct00_var_1_2_Pointer))) && (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_10_Pointer))))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_11_Pointer)) || (*(WrapperStruct00_var_1_10_Pointer))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L142] EXPR ((((*(WrapperStruct00_var_1_9_Pointer)) && (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_5_Pointer)))) : 1) && (last_1_WrapperStruct00_var_1_9 ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((signed short int) (((*(WrapperStruct00_var_1_7_Pointer)) + 16) - (*(WrapperStruct00_var_1_8_Pointer))))))) && (((((*(WrapperStruct00_var_1_5_Pointer)) >= (*(WrapperStruct00_var_1_12_Pointer))) && (*(WrapperStruct00_var_1_2_Pointer))) && (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_10_Pointer))))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_11_Pointer)) || (*(WrapperStruct00_var_1_10_Pointer))))))) [L142] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L142] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L142] EXPR ((*(WrapperStruct00_var_1_5_Pointer)) >= (*(WrapperStruct00_var_1_12_Pointer))) && (*(WrapperStruct00_var_1_2_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L142] EXPR ((*(WrapperStruct00_var_1_5_Pointer)) >= (*(WrapperStruct00_var_1_12_Pointer))) && (*(WrapperStruct00_var_1_2_Pointer)) [L142] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L142] EXPR ((*(WrapperStruct00_var_1_5_Pointer)) >= (*(WrapperStruct00_var_1_12_Pointer))) && (*(WrapperStruct00_var_1_2_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L142] EXPR (((*(WrapperStruct00_var_1_5_Pointer)) >= (*(WrapperStruct00_var_1_12_Pointer))) && (*(WrapperStruct00_var_1_2_Pointer))) && (*(WrapperStruct00_var_1_3_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L142] EXPR (((*(WrapperStruct00_var_1_5_Pointer)) >= (*(WrapperStruct00_var_1_12_Pointer))) && (*(WrapperStruct00_var_1_2_Pointer))) && (*(WrapperStruct00_var_1_3_Pointer)) [L142] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L142] EXPR (((*(WrapperStruct00_var_1_5_Pointer)) >= (*(WrapperStruct00_var_1_12_Pointer))) && (*(WrapperStruct00_var_1_2_Pointer))) && (*(WrapperStruct00_var_1_3_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L142] EXPR ((((*(WrapperStruct00_var_1_5_Pointer)) >= (*(WrapperStruct00_var_1_12_Pointer))) && (*(WrapperStruct00_var_1_2_Pointer))) && (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_10_Pointer))))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_11_Pointer)) || (*(WrapperStruct00_var_1_10_Pointer)))))) [L142] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L142] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L142] EXPR ((((*(WrapperStruct00_var_1_5_Pointer)) >= (*(WrapperStruct00_var_1_12_Pointer))) && (*(WrapperStruct00_var_1_2_Pointer))) && (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_10_Pointer))))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_11_Pointer)) || (*(WrapperStruct00_var_1_10_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L142] EXPR ((((*(WrapperStruct00_var_1_9_Pointer)) && (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_5_Pointer)))) : 1) && (last_1_WrapperStruct00_var_1_9 ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((signed short int) (((*(WrapperStruct00_var_1_7_Pointer)) + 16) - (*(WrapperStruct00_var_1_8_Pointer))))))) && (((((*(WrapperStruct00_var_1_5_Pointer)) >= (*(WrapperStruct00_var_1_12_Pointer))) && (*(WrapperStruct00_var_1_2_Pointer))) && (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_10_Pointer))))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_11_Pointer)) || (*(WrapperStruct00_var_1_10_Pointer))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L142] EXPR (((((*(WrapperStruct00_var_1_9_Pointer)) && (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_5_Pointer)))) : 1) && (last_1_WrapperStruct00_var_1_9 ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((signed short int) (((*(WrapperStruct00_var_1_7_Pointer)) + 16) - (*(WrapperStruct00_var_1_8_Pointer))))))) && (((((*(WrapperStruct00_var_1_5_Pointer)) >= (*(WrapperStruct00_var_1_12_Pointer))) && (*(WrapperStruct00_var_1_2_Pointer))) && (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_10_Pointer))))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_11_Pointer)) || (*(WrapperStruct00_var_1_10_Pointer)))))))) && ((((*(WrapperStruct00_var_1_13_Pointer)) / (*(WrapperStruct00_var_1_14_Pointer))) <= (*(WrapperStruct00_var_1_15_Pointer))) ? ((((*(WrapperStruct00_var_1_16_Pointer)) - 2.3) > (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned short int) ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_7_Pointer))) > ((((((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_7_Pointer))) : ((((((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_8_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L142] EXPR (((((*(WrapperStruct00_var_1_9_Pointer)) && (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_5_Pointer)))) : 1) && (last_1_WrapperStruct00_var_1_9 ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((signed short int) (((*(WrapperStruct00_var_1_7_Pointer)) + 16) - (*(WrapperStruct00_var_1_8_Pointer))))))) && (((((*(WrapperStruct00_var_1_5_Pointer)) >= (*(WrapperStruct00_var_1_12_Pointer))) && (*(WrapperStruct00_var_1_2_Pointer))) && (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_10_Pointer))))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_11_Pointer)) || (*(WrapperStruct00_var_1_10_Pointer)))))))) && ((((*(WrapperStruct00_var_1_13_Pointer)) / (*(WrapperStruct00_var_1_14_Pointer))) <= (*(WrapperStruct00_var_1_15_Pointer))) ? ((((*(WrapperStruct00_var_1_16_Pointer)) - 2.3) > (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned short int) ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_7_Pointer))) > ((((((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_7_Pointer))) : ((((((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_8_Pointer))))) [L142] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L142] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L142] EXPR \read(*WrapperStruct00_var_1_15_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L142] EXPR (((*(WrapperStruct00_var_1_13_Pointer)) / (*(WrapperStruct00_var_1_14_Pointer))) <= (*(WrapperStruct00_var_1_15_Pointer))) ? ((((*(WrapperStruct00_var_1_16_Pointer)) - 2.3) > (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned short int) ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_7_Pointer))) > ((((((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_7_Pointer))) : ((((((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_8_Pointer)))) [L142] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L142] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L142] EXPR (((*(WrapperStruct00_var_1_13_Pointer)) / (*(WrapperStruct00_var_1_14_Pointer))) <= (*(WrapperStruct00_var_1_15_Pointer))) ? ((((*(WrapperStruct00_var_1_16_Pointer)) - 2.3) > (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned short int) ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_7_Pointer))) > ((((((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_7_Pointer))) : ((((((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_8_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L142] EXPR (((((*(WrapperStruct00_var_1_9_Pointer)) && (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_5_Pointer)))) : 1) && (last_1_WrapperStruct00_var_1_9 ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((signed short int) (((*(WrapperStruct00_var_1_7_Pointer)) + 16) - (*(WrapperStruct00_var_1_8_Pointer))))))) && (((((*(WrapperStruct00_var_1_5_Pointer)) >= (*(WrapperStruct00_var_1_12_Pointer))) && (*(WrapperStruct00_var_1_2_Pointer))) && (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_10_Pointer))))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_11_Pointer)) || (*(WrapperStruct00_var_1_10_Pointer)))))))) && ((((*(WrapperStruct00_var_1_13_Pointer)) / (*(WrapperStruct00_var_1_14_Pointer))) <= (*(WrapperStruct00_var_1_15_Pointer))) ? ((((*(WrapperStruct00_var_1_16_Pointer)) - 2.3) > (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned short int) ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_7_Pointer))) > ((((((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_7_Pointer))) : ((((((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_8_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L142-L143] return (((((*(WrapperStruct00_var_1_9_Pointer)) && (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_5_Pointer)))) : 1) && (last_1_WrapperStruct00_var_1_9 ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((signed short int) (((*(WrapperStruct00_var_1_7_Pointer)) + 16) - (*(WrapperStruct00_var_1_8_Pointer))))))) && (((((*(WrapperStruct00_var_1_5_Pointer)) >= (*(WrapperStruct00_var_1_12_Pointer))) && (*(WrapperStruct00_var_1_2_Pointer))) && (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_10_Pointer))))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_11_Pointer)) || (*(WrapperStruct00_var_1_10_Pointer)))))))) && ((((*(WrapperStruct00_var_1_13_Pointer)) / (*(WrapperStruct00_var_1_14_Pointer))) <= (*(WrapperStruct00_var_1_15_Pointer))) ? ((((*(WrapperStruct00_var_1_16_Pointer)) - 2.3) > (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned short int) ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_7_Pointer))) > ((((((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_7_Pointer))) : ((((((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_8_Pointer))))) ; [L152] RET, EXPR property() [L152] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:6}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 121 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 41.4s, OverallIterations: 21, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4921 SdHoareTripleChecker+Valid, 7.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4892 mSDsluCounter, 10946 SdHoareTripleChecker+Invalid, 6.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8057 mSDsCounter, 574 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8853 IncrementalHoareTripleChecker+Invalid, 9427 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 574 mSolverCounterUnsat, 2889 mSDtfsCounter, 8853 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1526 GetRequests, 1296 SyntacticMatches, 4 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 932 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=631occurred in iteration=17, InterpolantAutomatonStates: 158, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 20 MinimizatonAttempts, 644 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 26.6s InterpolantComputationTime, 3860 NumberOfCodeBlocks, 3860 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 3665 ConstructedInterpolants, 0 QuantifiedInterpolants, 36174 SizeOfPredicates, 21 NumberOfNonLiveVariables, 1175 ConjunctsInSsa, 99 ConjunctsInUnsatCore, 22 InterpolantComputations, 18 PerfectInterpolantSequences, 18068/18480 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:36:17,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-14.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 57bda971cc74fc0d01c70e8ff55abb0ecbc2be19f4d9bb39359109904330c6bf --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:36:20,177 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:36:20,246 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 06:36:20,250 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:36:20,251 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:36:20,277 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:36:20,280 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:36:20,281 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:36:20,281 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:36:20,282 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:36:20,282 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:36:20,282 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:36:20,283 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:36:20,284 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:36:20,285 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:36:20,285 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:36:20,286 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:36:20,286 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:36:20,286 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:36:20,286 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:36:20,289 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:36:20,289 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:36:20,290 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:36:20,290 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 06:36:20,290 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 06:36:20,290 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:36:20,290 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 06:36:20,290 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:36:20,291 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:36:20,291 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:36:20,291 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:36:20,291 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:36:20,291 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:36:20,291 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:36:20,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:36:20,292 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:36:20,298 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:36:20,299 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:36:20,299 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 06:36:20,299 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 06:36:20,299 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:36:20,301 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:36:20,301 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:36:20,301 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:36:20,301 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 06:36:20,302 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 -> 57bda971cc74fc0d01c70e8ff55abb0ecbc2be19f4d9bb39359109904330c6bf [2024-10-13 06:36:20,608 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:36:20,648 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:36:20,651 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:36:20,652 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:36:20,654 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:36:20,656 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-14.i [2024-10-13 06:36:22,179 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:36:22,454 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:36:22,454 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-14.i [2024-10-13 06:36:22,465 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44f675def/3e6817965a734ac791a6e0bb0bd87a2d/FLAGc18f6ac60 [2024-10-13 06:36:22,483 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44f675def/3e6817965a734ac791a6e0bb0bd87a2d [2024-10-13 06:36:22,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:36:22,488 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:36:22,489 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:36:22,490 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:36:22,495 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:36:22,496 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:36:22" (1/1) ... [2024-10-13 06:36:22,497 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3824ede6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:36:22, skipping insertion in model container [2024-10-13 06:36:22,497 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:36:22" (1/1) ... [2024-10-13 06:36:22,532 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:36:22,710 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-14.i[917,930] [2024-10-13 06:36:22,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:36:22,825 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:36:22,838 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-14.i[917,930] [2024-10-13 06:36:22,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:36:22,934 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:36:22,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:36:22 WrapperNode [2024-10-13 06:36:22,935 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:36:22,936 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:36:22,936 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:36:22,936 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:36:22,942 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:36:22" (1/1) ... [2024-10-13 06:36:22,969 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:36:22" (1/1) ... [2024-10-13 06:36:23,022 INFO L138 Inliner]: procedures = 39, calls = 183, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 572 [2024-10-13 06:36:23,022 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:36:23,024 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:36:23,024 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:36:23,024 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:36:23,035 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:36:22" (1/1) ... [2024-10-13 06:36:23,035 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:36:22" (1/1) ... [2024-10-13 06:36:23,047 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:36:22" (1/1) ... [2024-10-13 06:36:23,090 INFO L175 MemorySlicer]: Split 150 memory accesses to 2 slices as follows [2, 148]. 99 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 16]. The 20 writes are split as follows [0, 20]. [2024-10-13 06:36:23,090 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:36:22" (1/1) ... [2024-10-13 06:36:23,090 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:36:22" (1/1) ... [2024-10-13 06:36:23,119 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:36:22" (1/1) ... [2024-10-13 06:36:23,126 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:36:22" (1/1) ... [2024-10-13 06:36:23,131 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:36:22" (1/1) ... [2024-10-13 06:36:23,135 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:36:22" (1/1) ... [2024-10-13 06:36:23,140 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:36:23,141 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:36:23,142 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:36:23,142 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:36:23,143 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:36:22" (1/1) ... [2024-10-13 06:36:23,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:36:23,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:36:23,180 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:36:23,183 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:36:23,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:36:23,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-13 06:36:23,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-13 06:36:23,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-13 06:36:23,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-13 06:36:23,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 06:36:23,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 06:36:23,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-13 06:36:23,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-13 06:36:23,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 06:36:23,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 06:36:23,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-13 06:36:23,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-13 06:36:23,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-13 06:36:23,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-13 06:36:23,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-13 06:36:23,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-13 06:36:23,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 06:36:23,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 06:36:23,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-13 06:36:23,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-13 06:36:23,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-13 06:36:23,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-13 06:36:23,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-13 06:36:23,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-13 06:36:23,230 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:36:23,230 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:36:23,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:36:23,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:36:23,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-13 06:36:23,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-13 06:36:23,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-13 06:36:23,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-13 06:36:23,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 06:36:23,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 06:36:23,367 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:36:23,369 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:36:28,915 INFO L? ?]: Removed 140 outVars from TransFormulas that were not future-live. [2024-10-13 06:36:28,916 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:36:28,995 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:36:28,996 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:36:28,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:36:28 BoogieIcfgContainer [2024-10-13 06:36:28,996 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:36:28,998 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:36:28,998 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:36:29,007 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:36:29,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:36:22" (1/3) ... [2024-10-13 06:36:29,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16092d72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:36:29, skipping insertion in model container [2024-10-13 06:36:29,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:36:22" (2/3) ... [2024-10-13 06:36:29,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16092d72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:36:29, skipping insertion in model container [2024-10-13 06:36:29,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:36:28" (3/3) ... [2024-10-13 06:36:29,014 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-14.i [2024-10-13 06:36:29,048 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:36:29,048 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:36:29,161 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:36:29,179 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;@3da20029, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:36:29,179 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:36:29,188 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 97 states have (on average 1.4536082474226804) internal successors, (141), 98 states have internal predecessors, (141), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 06:36:29,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-13 06:36:29,202 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:36:29,203 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:29,203 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:36:29,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:36:29,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1045265753, now seen corresponding path program 1 times [2024-10-13 06:36:29,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:36:29,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [662148119] [2024-10-13 06:36:29,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:36:29,223 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:36:29,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:36:29,227 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:36:29,229 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:36:29,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:29,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 06:36:29,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:36:29,728 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 436 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2024-10-13 06:36:29,729 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:36:29,729 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:36:29,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [662148119] [2024-10-13 06:36:29,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [662148119] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:36:29,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:36:29,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:36:29,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958947923] [2024-10-13 06:36:29,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:36:29,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:36:29,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:36:29,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:36:29,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:36:29,754 INFO L87 Difference]: Start difference. First operand has 121 states, 97 states have (on average 1.4536082474226804) internal successors, (141), 98 states have internal predecessors, (141), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 06:36:29,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:36:29,813 INFO L93 Difference]: Finished difference Result 239 states and 385 transitions. [2024-10-13 06:36:29,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:36:29,815 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 163 [2024-10-13 06:36:29,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:36:29,823 INFO L225 Difference]: With dead ends: 239 [2024-10-13 06:36:29,823 INFO L226 Difference]: Without dead ends: 119 [2024-10-13 06:36:29,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 162 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:36:29,830 INFO L432 NwaCegarLoop]: 174 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, 174 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:36:29,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 174 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:36:29,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-13 06:36:29,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-10-13 06:36:29,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 96 states have (on average 1.4166666666666667) internal successors, (136), 96 states have internal predecessors, (136), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 06:36:29,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 178 transitions. [2024-10-13 06:36:29,885 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 178 transitions. Word has length 163 [2024-10-13 06:36:29,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:36:29,885 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 178 transitions. [2024-10-13 06:36:29,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 06:36:29,886 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 178 transitions. [2024-10-13 06:36:29,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-13 06:36:29,889 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:36:29,889 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:29,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-13 06:36:30,093 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:36:30,095 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:36:30,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:36:30,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1512887547, now seen corresponding path program 1 times [2024-10-13 06:36:30,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:36:30,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [272032598] [2024-10-13 06:36:30,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:36:30,098 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:36:30,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:36:30,101 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:36:30,102 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:36:30,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:30,563 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 06:36:30,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:36:30,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-13 06:36:31,151 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:36:31,153 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:36:31,153 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:36:31,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [272032598] [2024-10-13 06:36:31,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [272032598] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:36:31,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:36:31,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 06:36:31,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661801942] [2024-10-13 06:36:31,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:36:31,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:36:31,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:36:31,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:36:31,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:36:31,157 INFO L87 Difference]: Start difference. First operand 119 states and 178 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:36:32,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 06:36:35,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:36:35,787 INFO L93 Difference]: Finished difference Result 356 states and 533 transitions. [2024-10-13 06:36:35,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:36:35,788 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2024-10-13 06:36:35,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:36:35,790 INFO L225 Difference]: With dead ends: 356 [2024-10-13 06:36:35,791 INFO L226 Difference]: Without dead ends: 238 [2024-10-13 06:36:35,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:36:35,792 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 141 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-10-13 06:36:35,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 406 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-10-13 06:36:35,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-13 06:36:35,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 211. [2024-10-13 06:36:35,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 166 states have (on average 1.3975903614457832) internal successors, (232), 166 states have internal predecessors, (232), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 06:36:35,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 316 transitions. [2024-10-13 06:36:35,818 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 316 transitions. Word has length 163 [2024-10-13 06:36:35,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:36:35,821 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 316 transitions. [2024-10-13 06:36:35,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:36:35,821 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 316 transitions. [2024-10-13 06:36:35,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-13 06:36:35,823 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:36:35,823 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:35,840 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 (3)] Forceful destruction successful, exit code 0 [2024-10-13 06:36:36,024 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:36:36,024 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:36:36,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:36:36,025 INFO L85 PathProgramCache]: Analyzing trace with hash -292550787, now seen corresponding path program 1 times [2024-10-13 06:36:36,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:36:36,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1598162228] [2024-10-13 06:36:36,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:36:36,026 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:36:36,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:36:36,047 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:36:36,049 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:36:36,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:36,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 06:36:36,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:36:36,536 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:36:36,536 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:36:36,537 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:36:36,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1598162228] [2024-10-13 06:36:36,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1598162228] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:36:36,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:36:36,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:36:36,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529096815] [2024-10-13 06:36:36,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:36:36,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:36:36,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:36:36,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:36:36,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:36:36,539 INFO L87 Difference]: Start difference. First operand 211 states and 316 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:36:36,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:36:36,663 INFO L93 Difference]: Finished difference Result 359 states and 541 transitions. [2024-10-13 06:36:36,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:36:36,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2024-10-13 06:36:36,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:36:36,666 INFO L225 Difference]: With dead ends: 359 [2024-10-13 06:36:36,667 INFO L226 Difference]: Without dead ends: 217 [2024-10-13 06:36:36,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 160 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:36:36,669 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 1 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:36:36,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 505 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:36:36,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-10-13 06:36:36,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2024-10-13 06:36:36,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 172 states have (on average 1.3837209302325582) internal successors, (238), 172 states have internal predecessors, (238), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 06:36:36,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 322 transitions. [2024-10-13 06:36:36,697 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 322 transitions. Word has length 163 [2024-10-13 06:36:36,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:36:36,699 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 322 transitions. [2024-10-13 06:36:36,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:36:36,699 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 322 transitions. [2024-10-13 06:36:36,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-13 06:36:36,704 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:36:36,704 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:36,718 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 (4)] Ended with exit code 0 [2024-10-13 06:36:36,905 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:36:36,905 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:36:36,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:36:36,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1396392955, now seen corresponding path program 1 times [2024-10-13 06:36:36,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:36:36,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [727458079] [2024-10-13 06:36:36,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:36:36,907 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:36:36,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:36:36,915 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:36:36,916 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:36:37,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:37,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 06:36:37,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:36:37,300 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:36:37,301 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:36:37,301 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:36:37,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [727458079] [2024-10-13 06:36:37,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [727458079] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:36:37,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:36:37,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:36:37,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980169006] [2024-10-13 06:36:37,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:36:37,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:36:37,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:36:37,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:36:37,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:36:37,309 INFO L87 Difference]: Start difference. First operand 217 states and 322 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:36:40,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 06:36:41,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:36:41,558 INFO L93 Difference]: Finished difference Result 367 states and 547 transitions. [2024-10-13 06:36:41,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:36:41,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2024-10-13 06:36:41,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:36:41,561 INFO L225 Difference]: With dead ends: 367 [2024-10-13 06:36:41,561 INFO L226 Difference]: Without dead ends: 219 [2024-10-13 06:36:41,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:36:41,563 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 1 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:36:41,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 432 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-13 06:36:41,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-13 06:36:41,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-10-13 06:36:41,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 174 states have (on average 1.3793103448275863) internal successors, (240), 174 states have internal predecessors, (240), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 06:36:41,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 324 transitions. [2024-10-13 06:36:41,591 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 324 transitions. Word has length 163 [2024-10-13 06:36:41,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:36:41,592 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 324 transitions. [2024-10-13 06:36:41,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:36:41,593 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 324 transitions. [2024-10-13 06:36:41,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-13 06:36:41,594 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:36:41,595 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:41,612 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 (5)] Forceful destruction successful, exit code 0 [2024-10-13 06:36:41,795 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:36:41,796 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:36:41,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:36:41,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1983198969, now seen corresponding path program 1 times [2024-10-13 06:36:41,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:36:41,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [451361192] [2024-10-13 06:36:41,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:36:41,798 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:36:41,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:36:41,801 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:36:41,804 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:36:42,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:42,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 06:36:42,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:36:42,916 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:36:42,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-10-13 06:36:42,966 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2024-10-13 06:36:42,967 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:36:42,967 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:36:42,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [451361192] [2024-10-13 06:36:42,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [451361192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:36:42,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:36:42,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:36:42,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766182273] [2024-10-13 06:36:42,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:36:42,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:36:42,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:36:42,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:36:42,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:36:42,969 INFO L87 Difference]: Start difference. First operand 219 states and 324 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 06:36:45,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []