./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-75.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-75.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 3ea1453e8ddb919b166a2b196c485b49328495abf45a9dcbd47a0aceac1e3901 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 14:02:56,526 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:02:56,582 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 14:02:56,587 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:02:56,588 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:02:56,620 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:02:56,621 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:02:56,622 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:02:56,622 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:02:56,623 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:02:56,624 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:02:56,624 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:02:56,625 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:02:56,626 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:02:56,627 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:02:56,628 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:02:56,628 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:02:56,629 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 14:02:56,629 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 14:02:56,629 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 14:02:56,629 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:02:56,630 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:02:56,631 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:02:56,631 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:02:56,631 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:02:56,632 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 14:02:56,632 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:02:56,632 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:02:56,632 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:02:56,633 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:02:56,633 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:02:56,633 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:02:56,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:02:56,634 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:02:56,634 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:02:56,635 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:02:56,635 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 14:02:56,635 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 14:02:56,635 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:02:56,636 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:02:56,636 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:02:56,636 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:02:56,636 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-clean/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-clean/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 -> 3ea1453e8ddb919b166a2b196c485b49328495abf45a9dcbd47a0aceac1e3901 [2024-10-11 14:02:56,912 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:02:56,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:02:56,945 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:02:56,946 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:02:56,947 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:02:56,948 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-75.i [2024-10-11 14:02:58,440 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:02:58,680 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:02:58,681 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-75.i [2024-10-11 14:02:58,696 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a85a7bdd0/7f158f5001e54c6792fd109c0f56dfb3/FLAGd7e72ade4 [2024-10-11 14:02:59,017 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a85a7bdd0/7f158f5001e54c6792fd109c0f56dfb3 [2024-10-11 14:02:59,019 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:02:59,020 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:02:59,022 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:02:59,023 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:02:59,028 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:02:59,029 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:02:59" (1/1) ... [2024-10-11 14:02:59,030 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32c01657 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:59, skipping insertion in model container [2024-10-11 14:02:59,030 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:02:59" (1/1) ... [2024-10-11 14:02:59,065 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:02:59,229 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-75.i[917,930] [2024-10-11 14:02:59,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:02:59,304 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:02:59,315 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-75.i[917,930] [2024-10-11 14:02:59,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:02:59,372 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:02:59,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:59 WrapperNode [2024-10-11 14:02:59,373 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:02:59,374 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:02:59,374 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:02:59,374 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:02:59,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:59" (1/1) ... [2024-10-11 14:02:59,399 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:59" (1/1) ... [2024-10-11 14:02:59,464 INFO L138 Inliner]: procedures = 29, calls = 160, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 473 [2024-10-11 14:02:59,464 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:02:59,465 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:02:59,474 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:02:59,474 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:02:59,485 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:59" (1/1) ... [2024-10-11 14:02:59,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:59" (1/1) ... [2024-10-11 14:02:59,490 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:59" (1/1) ... [2024-10-11 14:02:59,516 INFO L175 MemorySlicer]: Split 131 memory accesses to 2 slices as follows [2, 129]. 98 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 14]. The 18 writes are split as follows [0, 18]. [2024-10-11 14:02:59,516 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:59" (1/1) ... [2024-10-11 14:02:59,517 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:59" (1/1) ... [2024-10-11 14:02:59,531 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:59" (1/1) ... [2024-10-11 14:02:59,536 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:59" (1/1) ... [2024-10-11 14:02:59,539 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:59" (1/1) ... [2024-10-11 14:02:59,541 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:59" (1/1) ... [2024-10-11 14:02:59,546 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:02:59,548 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:02:59,551 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:02:59,552 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:02:59,553 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:59" (1/1) ... [2024-10-11 14:02:59,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:02:59,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:02:59,589 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 14:02:59,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 14:02:59,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:02:59,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 14:02:59,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 14:02:59,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 14:02:59,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 14:02:59,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 14:02:59,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 14:02:59,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 14:02:59,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 14:02:59,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 14:02:59,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 14:02:59,650 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 14:02:59,650 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 14:02:59,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 14:02:59,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 14:02:59,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:02:59,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:02:59,784 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:02:59,786 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:03:00,274 INFO L? ?]: Removed 114 outVars from TransFormulas that were not future-live. [2024-10-11 14:03:00,274 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:03:00,309 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:03:00,310 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 14:03:00,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:03:00 BoogieIcfgContainer [2024-10-11 14:03:00,310 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:03:00,312 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:03:00,312 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:03:00,318 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:03:00,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:02:59" (1/3) ... [2024-10-11 14:03:00,319 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fe641aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:03:00, skipping insertion in model container [2024-10-11 14:03:00,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:59" (2/3) ... [2024-10-11 14:03:00,320 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fe641aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:03:00, skipping insertion in model container [2024-10-11 14:03:00,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:03:00" (3/3) ... [2024-10-11 14:03:00,321 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-75.i [2024-10-11 14:03:00,338 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:03:00,339 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 14:03:00,408 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:03:00,414 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;@2dbf47e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:03:00,415 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 14:03:00,420 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 70 states have (on average 1.4428571428571428) internal successors, (101), 71 states have internal predecessors, (101), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 14:03:00,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 14:03:00,434 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:03:00,435 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 14:03:00,436 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:03:00,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:03:00,441 INFO L85 PathProgramCache]: Analyzing trace with hash 139789455, now seen corresponding path program 1 times [2024-10-11 14:03:00,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:03:00,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140032348] [2024-10-11 14:03:00,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:03:00,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:03:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:00,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:03:00,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:00,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:03:00,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:00,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 14:03:00,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:00,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 14:03:00,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:00,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:03:00,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:00,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 14:03:00,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:00,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 14:03:00,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:00,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:03:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:00,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:03:00,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:00,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 14:03:00,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:00,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 14:03:00,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:00,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:03:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:00,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 14:03:00,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:00,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 14:03:00,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:03:01,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:03:01,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:03:01,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,025 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 14:03:01,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:03:01,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140032348] [2024-10-11 14:03:01,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140032348] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:03:01,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:03:01,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:03:01,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402838483] [2024-10-11 14:03:01,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:03:01,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 14:03:01,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:03:01,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 14:03:01,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 14:03:01,072 INFO L87 Difference]: Start difference. First operand has 90 states, 70 states have (on average 1.4428571428571428) internal successors, (101), 71 states have internal predecessors, (101), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 14:03:01,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:03:01,118 INFO L93 Difference]: Finished difference Result 177 states and 285 transitions. [2024-10-11 14:03:01,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 14:03:01,120 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 131 [2024-10-11 14:03:01,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:03:01,126 INFO L225 Difference]: With dead ends: 177 [2024-10-11 14:03:01,126 INFO L226 Difference]: Without dead ends: 88 [2024-10-11 14:03:01,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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-11 14:03:01,133 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:03:01,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:03:01,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-11 14:03:01,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-11 14:03:01,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 69 states have (on average 1.391304347826087) internal successors, (96), 69 states have internal predecessors, (96), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 14:03:01,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 130 transitions. [2024-10-11 14:03:01,180 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 130 transitions. Word has length 131 [2024-10-11 14:03:01,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:03:01,180 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 130 transitions. [2024-10-11 14:03:01,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 14:03:01,181 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 130 transitions. [2024-10-11 14:03:01,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 14:03:01,186 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:03:01,186 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 14:03:01,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 14:03:01,187 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:03:01,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:03:01,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1775774337, now seen corresponding path program 1 times [2024-10-11 14:03:01,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:03:01,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382590716] [2024-10-11 14:03:01,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:03:01,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:03:01,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:03:01,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:03:01,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 14:03:01,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 14:03:01,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:03:01,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 14:03:01,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 14:03:01,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:03:01,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:03:01,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 14:03:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 14:03:01,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:03:01,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 14:03:01,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 14:03:01,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:03:01,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:03:01,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:03:01,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,552 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 14:03:01,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:03:01,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382590716] [2024-10-11 14:03:01,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382590716] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:03:01,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:03:01,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:03:01,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073705917] [2024-10-11 14:03:01,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:03:01,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:03:01,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:03:01,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:03:01,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:03:01,560 INFO L87 Difference]: Start difference. First operand 88 states and 130 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 14:03:01,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:03:01,626 INFO L93 Difference]: Finished difference Result 177 states and 262 transitions. [2024-10-11 14:03:01,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:03:01,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 131 [2024-10-11 14:03:01,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:03:01,629 INFO L225 Difference]: With dead ends: 177 [2024-10-11 14:03:01,631 INFO L226 Difference]: Without dead ends: 90 [2024-10-11 14:03:01,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 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-11 14:03:01,633 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:03:01,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 365 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:03:01,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-11 14:03:01,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-11 14:03:01,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 71 states have (on average 1.380281690140845) internal successors, (98), 71 states have internal predecessors, (98), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 14:03:01,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 132 transitions. [2024-10-11 14:03:01,652 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 132 transitions. Word has length 131 [2024-10-11 14:03:01,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:03:01,653 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 132 transitions. [2024-10-11 14:03:01,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 14:03:01,654 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 132 transitions. [2024-10-11 14:03:01,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 14:03:01,657 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:03:01,658 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 14:03:01,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 14:03:01,658 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:03:01,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:03:01,660 INFO L85 PathProgramCache]: Analyzing trace with hash -797190273, now seen corresponding path program 1 times [2024-10-11 14:03:01,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:03:01,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599390387] [2024-10-11 14:03:01,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:03:01,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:03:01,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:03:01,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:03:01,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 14:03:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 14:03:01,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:03:01,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 14:03:01,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 14:03:01,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:03:01,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:03:01,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 14:03:01,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 14:03:01,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:03:01,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 14:03:01,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 14:03:01,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:03:01,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:03:01,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:03:01,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:01,941 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 14:03:01,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:03:01,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599390387] [2024-10-11 14:03:01,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599390387] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:03:01,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:03:01,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:03:01,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030072389] [2024-10-11 14:03:01,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:03:01,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:03:01,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:03:01,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:03:01,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:03:01,949 INFO L87 Difference]: Start difference. First operand 90 states and 132 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 14:03:02,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:03:02,011 INFO L93 Difference]: Finished difference Result 182 states and 267 transitions. [2024-10-11 14:03:02,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:03:02,011 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 131 [2024-10-11 14:03:02,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:03:02,014 INFO L225 Difference]: With dead ends: 182 [2024-10-11 14:03:02,014 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 14:03:02,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 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-11 14:03:02,016 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 1 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:03:02,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 362 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:03:02,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 14:03:02,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2024-10-11 14:03:02,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 73 states have (on average 1.36986301369863) internal successors, (100), 73 states have internal predecessors, (100), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 14:03:02,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2024-10-11 14:03:02,026 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 131 [2024-10-11 14:03:02,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:03:02,027 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2024-10-11 14:03:02,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 14:03:02,028 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2024-10-11 14:03:02,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 14:03:02,033 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:03:02,034 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 14:03:02,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 14:03:02,034 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:03:02,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:03:02,035 INFO L85 PathProgramCache]: Analyzing trace with hash -739931971, now seen corresponding path program 1 times [2024-10-11 14:03:02,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:03:02,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530758455] [2024-10-11 14:03:02,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:03:02,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:03:02,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:02,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:03:02,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:02,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:03:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:02,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 14:03:02,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:02,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 14:03:02,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:02,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:03:02,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:02,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 14:03:02,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:02,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 14:03:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:02,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:03:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:02,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:03:02,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:02,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 14:03:02,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:02,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 14:03:02,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:02,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:03:02,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:02,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 14:03:02,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:02,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 14:03:02,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:02,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:03:02,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:02,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:03:02,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:02,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:03:02,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:02,297 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 14:03:02,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:03:02,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530758455] [2024-10-11 14:03:02,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530758455] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:03:02,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:03:02,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:03:02,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488152469] [2024-10-11 14:03:02,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:03:02,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:03:02,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:03:02,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:03:02,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:03:02,302 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 14:03:02,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:03:02,354 INFO L93 Difference]: Finished difference Result 186 states and 271 transitions. [2024-10-11 14:03:02,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:03:02,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 131 [2024-10-11 14:03:02,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:03:02,359 INFO L225 Difference]: With dead ends: 186 [2024-10-11 14:03:02,360 INFO L226 Difference]: Without dead ends: 95 [2024-10-11 14:03:02,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 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-11 14:03:02,361 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 1 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:03:02,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 366 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:03:02,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-11 14:03:02,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2024-10-11 14:03:02,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 75 states have (on average 1.36) internal successors, (102), 75 states have internal predecessors, (102), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 14:03:02,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 136 transitions. [2024-10-11 14:03:02,378 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 136 transitions. Word has length 131 [2024-10-11 14:03:02,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:03:02,379 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 136 transitions. [2024-10-11 14:03:02,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 14:03:02,380 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 136 transitions. [2024-10-11 14:03:02,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 14:03:02,385 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:03:02,386 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 14:03:02,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 14:03:02,386 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:03:02,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:03:02,387 INFO L85 PathProgramCache]: Analyzing trace with hash -739872389, now seen corresponding path program 1 times [2024-10-11 14:03:02,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:03:02,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427671236] [2024-10-11 14:03:02,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:03:02,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:03:02,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:03,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:03:03,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:03,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:03:03,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:03,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 14:03:03,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:03,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 14:03:03,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:03,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:03:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:03,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 14:03:03,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:03,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 14:03:03,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:03,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:03:03,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:03,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:03:03,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:03,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 14:03:03,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:03,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 14:03:03,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:03,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:03:03,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:03,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 14:03:03,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:03,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 14:03:03,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:03,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:03:03,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:03,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:03:03,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:03,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:03:03,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:03,576 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 14:03:03,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:03:03,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427671236] [2024-10-11 14:03:03,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427671236] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:03:03,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:03:03,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 14:03:03,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583596830] [2024-10-11 14:03:03,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:03:03,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 14:03:03,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:03:03,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 14:03:03,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 14:03:03,579 INFO L87 Difference]: Start difference. First operand 94 states and 136 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 14:03:03,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:03:03,857 INFO L93 Difference]: Finished difference Result 187 states and 271 transitions. [2024-10-11 14:03:03,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:03:03,859 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 131 [2024-10-11 14:03:03,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:03:03,861 INFO L225 Difference]: With dead ends: 187 [2024-10-11 14:03:03,861 INFO L226 Difference]: Without dead ends: 94 [2024-10-11 14:03:03,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:03:03,866 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 167 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 14:03:03,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 307 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 14:03:03,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-11 14:03:03,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-11 14:03:03,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 75 states have (on average 1.3466666666666667) internal successors, (101), 75 states have internal predecessors, (101), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 14:03:03,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 135 transitions. [2024-10-11 14:03:03,883 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 135 transitions. Word has length 131 [2024-10-11 14:03:03,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:03:03,884 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 135 transitions. [2024-10-11 14:03:03,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 14:03:03,885 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 135 transitions. [2024-10-11 14:03:03,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 14:03:03,887 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:03:03,887 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 14:03:03,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 14:03:03,888 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:03:03,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:03:03,888 INFO L85 PathProgramCache]: Analyzing trace with hash -616259072, now seen corresponding path program 1 times [2024-10-11 14:03:03,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:03:03,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442946758] [2024-10-11 14:03:03,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:03:03,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:03:03,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:05,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:03:05,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:05,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:03:05,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:05,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 14:03:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:05,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 14:03:05,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:05,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:03:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:05,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 14:03:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:05,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 14:03:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:05,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:03:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:05,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:03:05,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:05,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 14:03:05,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:05,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 14:03:05,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:05,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:03:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:05,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 14:03:05,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:05,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 14:03:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:05,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:03:05,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:05,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:03:05,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:05,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:03:05,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:05,985 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 14:03:05,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:03:05,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442946758] [2024-10-11 14:03:05,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442946758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:03:05,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:03:05,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 14:03:05,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445210457] [2024-10-11 14:03:05,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:03:05,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 14:03:05,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:03:05,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 14:03:05,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-11 14:03:05,988 INFO L87 Difference]: Start difference. First operand 94 states and 135 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 14:03:07,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:03:07,264 INFO L93 Difference]: Finished difference Result 266 states and 378 transitions. [2024-10-11 14:03:07,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 14:03:07,265 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2024-10-11 14:03:07,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:03:07,267 INFO L225 Difference]: With dead ends: 266 [2024-10-11 14:03:07,267 INFO L226 Difference]: Without dead ends: 173 [2024-10-11 14:03:07,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2024-10-11 14:03:07,268 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 227 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 14:03:07,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 683 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 14:03:07,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-10-11 14:03:07,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 112. [2024-10-11 14:03:07,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 93 states have internal predecessors, (128), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 14:03:07,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 162 transitions. [2024-10-11 14:03:07,284 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 162 transitions. Word has length 133 [2024-10-11 14:03:07,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:03:07,285 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 162 transitions. [2024-10-11 14:03:07,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 14:03:07,285 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 162 transitions. [2024-10-11 14:03:07,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-11 14:03:07,287 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:03:07,287 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 14:03:07,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 14:03:07,287 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:03:07,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:03:07,288 INFO L85 PathProgramCache]: Analyzing trace with hash -320502859, now seen corresponding path program 1 times [2024-10-11 14:03:07,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:03:07,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718087051] [2024-10-11 14:03:07,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:03:07,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:03:07,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:07,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:03:07,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:07,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:03:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:07,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 14:03:07,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:08,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 14:03:08,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:08,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:03:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:08,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 14:03:08,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:08,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 14:03:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:08,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:03:08,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:08,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:03:08,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:08,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 14:03:08,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:08,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 14:03:08,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:08,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:03:08,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:08,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 14:03:08,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:08,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 14:03:08,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:08,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:03:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:08,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:03:08,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:08,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:03:08,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:08,108 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 14:03:08,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:03:08,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718087051] [2024-10-11 14:03:08,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718087051] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:03:08,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:03:08,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 14:03:08,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698207896] [2024-10-11 14:03:08,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:03:08,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 14:03:08,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:03:08,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 14:03:08,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 14:03:08,112 INFO L87 Difference]: Start difference. First operand 112 states and 162 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-11 14:03:08,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:03:08,761 INFO L93 Difference]: Finished difference Result 273 states and 395 transitions. [2024-10-11 14:03:08,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 14:03:08,762 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 134 [2024-10-11 14:03:08,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:03:08,764 INFO L225 Difference]: With dead ends: 273 [2024-10-11 14:03:08,764 INFO L226 Difference]: Without dead ends: 162 [2024-10-11 14:03:08,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-10-11 14:03:08,766 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 168 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 14:03:08,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 267 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 14:03:08,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-11 14:03:08,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2024-10-11 14:03:08,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 125 states have (on average 1.328) internal successors, (166), 126 states have internal predecessors, (166), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 14:03:08,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 230 transitions. [2024-10-11 14:03:08,801 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 230 transitions. Word has length 134 [2024-10-11 14:03:08,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:03:08,802 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 230 transitions. [2024-10-11 14:03:08,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-11 14:03:08,802 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 230 transitions. [2024-10-11 14:03:08,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-11 14:03:08,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:03:08,804 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 14:03:08,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 14:03:08,804 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:03:08,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:03:08,805 INFO L85 PathProgramCache]: Analyzing trace with hash 102198967, now seen corresponding path program 1 times [2024-10-11 14:03:08,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:03:08,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136007618] [2024-10-11 14:03:08,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:03:08,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:03:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:10,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:03:10,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:10,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:03:10,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:10,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 14:03:10,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:10,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 14:03:10,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:10,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:03:10,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:10,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 14:03:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:10,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 14:03:10,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:10,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:03:10,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:10,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:03:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:10,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 14:03:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:10,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 14:03:10,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:10,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:03:10,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:10,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 14:03:10,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:10,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 14:03:10,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:10,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:03:10,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:10,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:03:10,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:10,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:03:10,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:10,704 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 14:03:10,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:03:10,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136007618] [2024-10-11 14:03:10,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136007618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:03:10,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:03:10,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 14:03:10,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036236354] [2024-10-11 14:03:10,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:03:10,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 14:03:10,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:03:10,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 14:03:10,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-10-11 14:03:10,707 INFO L87 Difference]: Start difference. First operand 160 states and 230 transitions. Second operand has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-11 14:03:12,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:03:12,049 INFO L93 Difference]: Finished difference Result 317 states and 452 transitions. [2024-10-11 14:03:12,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 14:03:12,050 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 134 [2024-10-11 14:03:12,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:03:12,052 INFO L225 Difference]: With dead ends: 317 [2024-10-11 14:03:12,052 INFO L226 Difference]: Without dead ends: 200 [2024-10-11 14:03:12,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2024-10-11 14:03:12,053 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 238 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 920 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 14:03:12,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 354 Invalid, 995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 920 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 14:03:12,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-10-11 14:03:12,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 169. [2024-10-11 14:03:12,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 134 states have (on average 1.3432835820895523) internal successors, (180), 135 states have internal predecessors, (180), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 14:03:12,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 244 transitions. [2024-10-11 14:03:12,089 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 244 transitions. Word has length 134 [2024-10-11 14:03:12,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:03:12,089 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 244 transitions. [2024-10-11 14:03:12,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-11 14:03:12,090 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 244 transitions. [2024-10-11 14:03:12,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-11 14:03:12,091 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:03:12,091 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 14:03:12,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 14:03:12,092 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:03:12,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:03:12,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1177664711, now seen corresponding path program 1 times [2024-10-11 14:03:12,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:03:12,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717976729] [2024-10-11 14:03:12,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:03:12,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:03:12,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 14:03:12,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1238119564] [2024-10-11 14:03:12,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:03:12,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:03:12,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:03:12,230 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:03:12,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 14:03:12,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:12,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-10-11 14:03:12,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:03:15,797 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-11 14:03:16,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2024-10-11 14:03:16,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:03:16,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:03:16,214 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-11 14:03:16,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2024-10-11 14:03:16,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:03:16,312 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 14:03:16,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2024-10-11 14:03:16,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:03:16,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:03:16,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:03:16,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:03:16,537 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 14:03:16,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 31 [2024-10-11 14:03:16,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:03:16,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:03:16,652 INFO L349 Elim1Store]: treesize reduction 69, result has 9.2 percent of original size [2024-10-11 14:03:16,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 45 [2024-10-11 14:03:16,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:03:16,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:03:16,845 INFO L349 Elim1Store]: treesize reduction 20, result has 64.9 percent of original size [2024-10-11 14:03:16,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 44 treesize of output 52 [2024-10-11 14:03:16,894 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2024-10-11 14:03:16,894 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:03:33,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:03:33,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717976729] [2024-10-11 14:03:33,101 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 14:03:33,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238119564] [2024-10-11 14:03:33,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238119564] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:03:33,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 14:03:33,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2024-10-11 14:03:33,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864090566] [2024-10-11 14:03:33,101 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 14:03:33,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 14:03:33,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:03:33,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 14:03:33,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=339, Unknown=7, NotChecked=0, Total=420 [2024-10-11 14:03:33,104 INFO L87 Difference]: Start difference. First operand 169 states and 244 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 14:03:35,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:03:35,732 INFO L93 Difference]: Finished difference Result 456 states and 649 transitions. [2024-10-11 14:03:35,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 14:03:35,732 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 134 [2024-10-11 14:03:35,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:03:35,734 INFO L225 Difference]: With dead ends: 456 [2024-10-11 14:03:35,734 INFO L226 Difference]: Without dead ends: 330 [2024-10-11 14:03:35,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=181, Invalid=568, Unknown=7, NotChecked=0, Total=756 [2024-10-11 14:03:35,736 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 447 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 1252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 14:03:35,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 505 Invalid, 1252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 14:03:35,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-10-11 14:03:35,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 178. [2024-10-11 14:03:35,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 143 states have (on average 1.3496503496503496) internal successors, (193), 144 states have internal predecessors, (193), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 14:03:35,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 257 transitions. [2024-10-11 14:03:35,766 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 257 transitions. Word has length 134 [2024-10-11 14:03:35,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:03:35,766 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 257 transitions. [2024-10-11 14:03:35,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 14:03:35,766 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 257 transitions. [2024-10-11 14:03:35,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-11 14:03:35,767 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:03:35,768 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 14:03:35,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 14:03:35,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:03:35,972 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:03:35,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:03:35,972 INFO L85 PathProgramCache]: Analyzing trace with hash -166547461, now seen corresponding path program 1 times [2024-10-11 14:03:35,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:03:35,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624488190] [2024-10-11 14:03:35,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:03:35,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:03:36,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 14:03:36,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1798442647] [2024-10-11 14:03:36,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:03:36,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:03:36,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:03:36,110 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:03:36,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 14:03:36,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:03:36,436 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 14:03:36,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:03:36,759 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 14:03:36,759 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 14:03:36,760 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 14:03:36,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 14:03:36,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:03:36,968 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:03:37,123 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 14:03:37,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:03:37 BoogieIcfgContainer [2024-10-11 14:03:37,126 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 14:03:37,127 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 14:03:37,127 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 14:03:37,127 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 14:03:37,128 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:03:00" (3/4) ... [2024-10-11 14:03:37,130 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 14:03:37,131 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 14:03:37,132 INFO L158 Benchmark]: Toolchain (without parser) took 38111.56ms. Allocated memory was 136.3MB in the beginning and 539.0MB in the end (delta: 402.7MB). Free memory was 81.8MB in the beginning and 323.7MB in the end (delta: -241.9MB). Peak memory consumption was 162.7MB. Max. memory is 16.1GB. [2024-10-11 14:03:37,132 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 136.3MB. Free memory was 106.5MB in the beginning and 106.3MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 14:03:37,132 INFO L158 Benchmark]: CACSL2BoogieTranslator took 350.35ms. Allocated memory is still 136.3MB. Free memory was 81.3MB in the beginning and 64.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 14:03:37,133 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.79ms. Allocated memory was 136.3MB in the beginning and 178.3MB in the end (delta: 41.9MB). Free memory was 64.5MB in the beginning and 146.1MB in the end (delta: -81.6MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. [2024-10-11 14:03:37,133 INFO L158 Benchmark]: Boogie Preprocessor took 81.19ms. Allocated memory is still 178.3MB. Free memory was 146.1MB in the beginning and 144.4MB in the end (delta: 1.7MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2024-10-11 14:03:37,133 INFO L158 Benchmark]: RCFGBuilder took 762.39ms. Allocated memory is still 178.3MB. Free memory was 144.4MB in the beginning and 107.8MB in the end (delta: 36.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-11 14:03:37,134 INFO L158 Benchmark]: TraceAbstraction took 36814.33ms. Allocated memory was 178.3MB in the beginning and 539.0MB in the end (delta: 360.7MB). Free memory was 106.7MB in the beginning and 323.7MB in the end (delta: -217.0MB). Peak memory consumption was 142.6MB. Max. memory is 16.1GB. [2024-10-11 14:03:37,134 INFO L158 Benchmark]: Witness Printer took 4.30ms. Allocated memory is still 539.0MB. Free memory is still 323.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 14:03:37,136 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.23ms. Allocated memory is still 136.3MB. Free memory was 106.5MB in the beginning and 106.3MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 350.35ms. Allocated memory is still 136.3MB. Free memory was 81.3MB in the beginning and 64.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.79ms. Allocated memory was 136.3MB in the beginning and 178.3MB in the end (delta: 41.9MB). Free memory was 64.5MB in the beginning and 146.1MB in the end (delta: -81.6MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.19ms. Allocated memory is still 178.3MB. Free memory was 146.1MB in the beginning and 144.4MB in the end (delta: 1.7MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. * RCFGBuilder took 762.39ms. Allocated memory is still 178.3MB. Free memory was 144.4MB in the beginning and 107.8MB in the end (delta: 36.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 36814.33ms. Allocated memory was 178.3MB in the beginning and 539.0MB in the end (delta: 360.7MB). Free memory was 106.7MB in the beginning and 323.7MB in the end (delta: -217.0MB). Peak memory consumption was 142.6MB. Max. memory is 16.1GB. * Witness Printer took 4.30ms. Allocated memory is still 539.0MB. Free memory is still 323.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 130, overapproximation of someBinaryFLOATComparisonOperation at line 121. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 32, 32, -100, 5.95, 128, 200, 8, 0, 128, 1, 2.25, 16.875, -4, 10 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 32, 32, -100, 5.95, 128, 200, 8, 0, 128, 1, 2.25, 16.875, -4, 10 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 32, 32, -100, 5.95, 128, 200, 8, 0, 128, 1, 2.25, 16.875, -4, 10 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 32, 32, -100, 5.95, 128, 200, 8, 0, 128, 1, 2.25, 16.875, -4, 10 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 32, 32, -100, 5.95, 128, 200, 8, 0, 128, 1, 2.25, 16.875, -4, 10 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 32, 32, -100, 5.95, 128, 200, 8, 0, 128, 1, 2.25, 16.875, -4, 10 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 32, 32, -100, 5.95, 128, 200, 8, 0, 128, 1, 2.25, 16.875, -4, 10 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 32, 32, -100, 5.95, 128, 200, 8, 0, 128, 1, 2.25, 16.875, -4, 10 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 32, 32, -100, 5.95, 128, 200, 8, 0, 128, 1, 2.25, 16.875, -4, 10 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 32, 32, -100, 5.95, 128, 200, 8, 0, 128, 1, 2.25, 16.875, -4, 10 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 32, 32, -100, 5.95, 128, 200, 8, 0, 128, 1, 2.25, 16.875, -4, 10 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 32, 32, -100, 5.95, 128, 200, 8, 0, 128, 1, 2.25, 16.875, -4, 10 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 32, 32, -100, 5.95, 128, 200, 8, 0, 128, 1, 2.25, 16.875, -4, 10 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 32, 32, -100, 5.95, 128, 200, 8, 0, 128, 1, 2.25, 16.875, -4, 10 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 32, 32, -100, 5.95, 128, 200, 8, 0, 128, 1, 2.25, 16.875, -4, 10 }; [L55] unsigned char* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L56] unsigned char* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L57] signed long int* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L58] double* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L59] unsigned char* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L60] unsigned char* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L61] unsigned char* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L62] unsigned char* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L63] unsigned char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L64] unsigned char* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L65] float* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L66] float* WrapperStruct00_var_1_19_Pointer = &(WrapperStruct00.var_1_19); [L67] signed char* WrapperStruct00_var_1_20_Pointer = &(WrapperStruct00.var_1_20); [L68] signed char* WrapperStruct00_var_1_21_Pointer = &(WrapperStruct00.var_1_21); [L69] signed long int last_1_WrapperStruct00_var_1_8 = -100; [L134] isInitial = 1 [L135] FCALL initially() [L136] COND TRUE 1 [L137] CALL updateLastVariables() [L127] EXPR WrapperStruct00.var_1_8 [L127] last_1_WrapperStruct00_var_1_8 = WrapperStruct00.var_1_8 [L137] RET updateLastVariables() [L138] CALL updateVariables() [L99] WrapperStruct00.var_1_7 = __VERIFIER_nondet_uchar() [L100] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L101] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L102] WrapperStruct00.var_1_10 = __VERIFIER_nondet_double() [L103] EXPR WrapperStruct00.var_1_10 [L103] EXPR WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L103] EXPR WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F [L103] EXPR WrapperStruct00.var_1_10 [L103] EXPR WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L103] EXPR (WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L103] EXPR (WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L103] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L103] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L104] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_10 != 0.0F) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_10 != 0.0F) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L105] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L106] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L107] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 255) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 255) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L108] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L109] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L110] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L111] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L112] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L113] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L114] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L115] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L116] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L117] WrapperStruct00.var_1_17 = __VERIFIER_nondet_uchar() [L118] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L119] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L120] WrapperStruct00.var_1_19 = __VERIFIER_nondet_float() [L121] EXPR WrapperStruct00.var_1_19 [L121] EXPR WrapperStruct00.var_1_19 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_19 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L121] EXPR WrapperStruct00.var_1_19 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_19 <= -1.0e-20F [L121] EXPR WrapperStruct00.var_1_19 [L121] EXPR WrapperStruct00.var_1_19 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_19 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L121] EXPR (WrapperStruct00.var_1_19 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_19 <= -1.0e-20F) || (WrapperStruct00.var_1_19 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_19 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L121] EXPR (WrapperStruct00.var_1_19 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_19 <= -1.0e-20F) || (WrapperStruct00.var_1_19 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_19 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L121] CALL assume_abort_if_not((WrapperStruct00.var_1_19 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_19 <= -1.0e-20F) || (WrapperStruct00.var_1_19 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_19 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L121] RET assume_abort_if_not((WrapperStruct00.var_1_19 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_19 <= -1.0e-20F) || (WrapperStruct00.var_1_19 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_19 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L122] WrapperStruct00.var_1_21 = __VERIFIER_nondet_char() [L123] EXPR WrapperStruct00.var_1_21 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L123] CALL assume_abort_if_not(WrapperStruct00.var_1_21 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L123] RET assume_abort_if_not(WrapperStruct00.var_1_21 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L124] EXPR WrapperStruct00.var_1_21 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L124] CALL assume_abort_if_not(WrapperStruct00.var_1_21 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L124] RET assume_abort_if_not(WrapperStruct00.var_1_21 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L138] RET updateVariables() [L139] CALL step() [L73] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L73] (*(WrapperStruct00_var_1_18_Pointer)) = (*(WrapperStruct00_var_1_19_Pointer)) [L74] EXPR \read(*WrapperStruct00_var_1_21_Pointer) [L74] (*(WrapperStruct00_var_1_20_Pointer)) = (*(WrapperStruct00_var_1_21_Pointer)) [L75] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L75] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L75] EXPR \read(*WrapperStruct00_var_1_18_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L75] COND FALSE !(((*(WrapperStruct00_var_1_18_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer))) >= ((*(WrapperStruct00_var_1_18_Pointer)) / 128.6)) [L78] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L78] EXPR \read(*WrapperStruct00_var_1_10_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L78] COND TRUE (*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_10_Pointer)) [L79] (*(WrapperStruct00_var_1_8_Pointer)) = 256 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L84] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L84] EXPR \read(*WrapperStruct00_var_1_20_Pointer) [L84] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L84] signed long int stepLocal_0 = ((*(WrapperStruct00_var_1_8_Pointer)) * (*(WrapperStruct00_var_1_20_Pointer))) * (*(WrapperStruct00_var_1_8_Pointer)); [L85] EXPR \read(*WrapperStruct00_var_1_20_Pointer) [L85] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L85] EXPR (((*(WrapperStruct00_var_1_20_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_20_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))) [L85] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L85] EXPR (((*(WrapperStruct00_var_1_20_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_20_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100, stepLocal_0=-196608] [L85] COND TRUE stepLocal_0 < (((((*(WrapperStruct00_var_1_20_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_20_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) [L86] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L86] (*(WrapperStruct00_var_1_1_Pointer)) = (*(WrapperStruct00_var_1_7_Pointer)) [L90] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L90] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L90] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L90] ((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) && (*(WrapperStruct00_var_1_15_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L90] ((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) && (*(WrapperStruct00_var_1_15_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L90] COND FALSE !(((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) && (*(WrapperStruct00_var_1_15_Pointer))) [L95] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L95] (*(WrapperStruct00_var_1_12_Pointer)) = (*(WrapperStruct00_var_1_17_Pointer)) [L139] RET step() [L140] CALL, EXPR property() [L130] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L130] EXPR \read(*WrapperStruct00_var_1_20_Pointer) [L130] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L130] EXPR \read(*WrapperStruct00_var_1_20_Pointer) [L130] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L130] EXPR (((*(WrapperStruct00_var_1_20_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_20_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))) [L130] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L130] EXPR (((*(WrapperStruct00_var_1_20_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_20_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L130] EXPR ((((*(WrapperStruct00_var_1_8_Pointer)) * (*(WrapperStruct00_var_1_20_Pointer))) * (*(WrapperStruct00_var_1_8_Pointer))) < (((((*(WrapperStruct00_var_1_20_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_20_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))) [L130] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L130] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L130] EXPR ((((*(WrapperStruct00_var_1_8_Pointer)) * (*(WrapperStruct00_var_1_20_Pointer))) * (*(WrapperStruct00_var_1_8_Pointer))) < (((((*(WrapperStruct00_var_1_20_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_20_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L130] EXPR (((((*(WrapperStruct00_var_1_8_Pointer)) * (*(WrapperStruct00_var_1_20_Pointer))) * (*(WrapperStruct00_var_1_8_Pointer))) < (((((*(WrapperStruct00_var_1_20_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_20_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((((*(WrapperStruct00_var_1_18_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer))) >= ((*(WrapperStruct00_var_1_18_Pointer)) / 128.6)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_20_Pointer)) + ((*(WrapperStruct00_var_1_7_Pointer)) + last_1_WrapperStruct00_var_1_8)) - (*(WrapperStruct00_var_1_20_Pointer))))) : (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) 256)) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_20_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L130] EXPR (((((*(WrapperStruct00_var_1_8_Pointer)) * (*(WrapperStruct00_var_1_20_Pointer))) * (*(WrapperStruct00_var_1_8_Pointer))) < (((((*(WrapperStruct00_var_1_20_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_20_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((((*(WrapperStruct00_var_1_18_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer))) >= ((*(WrapperStruct00_var_1_18_Pointer)) / 128.6)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_20_Pointer)) + ((*(WrapperStruct00_var_1_7_Pointer)) + last_1_WrapperStruct00_var_1_8)) - (*(WrapperStruct00_var_1_20_Pointer))))) : (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) 256)) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_20_Pointer)))))) [L130] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L130] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L130] EXPR \read(*WrapperStruct00_var_1_18_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L130] EXPR (((*(WrapperStruct00_var_1_18_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer))) >= ((*(WrapperStruct00_var_1_18_Pointer)) / 128.6)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_20_Pointer)) + ((*(WrapperStruct00_var_1_7_Pointer)) + last_1_WrapperStruct00_var_1_8)) - (*(WrapperStruct00_var_1_20_Pointer))))) : (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) 256)) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_20_Pointer))))) [L130] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L130] EXPR \read(*WrapperStruct00_var_1_20_Pointer) [L130] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L130] EXPR \read(*WrapperStruct00_var_1_20_Pointer) [L130] EXPR (((*(WrapperStruct00_var_1_18_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer))) >= ((*(WrapperStruct00_var_1_18_Pointer)) / 128.6)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_20_Pointer)) + ((*(WrapperStruct00_var_1_7_Pointer)) + last_1_WrapperStruct00_var_1_8)) - (*(WrapperStruct00_var_1_20_Pointer))))) : (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) 256)) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_20_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L130] EXPR (((((*(WrapperStruct00_var_1_8_Pointer)) * (*(WrapperStruct00_var_1_20_Pointer))) * (*(WrapperStruct00_var_1_8_Pointer))) < (((((*(WrapperStruct00_var_1_20_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_20_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((((*(WrapperStruct00_var_1_18_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer))) >= ((*(WrapperStruct00_var_1_18_Pointer)) / 128.6)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_20_Pointer)) + ((*(WrapperStruct00_var_1_7_Pointer)) + last_1_WrapperStruct00_var_1_8)) - (*(WrapperStruct00_var_1_20_Pointer))))) : (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) 256)) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_20_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L130] EXPR ((((((*(WrapperStruct00_var_1_8_Pointer)) * (*(WrapperStruct00_var_1_20_Pointer))) * (*(WrapperStruct00_var_1_8_Pointer))) < (((((*(WrapperStruct00_var_1_20_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_20_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((((*(WrapperStruct00_var_1_18_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer))) >= ((*(WrapperStruct00_var_1_18_Pointer)) / 128.6)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_20_Pointer)) + ((*(WrapperStruct00_var_1_7_Pointer)) + last_1_WrapperStruct00_var_1_8)) - (*(WrapperStruct00_var_1_20_Pointer))))) : (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) 256)) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_20_Pointer))))))) && ((((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) && (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_15_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((((((*(WrapperStruct00_var_1_16_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_16_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_17_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L130] EXPR ((((((*(WrapperStruct00_var_1_8_Pointer)) * (*(WrapperStruct00_var_1_20_Pointer))) * (*(WrapperStruct00_var_1_8_Pointer))) < (((((*(WrapperStruct00_var_1_20_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_20_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((((*(WrapperStruct00_var_1_18_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer))) >= ((*(WrapperStruct00_var_1_18_Pointer)) / 128.6)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_20_Pointer)) + ((*(WrapperStruct00_var_1_7_Pointer)) + last_1_WrapperStruct00_var_1_8)) - (*(WrapperStruct00_var_1_20_Pointer))))) : (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) 256)) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_20_Pointer))))))) && ((((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) && (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_15_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((((((*(WrapperStruct00_var_1_16_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_16_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_17_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L130] EXPR (((((((*(WrapperStruct00_var_1_8_Pointer)) * (*(WrapperStruct00_var_1_20_Pointer))) * (*(WrapperStruct00_var_1_8_Pointer))) < (((((*(WrapperStruct00_var_1_20_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_20_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((((*(WrapperStruct00_var_1_18_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer))) >= ((*(WrapperStruct00_var_1_18_Pointer)) / 128.6)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_20_Pointer)) + ((*(WrapperStruct00_var_1_7_Pointer)) + last_1_WrapperStruct00_var_1_8)) - (*(WrapperStruct00_var_1_20_Pointer))))) : (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) 256)) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_20_Pointer))))))) && ((((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) && (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_15_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((((((*(WrapperStruct00_var_1_16_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_16_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_17_Pointer)))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((float) (*(WrapperStruct00_var_1_19_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L130] EXPR (((((((*(WrapperStruct00_var_1_8_Pointer)) * (*(WrapperStruct00_var_1_20_Pointer))) * (*(WrapperStruct00_var_1_8_Pointer))) < (((((*(WrapperStruct00_var_1_20_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_20_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((((*(WrapperStruct00_var_1_18_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer))) >= ((*(WrapperStruct00_var_1_18_Pointer)) / 128.6)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_20_Pointer)) + ((*(WrapperStruct00_var_1_7_Pointer)) + last_1_WrapperStruct00_var_1_8)) - (*(WrapperStruct00_var_1_20_Pointer))))) : (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) 256)) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_20_Pointer))))))) && ((((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) && (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_15_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((((((*(WrapperStruct00_var_1_16_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_16_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_17_Pointer)))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((float) (*(WrapperStruct00_var_1_19_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L130] EXPR ((((((((*(WrapperStruct00_var_1_8_Pointer)) * (*(WrapperStruct00_var_1_20_Pointer))) * (*(WrapperStruct00_var_1_8_Pointer))) < (((((*(WrapperStruct00_var_1_20_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_20_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((((*(WrapperStruct00_var_1_18_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer))) >= ((*(WrapperStruct00_var_1_18_Pointer)) / 128.6)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_20_Pointer)) + ((*(WrapperStruct00_var_1_7_Pointer)) + last_1_WrapperStruct00_var_1_8)) - (*(WrapperStruct00_var_1_20_Pointer))))) : (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) 256)) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_20_Pointer))))))) && ((((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) && (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_15_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((((((*(WrapperStruct00_var_1_16_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_16_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_17_Pointer)))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((float) (*(WrapperStruct00_var_1_19_Pointer))))) && ((*(WrapperStruct00_var_1_20_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_21_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L130] EXPR ((((((((*(WrapperStruct00_var_1_8_Pointer)) * (*(WrapperStruct00_var_1_20_Pointer))) * (*(WrapperStruct00_var_1_8_Pointer))) < (((((*(WrapperStruct00_var_1_20_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_20_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((((*(WrapperStruct00_var_1_18_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer))) >= ((*(WrapperStruct00_var_1_18_Pointer)) / 128.6)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_20_Pointer)) + ((*(WrapperStruct00_var_1_7_Pointer)) + last_1_WrapperStruct00_var_1_8)) - (*(WrapperStruct00_var_1_20_Pointer))))) : (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) 256)) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_20_Pointer))))))) && ((((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) && (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_15_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((((((*(WrapperStruct00_var_1_16_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_16_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_17_Pointer)))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((float) (*(WrapperStruct00_var_1_19_Pointer))))) && ((*(WrapperStruct00_var_1_20_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_21_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L130-L131] return ((((((((*(WrapperStruct00_var_1_8_Pointer)) * (*(WrapperStruct00_var_1_20_Pointer))) * (*(WrapperStruct00_var_1_8_Pointer))) < (((((*(WrapperStruct00_var_1_20_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_20_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((((*(WrapperStruct00_var_1_18_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer))) >= ((*(WrapperStruct00_var_1_18_Pointer)) / 128.6)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_20_Pointer)) + ((*(WrapperStruct00_var_1_7_Pointer)) + last_1_WrapperStruct00_var_1_8)) - (*(WrapperStruct00_var_1_20_Pointer))))) : (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) 256)) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_20_Pointer))))))) && ((((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) && (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_15_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((((((*(WrapperStruct00_var_1_16_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_16_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_17_Pointer)))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((float) (*(WrapperStruct00_var_1_19_Pointer))))) && ((*(WrapperStruct00_var_1_20_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_21_Pointer)))) ; [L140] RET, EXPR property() [L140] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 36.6s, OverallIterations: 10, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1249 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1249 mSDsluCounter, 3335 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2341 mSDsCounter, 404 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3236 IncrementalHoareTripleChecker+Invalid, 3640 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 404 mSolverCounterUnsat, 994 mSDtfsCounter, 3236 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 533 GetRequests, 445 SyntacticMatches, 2 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 18.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178occurred in iteration=9, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 248 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 27.4s InterpolantComputationTime, 1592 NumberOfCodeBlocks, 1592 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1181 ConstructedInterpolants, 2 QuantifiedInterpolants, 12577 SizeOfPredicates, 17 NumberOfNonLiveVariables, 511 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 4776/4896 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-11 14:03:37,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-75.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 3ea1453e8ddb919b166a2b196c485b49328495abf45a9dcbd47a0aceac1e3901 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 14:03:39,326 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:03:39,404 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 14:03:39,408 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:03:39,408 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:03:39,442 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:03:39,443 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:03:39,443 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:03:39,444 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:03:39,444 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:03:39,444 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:03:39,445 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:03:39,445 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:03:39,446 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:03:39,446 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:03:39,446 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:03:39,447 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:03:39,447 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 14:03:39,448 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 14:03:39,448 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:03:39,448 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:03:39,449 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:03:39,449 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:03:39,449 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 14:03:39,450 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 14:03:39,450 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:03:39,450 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 14:03:39,450 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 14:03:39,451 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:03:39,451 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:03:39,451 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:03:39,451 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:03:39,452 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:03:39,452 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:03:39,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:03:39,457 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:03:39,457 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:03:39,458 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:03:39,458 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 14:03:39,458 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 14:03:39,458 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:03:39,458 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:03:39,459 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:03:39,459 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:03:39,459 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 14:03:39,459 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-clean/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-clean/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 -> 3ea1453e8ddb919b166a2b196c485b49328495abf45a9dcbd47a0aceac1e3901 [2024-10-11 14:03:39,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:03:39,811 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:03:39,814 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:03:39,815 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:03:39,816 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:03:39,818 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-75.i [2024-10-11 14:03:41,326 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:03:41,517 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:03:41,519 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-75.i [2024-10-11 14:03:41,533 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1cc679614/b1df52a588224591aa44a34bf194e0c6/FLAG9c021d467 [2024-10-11 14:03:41,884 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1cc679614/b1df52a588224591aa44a34bf194e0c6 [2024-10-11 14:03:41,887 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:03:41,888 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:03:41,891 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:03:41,891 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:03:41,895 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:03:41,896 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:03:41" (1/1) ... [2024-10-11 14:03:41,898 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32647fb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:03:41, skipping insertion in model container [2024-10-11 14:03:41,899 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:03:41" (1/1) ... [2024-10-11 14:03:41,928 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:03:42,117 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-75.i[917,930] [2024-10-11 14:03:42,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:03:42,224 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:03:42,235 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-75.i[917,930] [2024-10-11 14:03:42,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:03:42,326 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:03:42,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:03:42 WrapperNode [2024-10-11 14:03:42,327 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:03:42,328 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:03:42,328 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:03:42,328 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:03:42,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:03:42" (1/1) ... [2024-10-11 14:03:42,360 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:03:42" (1/1) ... [2024-10-11 14:03:42,403 INFO L138 Inliner]: procedures = 36, calls = 160, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 472 [2024-10-11 14:03:42,403 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:03:42,404 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:03:42,404 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:03:42,404 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:03:42,420 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:03:42" (1/1) ... [2024-10-11 14:03:42,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:03:42" (1/1) ... [2024-10-11 14:03:42,431 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:03:42" (1/1) ... [2024-10-11 14:03:42,470 INFO L175 MemorySlicer]: Split 131 memory accesses to 2 slices as follows [2, 129]. 98 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 14]. The 18 writes are split as follows [0, 18]. [2024-10-11 14:03:42,471 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:03:42" (1/1) ... [2024-10-11 14:03:42,471 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:03:42" (1/1) ... [2024-10-11 14:03:42,523 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:03:42" (1/1) ... [2024-10-11 14:03:42,530 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:03:42" (1/1) ... [2024-10-11 14:03:42,533 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:03:42" (1/1) ... [2024-10-11 14:03:42,540 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:03:42" (1/1) ... [2024-10-11 14:03:42,547 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:03:42,552 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:03:42,553 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:03:42,553 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:03:42,554 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:03:42" (1/1) ... [2024-10-11 14:03:42,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:03:42,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:03:42,598 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 14:03:42,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 14:03:42,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:03:42,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-11 14:03:42,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-11 14:03:42,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-11 14:03:42,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-11 14:03:42,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 14:03:42,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 14:03:42,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 14:03:42,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 14:03:42,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-11 14:03:42,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-11 14:03:42,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-11 14:03:42,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-11 14:03:42,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-11 14:03:42,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-11 14:03:42,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 14:03:42,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 14:03:42,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-11 14:03:42,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-11 14:03:42,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-11 14:03:42,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-11 14:03:42,650 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 14:03:42,650 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 14:03:42,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:03:42,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:03:42,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-11 14:03:42,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-11 14:03:42,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 14:03:42,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 14:03:42,794 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:03:42,796 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:04:02,163 INFO L? ?]: Removed 113 outVars from TransFormulas that were not future-live. [2024-10-11 14:04:02,163 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:04:02,208 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:04:02,208 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 14:04:02,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:04:02 BoogieIcfgContainer [2024-10-11 14:04:02,209 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:04:02,211 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:04:02,211 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:04:02,214 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:04:02,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:03:41" (1/3) ... [2024-10-11 14:04:02,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@307400e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:04:02, skipping insertion in model container [2024-10-11 14:04:02,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:03:42" (2/3) ... [2024-10-11 14:04:02,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@307400e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:04:02, skipping insertion in model container [2024-10-11 14:04:02,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:04:02" (3/3) ... [2024-10-11 14:04:02,228 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-75.i [2024-10-11 14:04:02,240 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:04:02,240 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 14:04:02,295 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:04:02,300 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;@61a57672, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:04:02,300 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 14:04:02,303 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 70 states have (on average 1.4428571428571428) internal successors, (101), 71 states have internal predecessors, (101), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 14:04:02,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 14:04:02,314 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:02,315 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 14:04:02,315 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:02,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:02,320 INFO L85 PathProgramCache]: Analyzing trace with hash 139789455, now seen corresponding path program 1 times [2024-10-11 14:04:02,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 14:04:02,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [462895178] [2024-10-11 14:04:02,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:02,332 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-11 14:04:02,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 14:04:02,334 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-11 14:04:02,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 14:04:03,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:03,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 14:04:03,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:04:03,852 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-10-11 14:04:03,852 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 14:04:03,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 14:04:03,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [462895178] [2024-10-11 14:04:03,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [462895178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:03,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:03,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:04:03,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396491413] [2024-10-11 14:04:03,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:03,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 14:04:03,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 14:04:03,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 14:04:03,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 14:04:03,888 INFO L87 Difference]: Start difference. First operand has 90 states, 70 states have (on average 1.4428571428571428) internal successors, (101), 71 states have internal predecessors, (101), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 14:04:04,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:04,146 INFO L93 Difference]: Finished difference Result 177 states and 285 transitions. [2024-10-11 14:04:04,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 14:04:04,150 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 131 [2024-10-11 14:04:04,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:04,157 INFO L225 Difference]: With dead ends: 177 [2024-10-11 14:04:04,159 INFO L226 Difference]: Without dead ends: 88 [2024-10-11 14:04:04,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 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-11 14:04:04,166 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 14:04:04,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 14:04:04,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-11 14:04:04,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-11 14:04:04,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 69 states have (on average 1.391304347826087) internal successors, (96), 69 states have internal predecessors, (96), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 14:04:04,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 130 transitions. [2024-10-11 14:04:04,216 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 130 transitions. Word has length 131 [2024-10-11 14:04:04,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:04,217 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 130 transitions. [2024-10-11 14:04:04,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 14:04:04,217 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 130 transitions. [2024-10-11 14:04:04,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 14:04:04,220 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:04,221 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 14:04:04,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 14:04:04,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-11 14:04:04,422 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:04,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:04,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1775774337, now seen corresponding path program 1 times [2024-10-11 14:04:04,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 14:04:04,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [985057650] [2024-10-11 14:04:04,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:04,424 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-11 14:04:04,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 14:04:04,428 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-11 14:04:04,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 14:04:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:05,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 14:04:05,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:04:06,172 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2024-10-11 14:04:06,173 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 14:04:06,173 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 14:04:06,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [985057650] [2024-10-11 14:04:06,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [985057650] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:06,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:06,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:04:06,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320414896] [2024-10-11 14:04:06,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:06,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:04:06,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 14:04:06,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:04:06,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:04:06,181 INFO L87 Difference]: Start difference. First operand 88 states and 130 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 14:04:06,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:06,919 INFO L93 Difference]: Finished difference Result 177 states and 262 transitions. [2024-10-11 14:04:06,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:04:06,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 131 [2024-10-11 14:04:06,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:06,922 INFO L225 Difference]: With dead ends: 177 [2024-10-11 14:04:06,922 INFO L226 Difference]: Without dead ends: 90 [2024-10-11 14:04:06,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:04:06,924 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 14:04:06,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 365 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 14:04:06,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-11 14:04:06,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-11 14:04:06,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 71 states have (on average 1.380281690140845) internal successors, (98), 71 states have internal predecessors, (98), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 14:04:06,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 132 transitions. [2024-10-11 14:04:06,936 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 132 transitions. Word has length 131 [2024-10-11 14:04:06,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:06,938 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 132 transitions. [2024-10-11 14:04:06,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 14:04:06,938 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 132 transitions. [2024-10-11 14:04:06,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 14:04:06,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:06,941 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 14:04:06,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 14:04:07,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-11 14:04:07,142 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:07,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:07,143 INFO L85 PathProgramCache]: Analyzing trace with hash -797190273, now seen corresponding path program 1 times [2024-10-11 14:04:07,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 14:04:07,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1278810427] [2024-10-11 14:04:07,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:07,144 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-11 14:04:07,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 14:04:07,146 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-11 14:04:07,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 14:04:08,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:08,650 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 14:04:08,654 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:04:09,295 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 14:04:09,296 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 14:04:09,296 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 14:04:09,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1278810427] [2024-10-11 14:04:09,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1278810427] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:09,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:09,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:04:09,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127452844] [2024-10-11 14:04:09,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:09,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:04:09,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 14:04:09,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:04:09,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:04:09,299 INFO L87 Difference]: Start difference. First operand 90 states and 132 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 14:04:10,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:10,570 INFO L93 Difference]: Finished difference Result 184 states and 270 transitions. [2024-10-11 14:04:10,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:04:10,571 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 131 [2024-10-11 14:04:10,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:10,577 INFO L225 Difference]: With dead ends: 184 [2024-10-11 14:04:10,577 INFO L226 Difference]: Without dead ends: 95 [2024-10-11 14:04:10,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:04:10,579 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 1 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 14:04:10,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 474 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 14:04:10,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-11 14:04:10,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2024-10-11 14:04:10,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 75 states have (on average 1.36) internal successors, (102), 75 states have internal predecessors, (102), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 14:04:10,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 136 transitions. [2024-10-11 14:04:10,601 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 136 transitions. Word has length 131 [2024-10-11 14:04:10,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:10,602 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 136 transitions. [2024-10-11 14:04:10,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 14:04:10,602 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 136 transitions. [2024-10-11 14:04:10,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 14:04:10,605 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:10,605 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 14:04:10,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 14:04:10,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-11 14:04:10,806 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:10,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:10,807 INFO L85 PathProgramCache]: Analyzing trace with hash -739931971, now seen corresponding path program 1 times [2024-10-11 14:04:10,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 14:04:10,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [403738728] [2024-10-11 14:04:10,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:10,808 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-11 14:04:10,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 14:04:10,811 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-11 14:04:10,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 14:04:12,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:12,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 14:04:12,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:04:13,279 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 14:04:13,279 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 14:04:13,280 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 14:04:13,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [403738728] [2024-10-11 14:04:13,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [403738728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:13,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:13,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 14:04:13,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360214154] [2024-10-11 14:04:13,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:13,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:04:13,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 14:04:13,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:04:13,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:04:13,286 INFO L87 Difference]: Start difference. First operand 94 states and 136 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 14:04:14,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:14,854 INFO L93 Difference]: Finished difference Result 190 states and 275 transitions. [2024-10-11 14:04:14,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:04:14,854 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 131 [2024-10-11 14:04:14,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:14,856 INFO L225 Difference]: With dead ends: 190 [2024-10-11 14:04:14,856 INFO L226 Difference]: Without dead ends: 97 [2024-10-11 14:04:14,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:04:14,858 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 1 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 14:04:14,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 588 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 14:04:14,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-11 14:04:14,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2024-10-11 14:04:14,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 77 states have (on average 1.3506493506493507) internal successors, (104), 77 states have internal predecessors, (104), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 14:04:14,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2024-10-11 14:04:14,867 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 131 [2024-10-11 14:04:14,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:14,868 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2024-10-11 14:04:14,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 14:04:14,868 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2024-10-11 14:04:14,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 14:04:14,870 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:14,870 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 14:04:14,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 14:04:15,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/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-11 14:04:15,071 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:15,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:15,072 INFO L85 PathProgramCache]: Analyzing trace with hash -739872389, now seen corresponding path program 1 times [2024-10-11 14:04:15,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 14:04:15,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [922299156] [2024-10-11 14:04:15,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:15,072 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-11 14:04:15,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 14:04:15,074 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/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-11 14:04:15,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 14:04:17,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:17,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 14:04:17,118 INFO L278 TraceCheckSpWp]: Computing forward predicates...