./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-95.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-95.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e669462867509a48cd8854a2d2c887397834599fcc49707fe1e1ec7fa25ff3cd --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 12:04:44,441 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 12:04:44,527 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 12:04:44,532 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 12:04:44,534 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 12:04:44,564 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 12:04:44,565 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 12:04:44,565 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 12:04:44,567 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 12:04:44,567 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 12:04:44,568 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 12:04:44,568 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 12:04:44,569 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 12:04:44,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 12:04:44,569 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 12:04:44,570 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 12:04:44,572 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 12:04:44,572 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 12:04:44,576 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 12:04:44,576 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 12:04:44,577 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 12:04:44,577 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 12:04:44,578 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 12:04:44,578 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 12:04:44,578 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 12:04:44,579 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 12:04:44,579 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 12:04:44,579 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 12:04:44,579 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 12:04:44,580 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 12:04:44,580 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 12:04:44,580 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 12:04:44,580 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:04:44,581 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 12:04:44,581 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 12:04:44,590 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 12:04:44,590 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 12:04:44,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 12:04:44,591 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 12:04:44,591 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 12:04:44,591 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 12:04:44,592 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 12:04:44,592 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e669462867509a48cd8854a2d2c887397834599fcc49707fe1e1ec7fa25ff3cd [2024-10-24 12:04:44,873 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 12:04:44,898 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 12:04:44,902 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 12:04:44,903 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 12:04:44,904 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 12:04:44,905 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-95.i [2024-10-24 12:04:46,408 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 12:04:46,648 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 12:04:46,649 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-95.i [2024-10-24 12:04:46,657 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26ffd9f8d/e4610dee66d84d60aebe2be3efdc618e/FLAG0606c34f5 [2024-10-24 12:04:46,977 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26ffd9f8d/e4610dee66d84d60aebe2be3efdc618e [2024-10-24 12:04:46,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 12:04:46,980 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 12:04:46,985 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 12:04:46,985 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 12:04:46,990 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 12:04:46,990 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:04:46" (1/1) ... [2024-10-24 12:04:46,991 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3beaa244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:46, skipping insertion in model container [2024-10-24 12:04:46,991 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:04:46" (1/1) ... [2024-10-24 12:04:47,018 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 12:04:47,212 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-95.i[917,930] [2024-10-24 12:04:47,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:04:47,336 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 12:04:47,352 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-95.i[917,930] [2024-10-24 12:04:47,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:04:47,449 INFO L204 MainTranslator]: Completed translation [2024-10-24 12:04:47,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:47 WrapperNode [2024-10-24 12:04:47,450 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 12:04:47,451 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 12:04:47,452 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 12:04:47,453 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 12:04:47,460 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:47" (1/1) ... [2024-10-24 12:04:47,474 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:47" (1/1) ... [2024-10-24 12:04:47,519 INFO L138 Inliner]: procedures = 29, calls = 149, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 488 [2024-10-24 12:04:47,523 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 12:04:47,524 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 12:04:47,524 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 12:04:47,524 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 12:04:47,535 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:47" (1/1) ... [2024-10-24 12:04:47,536 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:47" (1/1) ... [2024-10-24 12:04:47,546 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:47" (1/1) ... [2024-10-24 12:04:47,572 INFO L175 MemorySlicer]: Split 121 memory accesses to 2 slices as follows [2, 119]. 98 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 14]. The 16 writes are split as follows [0, 16]. [2024-10-24 12:04:47,573 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:47" (1/1) ... [2024-10-24 12:04:47,573 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:47" (1/1) ... [2024-10-24 12:04:47,596 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:47" (1/1) ... [2024-10-24 12:04:47,605 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:47" (1/1) ... [2024-10-24 12:04:47,609 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:47" (1/1) ... [2024-10-24 12:04:47,611 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:47" (1/1) ... [2024-10-24 12:04:47,616 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 12:04:47,618 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 12:04:47,618 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 12:04:47,618 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 12:04:47,619 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:47" (1/1) ... [2024-10-24 12:04:47,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:04:47,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:04:47,661 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 12:04:47,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 12:04:47,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 12:04:47,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 12:04:47,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 12:04:47,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 12:04:47,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 12:04:47,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 12:04:47,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 12:04:47,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 12:04:47,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 12:04:47,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 12:04:47,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 12:04:47,725 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 12:04:47,725 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 12:04:47,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 12:04:47,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 12:04:47,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 12:04:47,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 12:04:47,853 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 12:04:47,855 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 12:04:48,432 INFO L? ?]: Removed 125 outVars from TransFormulas that were not future-live. [2024-10-24 12:04:48,432 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 12:04:48,476 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 12:04:48,476 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 12:04:48,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:04:48 BoogieIcfgContainer [2024-10-24 12:04:48,479 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 12:04:48,482 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 12:04:48,482 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 12:04:48,486 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 12:04:48,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:04:46" (1/3) ... [2024-10-24 12:04:48,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee7daf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:04:48, skipping insertion in model container [2024-10-24 12:04:48,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:47" (2/3) ... [2024-10-24 12:04:48,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee7daf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:04:48, skipping insertion in model container [2024-10-24 12:04:48,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:04:48" (3/3) ... [2024-10-24 12:04:48,490 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-95.i [2024-10-24 12:04:48,505 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 12:04:48,505 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 12:04:48,575 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 12:04:48,582 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;@2b3ca514, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 12:04:48,582 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 12:04:48,612 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 88 states have (on average 1.4545454545454546) internal successors, (128), 89 states have internal predecessors, (128), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 12:04:48,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-24 12:04:48,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:04:48,632 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:04:48,632 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:04:48,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:04:48,640 INFO L85 PathProgramCache]: Analyzing trace with hash 813246003, now seen corresponding path program 1 times [2024-10-24 12:04:48,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:04:48,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758191785] [2024-10-24 12:04:48,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:04:48,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:04:48,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:49,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 12:04:49,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:49,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:04:49,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:49,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 12:04:49,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:49,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 12:04:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:49,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 12:04:49,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:49,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 12:04:49,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:49,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:04:49,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:49,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 12:04:49,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:49,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 12:04:49,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:49,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 12:04:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:49,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 12:04:49,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:49,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 12:04:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:49,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 12:04:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:49,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 12:04:49,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:49,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 12:04:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:49,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 12:04:49,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:49,170 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 12:04:49,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:04:49,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758191785] [2024-10-24 12:04:49,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758191785] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:04:49,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:04:49,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 12:04:49,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48803098] [2024-10-24 12:04:49,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:04:49,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 12:04:49,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:04:49,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 12:04:49,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 12:04:49,215 INFO L87 Difference]: Start difference. First operand has 107 states, 88 states have (on average 1.4545454545454546) internal successors, (128), 89 states have internal predecessors, (128), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 12:04:49,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:04:49,272 INFO L93 Difference]: Finished difference Result 211 states and 334 transitions. [2024-10-24 12:04:49,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 12:04:49,276 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 127 [2024-10-24 12:04:49,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:04:49,286 INFO L225 Difference]: With dead ends: 211 [2024-10-24 12:04:49,287 INFO L226 Difference]: Without dead ends: 105 [2024-10-24 12:04:49,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 12:04:49,296 INFO L432 NwaCegarLoop]: 147 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, 147 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 12:04:49,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 12:04:49,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-24 12:04:49,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-10-24 12:04:49,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 87 states have (on average 1.367816091954023) internal successors, (119), 87 states have internal predecessors, (119), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 12:04:49,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 151 transitions. [2024-10-24 12:04:49,359 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 151 transitions. Word has length 127 [2024-10-24 12:04:49,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:04:49,361 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 151 transitions. [2024-10-24 12:04:49,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 12:04:49,362 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 151 transitions. [2024-10-24 12:04:49,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-24 12:04:49,365 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:04:49,366 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:04:49,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 12:04:49,366 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:04:49,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:04:49,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1908889257, now seen corresponding path program 1 times [2024-10-24 12:04:49,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:04:49,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136472228] [2024-10-24 12:04:49,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:04:49,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:04:49,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:49,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 12:04:49,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:49,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:04:49,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:49,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 12:04:49,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:49,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 12:04:49,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:49,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 12:04:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:49,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 12:04:49,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:49,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:04:49,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:49,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 12:04:49,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:49,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 12:04:49,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:49,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 12:04:49,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:49,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 12:04:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:49,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 12:04:49,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:49,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 12:04:49,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:49,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 12:04:49,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:49,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 12:04:49,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:49,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 12:04:49,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:49,808 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 12:04:49,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:04:49,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136472228] [2024-10-24 12:04:49,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136472228] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:04:49,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:04:49,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 12:04:49,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875941942] [2024-10-24 12:04:49,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:04:49,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:04:49,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:04:49,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:04:49,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:04:49,816 INFO L87 Difference]: Start difference. First operand 105 states and 151 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 12:04:49,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:04:49,878 INFO L93 Difference]: Finished difference Result 212 states and 305 transitions. [2024-10-24 12:04:49,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 12:04:49,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 127 [2024-10-24 12:04:49,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:04:49,885 INFO L225 Difference]: With dead ends: 212 [2024-10-24 12:04:49,886 INFO L226 Difference]: Without dead ends: 108 [2024-10-24 12:04:49,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:04:49,889 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 1 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 12:04:49,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 428 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 12:04:49,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-24 12:04:49,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-10-24 12:04:49,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 89 states have (on average 1.3595505617977528) internal successors, (121), 89 states have internal predecessors, (121), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 12:04:49,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 153 transitions. [2024-10-24 12:04:49,903 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 153 transitions. Word has length 127 [2024-10-24 12:04:49,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:04:49,905 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 153 transitions. [2024-10-24 12:04:49,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 12:04:49,906 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 153 transitions. [2024-10-24 12:04:49,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-24 12:04:49,909 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:04:49,910 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:04:49,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 12:04:49,910 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:04:49,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:04:49,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1908829675, now seen corresponding path program 1 times [2024-10-24 12:04:49,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:04:49,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852520205] [2024-10-24 12:04:49,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:04:49,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:04:50,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:51,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 12:04:51,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:51,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:04:51,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:51,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 12:04:51,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:51,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 12:04:51,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:51,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 12:04:51,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:51,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 12:04:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:51,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:04:51,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:51,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 12:04:51,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:51,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 12:04:51,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:51,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 12:04:51,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:51,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 12:04:51,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:51,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 12:04:51,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:51,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 12:04:51,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:51,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 12:04:51,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:51,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 12:04:51,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:51,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 12:04:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:51,485 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 12:04:51,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:04:51,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852520205] [2024-10-24 12:04:51,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852520205] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:04:51,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:04:51,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 12:04:51,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064084816] [2024-10-24 12:04:51,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:04:51,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 12:04:51,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:04:51,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 12:04:51,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-24 12:04:51,490 INFO L87 Difference]: Start difference. First operand 107 states and 153 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 12:04:52,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:04:52,023 INFO L93 Difference]: Finished difference Result 256 states and 365 transitions. [2024-10-24 12:04:52,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 12:04:52,024 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 127 [2024-10-24 12:04:52,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:04:52,026 INFO L225 Difference]: With dead ends: 256 [2024-10-24 12:04:52,026 INFO L226 Difference]: Without dead ends: 150 [2024-10-24 12:04:52,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-10-24 12:04:52,032 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 372 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 12:04:52,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 275 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 12:04:52,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-24 12:04:52,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 116. [2024-10-24 12:04:52,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 98 states have (on average 1.3673469387755102) internal successors, (134), 98 states have internal predecessors, (134), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 12:04:52,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 166 transitions. [2024-10-24 12:04:52,061 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 166 transitions. Word has length 127 [2024-10-24 12:04:52,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:04:52,061 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 166 transitions. [2024-10-24 12:04:52,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 12:04:52,062 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 166 transitions. [2024-10-24 12:04:52,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 12:04:52,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:04:52,066 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:04:52,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 12:04:52,069 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:04:52,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:04:52,070 INFO L85 PathProgramCache]: Analyzing trace with hash 151429946, now seen corresponding path program 1 times [2024-10-24 12:04:52,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:04:52,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986370430] [2024-10-24 12:04:52,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:04:52,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:04:52,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:54,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 12:04:54,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:54,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:04:54,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:54,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 12:04:54,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:54,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 12:04:54,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:54,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 12:04:54,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:54,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 12:04:54,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:54,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:04:54,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:54,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 12:04:54,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:54,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 12:04:54,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:54,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 12:04:54,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:54,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 12:04:54,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:54,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 12:04:54,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:54,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 12:04:54,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:54,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 12:04:54,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:54,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 12:04:54,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:54,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 12:04:54,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:54,610 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-10-24 12:04:54,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:04:54,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986370430] [2024-10-24 12:04:54,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986370430] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:04:54,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924687653] [2024-10-24 12:04:54,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:04:54,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:04:54,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:04:54,614 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 12:04:54,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 12:04:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:54,959 INFO L255 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-10-24 12:04:54,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:04:55,965 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-24 12:04:56,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-24 12:04:56,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-24 12:04:57,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-24 12:04:57,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-24 12:04:58,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-24 12:04:58,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:58,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-24 12:04:58,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:58,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:58,646 INFO L349 Elim1Store]: treesize reduction 113, result has 23.1 percent of original size [2024-10-24 12:04:58,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 125 [2024-10-24 12:04:58,718 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-10-24 12:04:58,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 65 [2024-10-24 12:04:58,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:58,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:58,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2024-10-24 12:04:58,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:58,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:58,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:58,781 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2024-10-24 12:04:58,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 44 [2024-10-24 12:04:58,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:58,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2024-10-24 12:04:59,345 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 12:04:59,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 81 treesize of output 257 [2024-10-24 12:05:00,673 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 165 proven. 139 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2024-10-24 12:05:00,674 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 12:05:05,376 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_269 Int) (v_ArrVal_272 Int) (~WrapperStruct00_var_1_17_Pointer~0.offset Int) (~WrapperStruct00_var_1_17_Pointer~0.base Int)) (< 0 (mod (+ 943286515 (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_269)))) (store .cse1 c_~WrapperStruct00_var_1_3_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_3_Pointer~0.base) c_~WrapperStruct00_var_1_3_Pointer~0.offset v_ArrVal_272))))) (store .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base (store (select .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset (select (select .cse0 ~WrapperStruct00_var_1_17_Pointer~0.base) ~WrapperStruct00_var_1_17_Pointer~0.offset)))) c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset)) 4294967296))) is different from false [2024-10-24 12:05:05,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924687653] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:05:05,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 12:05:05,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 23 [2024-10-24 12:05:05,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317830158] [2024-10-24 12:05:05,406 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 12:05:05,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-24 12:05:05,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:05:05,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-24 12:05:05,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=583, Unknown=1, NotChecked=50, Total=756 [2024-10-24 12:05:05,409 INFO L87 Difference]: Start difference. First operand 116 states and 166 transitions. Second operand has 23 states, 21 states have (on average 4.714285714285714) internal successors, (99), 23 states have internal predecessors, (99), 9 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (32), 7 states have call predecessors, (32), 9 states have call successors, (32) [2024-10-24 12:05:06,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:05:06,609 INFO L93 Difference]: Finished difference Result 298 states and 422 transitions. [2024-10-24 12:05:06,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 12:05:06,611 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 4.714285714285714) internal successors, (99), 23 states have internal predecessors, (99), 9 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (32), 7 states have call predecessors, (32), 9 states have call successors, (32) Word has length 129 [2024-10-24 12:05:06,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:05:06,614 INFO L225 Difference]: With dead ends: 298 [2024-10-24 12:05:06,614 INFO L226 Difference]: Without dead ends: 183 [2024-10-24 12:05:06,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=239, Invalid=886, Unknown=1, NotChecked=64, Total=1190 [2024-10-24 12:05:06,620 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 504 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 12:05:06,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 714 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 12:05:06,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-24 12:05:06,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 176. [2024-10-24 12:05:06,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 154 states have (on average 1.3766233766233766) internal successors, (212), 155 states have internal predecessors, (212), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 12:05:06,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 250 transitions. [2024-10-24 12:05:06,651 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 250 transitions. Word has length 129 [2024-10-24 12:05:06,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:05:06,651 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 250 transitions. [2024-10-24 12:05:06,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 4.714285714285714) internal successors, (99), 23 states have internal predecessors, (99), 9 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (32), 7 states have call predecessors, (32), 9 states have call successors, (32) [2024-10-24 12:05:06,652 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 250 transitions. [2024-10-24 12:05:06,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-24 12:05:06,653 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:05:06,653 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:05:06,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 12:05:06,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:05:06,854 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:05:06,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:05:06,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1133992494, now seen corresponding path program 1 times [2024-10-24 12:05:06,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:05:06,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10402376] [2024-10-24 12:05:06,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:05:06,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:05:06,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:07,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 12:05:07,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:07,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:05:07,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:07,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 12:05:07,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:07,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 12:05:07,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:07,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 12:05:07,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:07,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 12:05:07,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:07,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:05:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:07,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 12:05:07,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:07,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 12:05:07,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:07,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 12:05:07,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:07,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 12:05:07,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:07,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 12:05:07,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:07,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 12:05:07,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:07,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 12:05:07,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:07,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 12:05:07,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:07,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 12:05:07,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:07,715 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 12:05:07,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:05:07,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10402376] [2024-10-24 12:05:07,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10402376] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:05:07,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:05:07,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 12:05:07,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016687470] [2024-10-24 12:05:07,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:05:07,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 12:05:07,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:05:07,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 12:05:07,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-24 12:05:07,719 INFO L87 Difference]: Start difference. First operand 176 states and 250 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 12:05:08,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:05:08,397 INFO L93 Difference]: Finished difference Result 482 states and 680 transitions. [2024-10-24 12:05:08,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 12:05:08,398 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 130 [2024-10-24 12:05:08,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:05:08,402 INFO L225 Difference]: With dead ends: 482 [2024-10-24 12:05:08,402 INFO L226 Difference]: Without dead ends: 296 [2024-10-24 12:05:08,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-10-24 12:05:08,404 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 161 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 12:05:08,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 590 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 12:05:08,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-10-24 12:05:08,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 237. [2024-10-24 12:05:08,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 197 states have (on average 1.3553299492385786) internal successors, (267), 198 states have internal predecessors, (267), 35 states have call successors, (35), 4 states have call predecessors, (35), 4 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-24 12:05:08,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 337 transitions. [2024-10-24 12:05:08,462 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 337 transitions. Word has length 130 [2024-10-24 12:05:08,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:05:08,462 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 337 transitions. [2024-10-24 12:05:08,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 12:05:08,462 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 337 transitions. [2024-10-24 12:05:08,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-24 12:05:08,464 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:05:08,464 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:05:08,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 12:05:08,466 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:05:08,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:05:08,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1744032267, now seen corresponding path program 1 times [2024-10-24 12:05:08,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:05:08,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649900638] [2024-10-24 12:05:08,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:05:08,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:05:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:09,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 12:05:09,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:09,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:05:09,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:09,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 12:05:09,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:09,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 12:05:09,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:09,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 12:05:09,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:09,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 12:05:09,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:09,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:05:09,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:09,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 12:05:09,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:09,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 12:05:09,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:09,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 12:05:09,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:09,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 12:05:09,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:09,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 12:05:09,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:09,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 12:05:09,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:09,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 12:05:09,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:09,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 12:05:09,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:09,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 12:05:09,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:09,638 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 12:05:09,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:05:09,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649900638] [2024-10-24 12:05:09,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649900638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:05:09,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:05:09,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 12:05:09,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925770817] [2024-10-24 12:05:09,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:05:09,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 12:05:09,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:05:09,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 12:05:09,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-24 12:05:09,642 INFO L87 Difference]: Start difference. First operand 237 states and 337 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 12:05:10,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:05:10,021 INFO L93 Difference]: Finished difference Result 412 states and 586 transitions. [2024-10-24 12:05:10,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 12:05:10,022 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 130 [2024-10-24 12:05:10,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:05:10,025 INFO L225 Difference]: With dead ends: 412 [2024-10-24 12:05:10,025 INFO L226 Difference]: Without dead ends: 237 [2024-10-24 12:05:10,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-10-24 12:05:10,026 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 237 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 12:05:10,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 212 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 12:05:10,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-10-24 12:05:10,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 233. [2024-10-24 12:05:10,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 193 states have (on average 1.3523316062176165) internal successors, (261), 194 states have internal predecessors, (261), 35 states have call successors, (35), 4 states have call predecessors, (35), 4 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-24 12:05:10,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 331 transitions. [2024-10-24 12:05:10,065 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 331 transitions. Word has length 130 [2024-10-24 12:05:10,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:05:10,067 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 331 transitions. [2024-10-24 12:05:10,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 12:05:10,068 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 331 transitions. [2024-10-24 12:05:10,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-24 12:05:10,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:05:10,069 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:05:10,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 12:05:10,069 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:05:10,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:05:10,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1563475376, now seen corresponding path program 1 times [2024-10-24 12:05:10,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:05:10,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782221635] [2024-10-24 12:05:10,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:05:10,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:05:10,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 12:05:10,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [513654673] [2024-10-24 12:05:10,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:05:10,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:05:10,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:05:10,252 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 12:05:10,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 12:05:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 12:05:10,576 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 12:05:10,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 12:05:10,987 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 12:05:10,987 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 12:05:10,988 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 12:05:11,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 12:05:11,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-24 12:05:11,194 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:05:11,354 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 12:05:11,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:05:11 BoogieIcfgContainer [2024-10-24 12:05:11,357 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 12:05:11,358 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 12:05:11,358 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 12:05:11,358 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 12:05:11,359 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:04:48" (3/4) ... [2024-10-24 12:05:11,361 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 12:05:11,362 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 12:05:11,362 INFO L158 Benchmark]: Toolchain (without parser) took 24382.06ms. Allocated memory was 184.5MB in the beginning and 453.0MB in the end (delta: 268.4MB). Free memory was 127.9MB in the beginning and 232.7MB in the end (delta: -104.9MB). Peak memory consumption was 164.0MB. Max. memory is 16.1GB. [2024-10-24 12:05:11,363 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 184.5MB. Free memory is still 149.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 12:05:11,363 INFO L158 Benchmark]: CACSL2BoogieTranslator took 465.95ms. Allocated memory is still 184.5MB. Free memory was 127.9MB in the beginning and 109.4MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 12:05:11,363 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.71ms. Allocated memory is still 184.5MB. Free memory was 109.4MB in the beginning and 104.8MB in the end (delta: 4.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 12:05:11,363 INFO L158 Benchmark]: Boogie Preprocessor took 92.95ms. Allocated memory is still 184.5MB. Free memory was 104.8MB in the beginning and 99.8MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 12:05:11,364 INFO L158 Benchmark]: RCFGBuilder took 861.62ms. Allocated memory is still 184.5MB. Free memory was 99.8MB in the beginning and 59.1MB in the end (delta: 40.7MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-10-24 12:05:11,364 INFO L158 Benchmark]: TraceAbstraction took 22875.35ms. Allocated memory was 184.5MB in the beginning and 453.0MB in the end (delta: 268.4MB). Free memory was 58.7MB in the beginning and 232.7MB in the end (delta: -174.1MB). Peak memory consumption was 94.8MB. Max. memory is 16.1GB. [2024-10-24 12:05:11,364 INFO L158 Benchmark]: Witness Printer took 3.95ms. Allocated memory is still 453.0MB. Free memory is still 232.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 12:05:11,366 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.20ms. Allocated memory is still 184.5MB. Free memory is still 149.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 465.95ms. Allocated memory is still 184.5MB. Free memory was 127.9MB in the beginning and 109.4MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.71ms. Allocated memory is still 184.5MB. Free memory was 109.4MB in the beginning and 104.8MB in the end (delta: 4.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 92.95ms. Allocated memory is still 184.5MB. Free memory was 104.8MB in the beginning and 99.8MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 861.62ms. Allocated memory is still 184.5MB. Free memory was 99.8MB in the beginning and 59.1MB in the end (delta: 40.7MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 22875.35ms. Allocated memory was 184.5MB in the beginning and 453.0MB in the end (delta: 268.4MB). Free memory was 58.7MB in the beginning and 232.7MB in the end (delta: -174.1MB). Peak memory consumption was 94.8MB. Max. memory is 16.1GB. * Witness Printer took 3.95ms. Allocated memory is still 453.0MB. Free memory is still 232.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 someBinaryFLOATComparisonOperation at line 121, overapproximation of someBinaryArithmeticFLOAToperation at line 74. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { -64, 1.8, 8.54, 255.8, 50.4, 0, 8, 32, 5, 2, 0, 16, -1, -16 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { -64, 1.8, 8.54, 255.8, 50.4, 0, 8, 32, 5, 2, 0, 16, -1, -16 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { -64, 1.8, 8.54, 255.8, 50.4, 0, 8, 32, 5, 2, 0, 16, -1, -16 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { -64, 1.8, 8.54, 255.8, 50.4, 0, 8, 32, 5, 2, 0, 16, -1, -16 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { -64, 1.8, 8.54, 255.8, 50.4, 0, 8, 32, 5, 2, 0, 16, -1, -16 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { -64, 1.8, 8.54, 255.8, 50.4, 0, 8, 32, 5, 2, 0, 16, -1, -16 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { -64, 1.8, 8.54, 255.8, 50.4, 0, 8, 32, 5, 2, 0, 16, -1, -16 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { -64, 1.8, 8.54, 255.8, 50.4, 0, 8, 32, 5, 2, 0, 16, -1, -16 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { -64, 1.8, 8.54, 255.8, 50.4, 0, 8, 32, 5, 2, 0, 16, -1, -16 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { -64, 1.8, 8.54, 255.8, 50.4, 0, 8, 32, 5, 2, 0, 16, -1, -16 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { -64, 1.8, 8.54, 255.8, 50.4, 0, 8, 32, 5, 2, 0, 16, -1, -16 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { -64, 1.8, 8.54, 255.8, 50.4, 0, 8, 32, 5, 2, 0, 16, -1, -16 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { -64, 1.8, 8.54, 255.8, 50.4, 0, 8, 32, 5, 2, 0, 16, -1, -16 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { -64, 1.8, 8.54, 255.8, 50.4, 0, 8, 32, 5, 2, 0, 16, -1, -16 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { -64, 1.8, 8.54, 255.8, 50.4, 0, 8, 32, 5, 2, 0, 16, -1, -16 }; [L55] signed long int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L56] float* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L57] float* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L58] float* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L59] float* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L60] unsigned char* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L61] unsigned long int* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L62] unsigned char* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L63] unsigned char* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L64] unsigned char* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L65] signed short int* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L66] unsigned long int* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L67] signed char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L68] signed char* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L69] unsigned char last_1_WrapperStruct00_var_1_7 = 0; [L125] isInitial = 1 [L126] FCALL initially() [L127] COND TRUE 1 [L128] CALL updateLastVariables() [L118] EXPR WrapperStruct00.var_1_7 [L118] last_1_WrapperStruct00_var_1_7 = WrapperStruct00.var_1_7 [L128] RET updateLastVariables() [L129] CALL updateVariables() [L91] WrapperStruct00.var_1_4 = __VERIFIER_nondet_float() [L92] EXPR WrapperStruct00.var_1_4 [L92] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L92] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F [L92] EXPR WrapperStruct00.var_1_4 [L92] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L92] EXPR (WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L92] EXPR (WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L92] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L92] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L93] WrapperStruct00.var_1_5 = __VERIFIER_nondet_float() [L94] EXPR WrapperStruct00.var_1_5 [L94] EXPR WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L94] EXPR WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F [L94] EXPR WrapperStruct00.var_1_5 [L94] EXPR WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L94] EXPR (WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L94] EXPR (WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L94] CALL assume_abort_if_not((WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L94] RET assume_abort_if_not((WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L95] WrapperStruct00.var_1_6 = __VERIFIER_nondet_float() [L96] EXPR WrapperStruct00.var_1_6 [L96] EXPR WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L96] EXPR WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F [L96] EXPR WrapperStruct00.var_1_6 [L96] EXPR WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L96] EXPR (WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L96] EXPR (WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L96] CALL assume_abort_if_not((WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L96] RET assume_abort_if_not((WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L97] WrapperStruct00.var_1_8 = __VERIFIER_nondet_ulong() [L98] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L99] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L100] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L101] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L102] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L103] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L104] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L105] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L106] WrapperStruct00.var_1_12 = __VERIFIER_nondet_uchar() [L107] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L108] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L109] WrapperStruct00.var_1_14 = __VERIFIER_nondet_ulong() [L110] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L111] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 4294967295) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 4294967295) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L112] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_14 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_14 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L113] WrapperStruct00.var_1_17 = __VERIFIER_nondet_char() [L114] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L115] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L129] RET updateVariables() [L130] CALL step() [L73] (*(WrapperStruct00_var_1_1_Pointer)) = ((((last_1_WrapperStruct00_var_1_7) < 0 ) ? -(last_1_WrapperStruct00_var_1_7) : (last_1_WrapperStruct00_var_1_7))) [L74] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L74] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L74] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L74] EXPR ((256.5f) < (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))) ? (256.5f) : (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f)) [L74] EXPR ((256.5f) < (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))) ? (256.5f) : (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L74] (*(WrapperStruct00_var_1_3_Pointer)) = (((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))) + ((((256.5f) < (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))) ? (256.5f) : (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))))) [L75] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L75] (*(WrapperStruct00_var_1_16_Pointer)) = (*(WrapperStruct00_var_1_17_Pointer)) [L76] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L76] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L76] EXPR (*(WrapperStruct00_var_1_16_Pointer)) & (*(WrapperStruct00_var_1_1_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L76] signed long int stepLocal_0 = (*(WrapperStruct00_var_1_16_Pointer)) & (*(WrapperStruct00_var_1_1_Pointer)); [L77] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L77] COND TRUE (- (3351680781u - (*(WrapperStruct00_var_1_8_Pointer)))) > stepLocal_0 [L78] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L78] EXPR \read(*WrapperStruct00_var_1_11_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L78] EXPR (((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))) [L78] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L78] EXPR (((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L78] EXPR (((*(WrapperStruct00_var_1_10_Pointer))) < ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) [L78] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L78] EXPR (((*(WrapperStruct00_var_1_10_Pointer))) < ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L78] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L78] (*(WrapperStruct00_var_1_7_Pointer)) = ((((((*(WrapperStruct00_var_1_10_Pointer))) < ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))) + (*(WrapperStruct00_var_1_12_Pointer))) [L80] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L80] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L80] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L80] EXPR \read(*WrapperStruct00_var_1_7_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L80] EXPR (*(WrapperStruct00_var_1_7_Pointer)) >> (*(WrapperStruct00_var_1_7_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L80] COND FALSE !(((*(WrapperStruct00_var_1_16_Pointer)) / (*(WrapperStruct00_var_1_14_Pointer))) < ((*(WrapperStruct00_var_1_7_Pointer)) >> (*(WrapperStruct00_var_1_7_Pointer)))) [L83] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L83] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L83] COND TRUE (*(WrapperStruct00_var_1_16_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer)) [L84] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L84] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L84] (*(WrapperStruct00_var_1_13_Pointer)) = (-5 + ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_11_Pointer)))) [L130] RET step() [L131] CALL, EXPR property() [L121] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L121] EXPR ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_7) < 0 ) ? -(last_1_WrapperStruct00_var_1_7) : (last_1_WrapperStruct00_var_1_7))))) && ((*(WrapperStruct00_var_1_3_Pointer)) == ((float) (((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))) + ((((256.5f) < (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))) ? (256.5f) : (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L121] EXPR ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_7) < 0 ) ? -(last_1_WrapperStruct00_var_1_7) : (last_1_WrapperStruct00_var_1_7))))) && ((*(WrapperStruct00_var_1_3_Pointer)) == ((float) (((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))) + ((((256.5f) < (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))) ? (256.5f) : (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))))))) [L121] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L121] EXPR ((256.5f) < (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))) ? (256.5f) : (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f)) [L121] EXPR ((256.5f) < (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))) ? (256.5f) : (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L121] EXPR ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_7) < 0 ) ? -(last_1_WrapperStruct00_var_1_7) : (last_1_WrapperStruct00_var_1_7))))) && ((*(WrapperStruct00_var_1_3_Pointer)) == ((float) (((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))) + ((((256.5f) < (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))) ? (256.5f) : (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L121] EXPR (((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_7) < 0 ) ? -(last_1_WrapperStruct00_var_1_7) : (last_1_WrapperStruct00_var_1_7))))) && ((*(WrapperStruct00_var_1_3_Pointer)) == ((float) (((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))) + ((((256.5f) < (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))) ? (256.5f) : (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f)))))))) && (((- (3351680781u - (*(WrapperStruct00_var_1_8_Pointer)))) > ((*(WrapperStruct00_var_1_16_Pointer)) & (*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((((((*(WrapperStruct00_var_1_10_Pointer))) < ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))) + (*(WrapperStruct00_var_1_12_Pointer))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L121] EXPR (((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_7) < 0 ) ? -(last_1_WrapperStruct00_var_1_7) : (last_1_WrapperStruct00_var_1_7))))) && ((*(WrapperStruct00_var_1_3_Pointer)) == ((float) (((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))) + ((((256.5f) < (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))) ? (256.5f) : (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f)))))))) && (((- (3351680781u - (*(WrapperStruct00_var_1_8_Pointer)))) > ((*(WrapperStruct00_var_1_16_Pointer)) & (*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((((((*(WrapperStruct00_var_1_10_Pointer))) < ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))) + (*(WrapperStruct00_var_1_12_Pointer))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L121] EXPR ((((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_7) < 0 ) ? -(last_1_WrapperStruct00_var_1_7) : (last_1_WrapperStruct00_var_1_7))))) && ((*(WrapperStruct00_var_1_3_Pointer)) == ((float) (((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))) + ((((256.5f) < (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))) ? (256.5f) : (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f)))))))) && (((- (3351680781u - (*(WrapperStruct00_var_1_8_Pointer)))) > ((*(WrapperStruct00_var_1_16_Pointer)) & (*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((((((*(WrapperStruct00_var_1_10_Pointer))) < ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))) + (*(WrapperStruct00_var_1_12_Pointer))))) : 1)) && ((((*(WrapperStruct00_var_1_16_Pointer)) / (*(WrapperStruct00_var_1_14_Pointer))) < ((*(WrapperStruct00_var_1_7_Pointer)) >> (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) ((((4 - (*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -(4 - (*(WrapperStruct00_var_1_11_Pointer))) : (4 - (*(WrapperStruct00_var_1_11_Pointer))))))) : (((*(WrapperStruct00_var_1_16_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (-5 + ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_11_Pointer)))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) 256)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L121] EXPR ((((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_7) < 0 ) ? -(last_1_WrapperStruct00_var_1_7) : (last_1_WrapperStruct00_var_1_7))))) && ((*(WrapperStruct00_var_1_3_Pointer)) == ((float) (((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))) + ((((256.5f) < (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))) ? (256.5f) : (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f)))))))) && (((- (3351680781u - (*(WrapperStruct00_var_1_8_Pointer)))) > ((*(WrapperStruct00_var_1_16_Pointer)) & (*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((((((*(WrapperStruct00_var_1_10_Pointer))) < ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))) + (*(WrapperStruct00_var_1_12_Pointer))))) : 1)) && ((((*(WrapperStruct00_var_1_16_Pointer)) / (*(WrapperStruct00_var_1_14_Pointer))) < ((*(WrapperStruct00_var_1_7_Pointer)) >> (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) ((((4 - (*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -(4 - (*(WrapperStruct00_var_1_11_Pointer))) : (4 - (*(WrapperStruct00_var_1_11_Pointer))))))) : (((*(WrapperStruct00_var_1_16_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (-5 + ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_11_Pointer)))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) 256)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L121] EXPR (((((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_7) < 0 ) ? -(last_1_WrapperStruct00_var_1_7) : (last_1_WrapperStruct00_var_1_7))))) && ((*(WrapperStruct00_var_1_3_Pointer)) == ((float) (((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))) + ((((256.5f) < (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))) ? (256.5f) : (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f)))))))) && (((- (3351680781u - (*(WrapperStruct00_var_1_8_Pointer)))) > ((*(WrapperStruct00_var_1_16_Pointer)) & (*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((((((*(WrapperStruct00_var_1_10_Pointer))) < ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))) + (*(WrapperStruct00_var_1_12_Pointer))))) : 1)) && ((((*(WrapperStruct00_var_1_16_Pointer)) / (*(WrapperStruct00_var_1_14_Pointer))) < ((*(WrapperStruct00_var_1_7_Pointer)) >> (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) ((((4 - (*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -(4 - (*(WrapperStruct00_var_1_11_Pointer))) : (4 - (*(WrapperStruct00_var_1_11_Pointer))))))) : (((*(WrapperStruct00_var_1_16_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (-5 + ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_11_Pointer)))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) 256))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_17_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L121] EXPR (((((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_7) < 0 ) ? -(last_1_WrapperStruct00_var_1_7) : (last_1_WrapperStruct00_var_1_7))))) && ((*(WrapperStruct00_var_1_3_Pointer)) == ((float) (((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))) + ((((256.5f) < (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))) ? (256.5f) : (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f)))))))) && (((- (3351680781u - (*(WrapperStruct00_var_1_8_Pointer)))) > ((*(WrapperStruct00_var_1_16_Pointer)) & (*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((((((*(WrapperStruct00_var_1_10_Pointer))) < ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))) + (*(WrapperStruct00_var_1_12_Pointer))))) : 1)) && ((((*(WrapperStruct00_var_1_16_Pointer)) / (*(WrapperStruct00_var_1_14_Pointer))) < ((*(WrapperStruct00_var_1_7_Pointer)) >> (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) ((((4 - (*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -(4 - (*(WrapperStruct00_var_1_11_Pointer))) : (4 - (*(WrapperStruct00_var_1_11_Pointer))))))) : (((*(WrapperStruct00_var_1_16_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (-5 + ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_11_Pointer)))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) 256))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_17_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L121-L122] return (((((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_7) < 0 ) ? -(last_1_WrapperStruct00_var_1_7) : (last_1_WrapperStruct00_var_1_7))))) && ((*(WrapperStruct00_var_1_3_Pointer)) == ((float) (((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))) + ((((256.5f) < (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))) ? (256.5f) : (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f)))))))) && (((- (3351680781u - (*(WrapperStruct00_var_1_8_Pointer)))) > ((*(WrapperStruct00_var_1_16_Pointer)) & (*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((((((*(WrapperStruct00_var_1_10_Pointer))) < ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))) + (*(WrapperStruct00_var_1_12_Pointer))))) : 1)) && ((((*(WrapperStruct00_var_1_16_Pointer)) / (*(WrapperStruct00_var_1_14_Pointer))) < ((*(WrapperStruct00_var_1_7_Pointer)) >> (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) ((((4 - (*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -(4 - (*(WrapperStruct00_var_1_11_Pointer))) : (4 - (*(WrapperStruct00_var_1_11_Pointer))))))) : (((*(WrapperStruct00_var_1_16_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (-5 + ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_11_Pointer)))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) 256))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_17_Pointer)))) ; [L131] RET, EXPR property() [L131] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.6s, OverallIterations: 7, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1281 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1275 mSDsluCounter, 2366 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1681 mSDsCounter, 168 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1836 IncrementalHoareTripleChecker+Invalid, 2004 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 168 mSolverCounterUnsat, 685 mSDtfsCounter, 1836 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 426 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=237occurred in iteration=5, InterpolantAutomatonStates: 41, 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, 6 MinimizatonAttempts, 105 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 16.8s InterpolantComputationTime, 1163 NumberOfCodeBlocks, 1163 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 892 ConstructedInterpolants, 2 QuantifiedInterpolants, 10170 SizeOfPredicates, 14 NumberOfNonLiveVariables, 474 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 7 InterpolantComputations, 5 PerfectInterpolantSequences, 3188/3360 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 12:05:11,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-95.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e669462867509a48cd8854a2d2c887397834599fcc49707fe1e1ec7fa25ff3cd --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 12:05:13,909 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 12:05:14,009 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 12:05:14,017 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 12:05:14,018 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 12:05:14,052 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 12:05:14,054 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 12:05:14,055 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 12:05:14,056 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 12:05:14,056 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 12:05:14,056 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 12:05:14,057 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 12:05:14,057 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 12:05:14,058 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 12:05:14,058 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 12:05:14,058 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 12:05:14,059 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 12:05:14,062 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 12:05:14,062 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 12:05:14,062 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 12:05:14,066 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 12:05:14,066 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 12:05:14,067 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 12:05:14,067 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 12:05:14,067 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 12:05:14,067 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 12:05:14,068 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 12:05:14,068 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 12:05:14,069 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 12:05:14,069 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 12:05:14,069 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 12:05:14,071 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 12:05:14,071 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 12:05:14,072 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 12:05:14,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:05:14,072 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 12:05:14,074 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 12:05:14,075 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 12:05:14,075 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 12:05:14,075 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 12:05:14,076 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 12:05:14,076 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 12:05:14,076 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 12:05:14,077 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 12:05:14,077 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 12:05:14,077 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e669462867509a48cd8854a2d2c887397834599fcc49707fe1e1ec7fa25ff3cd [2024-10-24 12:05:14,443 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 12:05:14,472 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 12:05:14,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 12:05:14,478 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 12:05:14,478 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 12:05:14,480 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-95.i [2024-10-24 12:05:16,109 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 12:05:16,346 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 12:05:16,347 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-95.i [2024-10-24 12:05:16,361 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ebe3800d/2511ed8ebaa64ff4ae04bb27eea2b3d2/FLAG51f088409 [2024-10-24 12:05:16,695 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ebe3800d/2511ed8ebaa64ff4ae04bb27eea2b3d2 [2024-10-24 12:05:16,698 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 12:05:16,700 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 12:05:16,703 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 12:05:16,704 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 12:05:16,710 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 12:05:16,711 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:05:16" (1/1) ... [2024-10-24 12:05:16,712 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6850868f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:16, skipping insertion in model container [2024-10-24 12:05:16,712 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:05:16" (1/1) ... [2024-10-24 12:05:16,747 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 12:05:16,957 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-95.i[917,930] [2024-10-24 12:05:17,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:05:17,066 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 12:05:17,081 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-95.i[917,930] [2024-10-24 12:05:17,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:05:17,172 INFO L204 MainTranslator]: Completed translation [2024-10-24 12:05:17,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:17 WrapperNode [2024-10-24 12:05:17,173 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 12:05:17,174 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 12:05:17,174 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 12:05:17,174 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 12:05:17,181 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:17" (1/1) ... [2024-10-24 12:05:17,208 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:17" (1/1) ... [2024-10-24 12:05:17,257 INFO L138 Inliner]: procedures = 36, calls = 149, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 456 [2024-10-24 12:05:17,257 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 12:05:17,258 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 12:05:17,258 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 12:05:17,258 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 12:05:17,270 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:17" (1/1) ... [2024-10-24 12:05:17,271 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:17" (1/1) ... [2024-10-24 12:05:17,280 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:17" (1/1) ... [2024-10-24 12:05:17,304 INFO L175 MemorySlicer]: Split 121 memory accesses to 2 slices as follows [2, 119]. 98 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 14]. The 16 writes are split as follows [0, 16]. [2024-10-24 12:05:17,305 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:17" (1/1) ... [2024-10-24 12:05:17,305 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:17" (1/1) ... [2024-10-24 12:05:17,352 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:17" (1/1) ... [2024-10-24 12:05:17,361 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:17" (1/1) ... [2024-10-24 12:05:17,368 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:17" (1/1) ... [2024-10-24 12:05:17,374 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:17" (1/1) ... [2024-10-24 12:05:17,379 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 12:05:17,380 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 12:05:17,380 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 12:05:17,380 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 12:05:17,381 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:17" (1/1) ... [2024-10-24 12:05:17,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:05:17,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:05:17,421 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 12:05:17,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 12:05:17,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 12:05:17,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 12:05:17,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 12:05:17,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-24 12:05:17,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-24 12:05:17,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 12:05:17,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 12:05:17,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-24 12:05:17,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-24 12:05:17,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-24 12:05:17,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-24 12:05:17,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 12:05:17,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 12:05:17,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-24 12:05:17,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-24 12:05:17,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-24 12:05:17,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-24 12:05:17,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-24 12:05:17,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-24 12:05:17,485 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 12:05:17,485 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 12:05:17,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 12:05:17,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 12:05:17,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-24 12:05:17,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-24 12:05:17,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-24 12:05:17,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-24 12:05:17,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 12:05:17,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 12:05:17,649 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 12:05:17,652 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 12:05:18,882 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2024-10-24 12:05:18,883 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 12:05:18,943 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 12:05:18,944 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 12:05:18,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:05:18 BoogieIcfgContainer [2024-10-24 12:05:18,955 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 12:05:18,958 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 12:05:18,958 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 12:05:18,961 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 12:05:18,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:05:16" (1/3) ... [2024-10-24 12:05:18,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21c0759b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:05:18, skipping insertion in model container [2024-10-24 12:05:18,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:17" (2/3) ... [2024-10-24 12:05:18,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21c0759b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:05:18, skipping insertion in model container [2024-10-24 12:05:18,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:05:18" (3/3) ... [2024-10-24 12:05:18,966 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-95.i [2024-10-24 12:05:18,983 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 12:05:18,983 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 12:05:19,059 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 12:05:19,065 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;@8243d26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 12:05:19,066 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 12:05:19,071 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 77 states have (on average 1.4415584415584415) internal successors, (111), 78 states have internal predecessors, (111), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 12:05:19,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-24 12:05:19,085 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:05:19,086 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:05:19,086 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:05:19,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:05:19,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1048508411, now seen corresponding path program 1 times [2024-10-24 12:05:19,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 12:05:19,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1860911717] [2024-10-24 12:05:19,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:05:19,106 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 12:05:19,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 12:05:19,110 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 12:05:19,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 12:05:19,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:19,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 12:05:19,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:05:19,681 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2024-10-24 12:05:19,682 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 12:05:19,683 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 12:05:19,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1860911717] [2024-10-24 12:05:19,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1860911717] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:05:19,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:05:19,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 12:05:19,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823331976] [2024-10-24 12:05:19,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:05:19,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 12:05:19,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 12:05:19,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 12:05:19,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 12:05:19,734 INFO L87 Difference]: Start difference. First operand has 96 states, 77 states have (on average 1.4415584415584415) internal successors, (111), 78 states have internal predecessors, (111), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 12:05:19,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:05:19,799 INFO L93 Difference]: Finished difference Result 189 states and 300 transitions. [2024-10-24 12:05:19,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 12:05:19,803 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 124 [2024-10-24 12:05:19,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:05:19,812 INFO L225 Difference]: With dead ends: 189 [2024-10-24 12:05:19,813 INFO L226 Difference]: Without dead ends: 94 [2024-10-24 12:05:19,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 12:05:19,823 INFO L432 NwaCegarLoop]: 130 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, 130 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 12:05:19,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 12:05:19,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-24 12:05:19,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-24 12:05:19,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 76 states have (on average 1.3421052631578947) internal successors, (102), 76 states have internal predecessors, (102), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 12:05:19,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 134 transitions. [2024-10-24 12:05:19,875 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 134 transitions. Word has length 124 [2024-10-24 12:05:19,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:05:19,876 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 134 transitions. [2024-10-24 12:05:19,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 12:05:19,877 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 134 transitions. [2024-10-24 12:05:19,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-24 12:05:19,880 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:05:19,880 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:05:19,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 12:05:20,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 12:05:20,082 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:05:20,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:05:20,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1529800535, now seen corresponding path program 1 times [2024-10-24 12:05:20,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 12:05:20,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [813326004] [2024-10-24 12:05:20,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:05:20,085 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 12:05:20,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 12:05:20,086 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 12:05:20,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 12:05:20,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:20,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 12:05:20,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:05:20,590 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 12:05:20,590 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 12:05:20,590 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 12:05:20,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [813326004] [2024-10-24 12:05:20,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [813326004] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:05:20,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:05:20,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 12:05:20,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570456928] [2024-10-24 12:05:20,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:05:20,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 12:05:20,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 12:05:20,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 12:05:20,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 12:05:20,596 INFO L87 Difference]: Start difference. First operand 94 states and 134 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 12:05:20,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:05:20,905 INFO L93 Difference]: Finished difference Result 194 states and 277 transitions. [2024-10-24 12:05:20,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 12:05:20,906 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 124 [2024-10-24 12:05:20,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:05:20,908 INFO L225 Difference]: With dead ends: 194 [2024-10-24 12:05:20,908 INFO L226 Difference]: Without dead ends: 101 [2024-10-24 12:05:20,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 12:05:20,910 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 1 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 12:05:20,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 608 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 12:05:20,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-24 12:05:20,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-10-24 12:05:20,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 82 states have internal predecessors, (108), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 12:05:20,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 140 transitions. [2024-10-24 12:05:20,924 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 140 transitions. Word has length 124 [2024-10-24 12:05:20,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:05:20,925 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 140 transitions. [2024-10-24 12:05:20,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 12:05:20,926 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 140 transitions. [2024-10-24 12:05:20,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-24 12:05:20,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:05:20,928 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:05:20,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 12:05:21,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 12:05:21,129 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:05:21,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:05:21,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1529860117, now seen corresponding path program 1 times [2024-10-24 12:05:21,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 12:05:21,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [623747558] [2024-10-24 12:05:21,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:05:21,132 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 12:05:21,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 12:05:21,133 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 12:05:21,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 12:05:21,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:21,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 12:05:21,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:05:21,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-10-24 12:05:21,723 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 12:05:21,727 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 12:05:21,727 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 12:05:21,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [623747558] [2024-10-24 12:05:21,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [623747558] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:05:21,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:05:21,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 12:05:21,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117165656] [2024-10-24 12:05:21,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:05:21,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 12:05:21,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 12:05:21,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 12:05:21,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 12:05:21,733 INFO L87 Difference]: Start difference. First operand 100 states and 140 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 12:05:23,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:05:23,058 INFO L93 Difference]: Finished difference Result 200 states and 280 transitions. [2024-10-24 12:05:23,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 12:05:23,059 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 124 [2024-10-24 12:05:23,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:05:23,061 INFO L225 Difference]: With dead ends: 200 [2024-10-24 12:05:23,061 INFO L226 Difference]: Without dead ends: 101 [2024-10-24 12:05:23,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-24 12:05:23,063 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 131 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 12:05:23,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 367 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 12:05:23,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-24 12:05:23,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-10-24 12:05:23,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 82 states have (on average 1.3048780487804879) internal successors, (107), 82 states have internal predecessors, (107), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 12:05:23,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 139 transitions. [2024-10-24 12:05:23,074 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 139 transitions. Word has length 124 [2024-10-24 12:05:23,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:05:23,074 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 139 transitions. [2024-10-24 12:05:23,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 12:05:23,075 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 139 transitions. [2024-10-24 12:05:23,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-24 12:05:23,077 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:05:23,077 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:05:23,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-24 12:05:23,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 12:05:23,279 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:05:23,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:05:23,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1656346673, now seen corresponding path program 1 times [2024-10-24 12:05:23,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 12:05:23,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1902878551] [2024-10-24 12:05:23,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:05:23,281 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 12:05:23,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 12:05:23,288 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 12:05:23,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 12:05:23,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:23,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 12:05:23,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:05:23,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-10-24 12:05:23,828 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 12:05:23,829 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 12:05:23,829 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 12:05:23,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1902878551] [2024-10-24 12:05:23,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1902878551] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:05:23,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:05:23,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 12:05:23,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361039962] [2024-10-24 12:05:23,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:05:23,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 12:05:23,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 12:05:23,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 12:05:23,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 12:05:23,832 INFO L87 Difference]: Start difference. First operand 100 states and 139 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 12:05:25,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:05:25,115 INFO L93 Difference]: Finished difference Result 200 states and 278 transitions. [2024-10-24 12:05:25,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 12:05:25,116 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 126 [2024-10-24 12:05:25,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:05:25,117 INFO L225 Difference]: With dead ends: 200 [2024-10-24 12:05:25,117 INFO L226 Difference]: Without dead ends: 101 [2024-10-24 12:05:25,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-24 12:05:25,119 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 119 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 12:05:25,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 362 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 12:05:25,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-24 12:05:25,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-10-24 12:05:25,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 82 states have (on average 1.2926829268292683) internal successors, (106), 82 states have internal predecessors, (106), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 12:05:25,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 138 transitions. [2024-10-24 12:05:25,128 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 138 transitions. Word has length 126 [2024-10-24 12:05:25,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:05:25,129 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 138 transitions. [2024-10-24 12:05:25,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 12:05:25,129 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 138 transitions. [2024-10-24 12:05:25,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-24 12:05:25,131 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:05:25,132 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:05:25,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-24 12:05:25,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 12:05:25,333 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:05:25,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:05:25,334 INFO L85 PathProgramCache]: Analyzing trace with hash 689543765, now seen corresponding path program 1 times [2024-10-24 12:05:25,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 12:05:25,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1646151068] [2024-10-24 12:05:25,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:05:25,335 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 12:05:25,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 12:05:25,339 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 12:05:25,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-24 12:05:25,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:25,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 12:05:25,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:05:25,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-10-24 12:05:25,894 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2024-10-24 12:05:25,894 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 12:05:25,894 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 12:05:25,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1646151068] [2024-10-24 12:05:25,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1646151068] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:05:25,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:05:25,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 12:05:25,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804871457] [2024-10-24 12:05:25,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:05:25,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 12:05:25,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 12:05:25,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 12:05:25,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 12:05:25,897 INFO L87 Difference]: Start difference. First operand 100 states and 138 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 12:05:27,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:05:27,011 INFO L93 Difference]: Finished difference Result 200 states and 276 transitions. [2024-10-24 12:05:27,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 12:05:27,013 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2024-10-24 12:05:27,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:05:27,014 INFO L225 Difference]: With dead ends: 200 [2024-10-24 12:05:27,014 INFO L226 Difference]: Without dead ends: 101 [2024-10-24 12:05:27,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-24 12:05:27,016 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 111 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 12:05:27,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 358 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 12:05:27,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-24 12:05:27,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-10-24 12:05:27,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 82 states have (on average 1.2804878048780488) internal successors, (105), 82 states have internal predecessors, (105), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 12:05:27,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 137 transitions. [2024-10-24 12:05:27,034 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 137 transitions. Word has length 128 [2024-10-24 12:05:27,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:05:27,035 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 137 transitions. [2024-10-24 12:05:27,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 12:05:27,035 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 137 transitions. [2024-10-24 12:05:27,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-24 12:05:27,037 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:05:27,037 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:05:27,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-24 12:05:27,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 12:05:27,239 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:05:27,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:05:27,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1952116751, now seen corresponding path program 1 times [2024-10-24 12:05:27,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 12:05:27,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [35231159] [2024-10-24 12:05:27,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:05:27,240 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 12:05:27,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 12:05:27,242 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 12:05:27,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-24 12:05:27,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:27,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-24 12:05:27,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:05:28,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-24 12:05:31,219 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 44 treesize of output 31 [2024-10-24 12:05:31,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 8 [2024-10-24 12:05:31,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 12 [2024-10-24 12:05:31,619 INFO L349 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2024-10-24 12:05:31,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 71 [2024-10-24 12:05:34,017 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 12:05:34,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 1 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 261 treesize of output 825 [2024-10-24 12:05:34,131 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 12:05:34,133 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 12:05:34,134 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 12:05:34,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [35231159] [2024-10-24 12:05:34,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [35231159] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:05:34,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:05:34,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 12:05:34,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340118010] [2024-10-24 12:05:34,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:05:34,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 12:05:34,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 12:05:34,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 12:05:34,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 12:05:34,136 INFO L87 Difference]: Start difference. First operand 100 states and 137 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 12:05:43,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 12:05:51,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:05:51,296 INFO L93 Difference]: Finished difference Result 421 states and 576 transitions. [2024-10-24 12:05:51,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 12:05:51,297 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 130 [2024-10-24 12:05:51,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:05:51,302 INFO L225 Difference]: With dead ends: 421 [2024-10-24 12:05:51,302 INFO L226 Difference]: Without dead ends: 322 [2024-10-24 12:05:51,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-10-24 12:05:51,304 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 533 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 139 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.2s IncrementalHoareTripleChecker+Time [2024-10-24 12:05:51,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 499 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 504 Invalid, 1 Unknown, 0 Unchecked, 16.2s Time] [2024-10-24 12:05:51,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-10-24 12:05:51,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 190. [2024-10-24 12:05:51,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 155 states have (on average 1.2838709677419355) internal successors, (199), 155 states have internal predecessors, (199), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-24 12:05:51,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 263 transitions. [2024-10-24 12:05:51,343 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 263 transitions. Word has length 130 [2024-10-24 12:05:51,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:05:51,343 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 263 transitions. [2024-10-24 12:05:51,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 12:05:51,344 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 263 transitions. [2024-10-24 12:05:51,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-24 12:05:51,349 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:05:51,349 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:05:51,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-24 12:05:51,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 12:05:51,551 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:05:51,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:05:51,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1671249868, now seen corresponding path program 1 times [2024-10-24 12:05:51,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 12:05:51,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [459582606] [2024-10-24 12:05:51,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:05:51,552 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 12:05:51,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 12:05:51,556 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 12:05:51,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process