./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-29.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-29.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 e4586f78ee751b6530c15131f84e0f59424b7aaca2999c7f31f95655f82bfb98 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:37:16,135 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:37:16,216 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 06:37:16,221 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:37:16,224 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:37:16,248 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:37:16,249 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:37:16,249 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:37:16,250 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:37:16,250 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:37:16,250 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:37:16,251 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:37:16,251 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:37:16,252 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:37:16,252 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:37:16,253 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:37:16,253 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:37:16,253 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:37:16,254 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 06:37:16,254 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:37:16,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:37:16,258 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:37:16,259 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:37:16,259 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:37:16,259 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:37:16,259 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:37:16,259 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:37:16,260 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:37:16,260 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:37:16,260 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:37:16,260 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:37:16,261 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:37:16,261 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:37:16,261 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:37:16,261 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:37:16,262 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:37:16,262 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 06:37:16,264 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 06:37:16,264 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:37:16,264 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:37:16,265 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:37:16,265 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:37:16,265 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 -> e4586f78ee751b6530c15131f84e0f59424b7aaca2999c7f31f95655f82bfb98 [2024-10-13 06:37:16,519 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:37:16,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:37:16,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:37:16,550 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:37:16,550 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:37:16,552 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-29.i [2024-10-13 06:37:18,034 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:37:18,249 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:37:18,250 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-29.i [2024-10-13 06:37:18,258 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be8eff520/da7bfcc82e764ea9b2928a684fe0b424/FLAG2f4d35a77 [2024-10-13 06:37:18,271 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be8eff520/da7bfcc82e764ea9b2928a684fe0b424 [2024-10-13 06:37:18,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:37:18,275 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:37:18,276 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:37:18,276 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:37:18,282 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:37:18,283 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:37:18" (1/1) ... [2024-10-13 06:37:18,284 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d2c3531 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:37:18, skipping insertion in model container [2024-10-13 06:37:18,284 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:37:18" (1/1) ... [2024-10-13 06:37:18,307 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:37:18,475 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-29.i[917,930] [2024-10-13 06:37:18,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:37:18,547 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:37:18,580 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-29.i[917,930] [2024-10-13 06:37:18,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:37:18,656 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:37:18,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:37:18 WrapperNode [2024-10-13 06:37:18,657 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:37:18,659 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:37:18,659 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:37:18,659 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:37:18,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:37:18" (1/1) ... [2024-10-13 06:37:18,683 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:37:18" (1/1) ... [2024-10-13 06:37:18,719 INFO L138 Inliner]: procedures = 29, calls = 126, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 426 [2024-10-13 06:37:18,720 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:37:18,721 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:37:18,721 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:37:18,721 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:37:18,735 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:37:18" (1/1) ... [2024-10-13 06:37:18,735 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:37:18" (1/1) ... [2024-10-13 06:37:18,747 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:37:18" (1/1) ... [2024-10-13 06:37:18,786 INFO L175 MemorySlicer]: Split 108 memory accesses to 2 slices as follows [2, 106]. 98 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10]. The 12 writes are split as follows [0, 12]. [2024-10-13 06:37:18,791 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:37:18" (1/1) ... [2024-10-13 06:37:18,792 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:37:18" (1/1) ... [2024-10-13 06:37:18,806 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:37:18" (1/1) ... [2024-10-13 06:37:18,811 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:37:18" (1/1) ... [2024-10-13 06:37:18,816 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:37:18" (1/1) ... [2024-10-13 06:37:18,820 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:37:18" (1/1) ... [2024-10-13 06:37:18,825 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:37:18,826 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:37:18,826 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:37:18,827 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:37:18,827 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:37:18" (1/1) ... [2024-10-13 06:37:18,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:37:18,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:37:18,865 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 06:37:18,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 06:37:18,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:37:18,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-13 06:37:18,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-13 06:37:18,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 06:37:18,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 06:37:18,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-13 06:37:18,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-13 06:37:18,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 06:37:18,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 06:37:18,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-13 06:37:18,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-13 06:37:18,922 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:37:18,922 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:37:18,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 06:37:18,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 06:37:18,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:37:18,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:37:19,066 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:37:19,069 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:37:19,588 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2024-10-13 06:37:19,588 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:37:19,641 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:37:19,641 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:37:19,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:37:19 BoogieIcfgContainer [2024-10-13 06:37:19,642 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:37:19,645 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:37:19,645 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:37:19,649 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:37:19,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:37:18" (1/3) ... [2024-10-13 06:37:19,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@394e577a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:37:19, skipping insertion in model container [2024-10-13 06:37:19,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:37:18" (2/3) ... [2024-10-13 06:37:19,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@394e577a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:37:19, skipping insertion in model container [2024-10-13 06:37:19,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:37:19" (3/3) ... [2024-10-13 06:37:19,653 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-29.i [2024-10-13 06:37:19,669 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:37:19,670 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:37:19,732 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:37:19,743 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;@3db3b619, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:37:19,745 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:37:19,750 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 72 states have (on average 1.5) internal successors, (108), 73 states have internal predecessors, (108), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 06:37:19,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-13 06:37:19,764 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:37:19,766 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:37:19,767 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:37:19,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:37:19,773 INFO L85 PathProgramCache]: Analyzing trace with hash -2034243773, now seen corresponding path program 1 times [2024-10-13 06:37:19,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:37:19,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042254422] [2024-10-13 06:37:19,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:37:19,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:37:19,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:37:20,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 06:37:20,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:37:20,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:37:20,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:37:20,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:37:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:37:20,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:37:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:37:20,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:37:20,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:37:20,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:37:20,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:37:20,132 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-13 06:37:20,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:37:20,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042254422] [2024-10-13 06:37:20,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042254422] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:37:20,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:37:20,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:37:20,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906079708] [2024-10-13 06:37:20,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:37:20,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:37:20,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:37:20,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:37:20,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:37:20,163 INFO L87 Difference]: Start difference. First operand has 81 states, 72 states have (on average 1.5) internal successors, (108), 73 states have internal predecessors, (108), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-13 06:37:20,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:37:20,232 INFO L93 Difference]: Finished difference Result 159 states and 244 transitions. [2024-10-13 06:37:20,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:37:20,236 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 68 [2024-10-13 06:37:20,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:37:20,245 INFO L225 Difference]: With dead ends: 159 [2024-10-13 06:37:20,245 INFO L226 Difference]: Without dead ends: 79 [2024-10-13 06:37:20,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:37:20,251 INFO L432 NwaCegarLoop]: 111 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, 111 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:37:20,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:37:20,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-13 06:37:20,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-13 06:37:20,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 71 states have (on average 1.4507042253521127) internal successors, (103), 71 states have internal predecessors, (103), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 06:37:20,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 115 transitions. [2024-10-13 06:37:20,328 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 115 transitions. Word has length 68 [2024-10-13 06:37:20,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:37:20,329 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 115 transitions. [2024-10-13 06:37:20,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-13 06:37:20,330 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 115 transitions. [2024-10-13 06:37:20,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-13 06:37:20,335 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:37:20,336 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:37:20,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 06:37:20,336 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:37:20,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:37:20,337 INFO L85 PathProgramCache]: Analyzing trace with hash -731320069, now seen corresponding path program 1 times [2024-10-13 06:37:20,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:37:20,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565555928] [2024-10-13 06:37:20,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:37:20,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:37:20,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:37:20,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 06:37:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:37:20,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:37:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:37:20,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:37:20,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:37:20,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:37:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:37:20,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:37:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:37:20,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:37:20,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:37:20,687 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-13 06:37:20,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:37:20,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565555928] [2024-10-13 06:37:20,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565555928] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:37:20,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:37:20,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:37:20,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71326938] [2024-10-13 06:37:20,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:37:20,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:37:20,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:37:20,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:37:20,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:37:20,693 INFO L87 Difference]: Start difference. First operand 79 states and 115 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-13 06:37:20,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:37:20,760 INFO L93 Difference]: Finished difference Result 160 states and 233 transitions. [2024-10-13 06:37:20,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:37:20,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 68 [2024-10-13 06:37:20,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:37:20,763 INFO L225 Difference]: With dead ends: 160 [2024-10-13 06:37:20,763 INFO L226 Difference]: Without dead ends: 82 [2024-10-13 06:37:20,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:37:20,766 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 1 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:37:20,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 317 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:37:20,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-13 06:37:20,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2024-10-13 06:37:20,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 73 states have internal predecessors, (105), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 06:37:20,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 117 transitions. [2024-10-13 06:37:20,784 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 117 transitions. Word has length 68 [2024-10-13 06:37:20,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:37:20,787 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 117 transitions. [2024-10-13 06:37:20,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-13 06:37:20,788 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 117 transitions. [2024-10-13 06:37:20,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-13 06:37:20,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:37:20,793 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:37:20,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 06:37:20,793 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:37:20,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:37:20,794 INFO L85 PathProgramCache]: Analyzing trace with hash -674061767, now seen corresponding path program 1 times [2024-10-13 06:37:20,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:37:20,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48007634] [2024-10-13 06:37:20,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:37:20,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:37:20,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:37:20,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 06:37:20,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:37:20,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:37:20,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:37:20,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:37:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:37:20,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:37:20,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:37:21,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:37:21,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:37:21,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:37:21,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:37:21,014 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-13 06:37:21,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:37:21,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48007634] [2024-10-13 06:37:21,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48007634] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:37:21,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:37:21,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:37:21,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384705648] [2024-10-13 06:37:21,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:37:21,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:37:21,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:37:21,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:37:21,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:37:21,022 INFO L87 Difference]: Start difference. First operand 81 states and 117 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-13 06:37:21,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:37:21,083 INFO L93 Difference]: Finished difference Result 164 states and 237 transitions. [2024-10-13 06:37:21,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:37:21,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 68 [2024-10-13 06:37:21,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:37:21,085 INFO L225 Difference]: With dead ends: 164 [2024-10-13 06:37:21,085 INFO L226 Difference]: Without dead ends: 84 [2024-10-13 06:37:21,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:37:21,087 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 1 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:37:21,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 321 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:37:21,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-13 06:37:21,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2024-10-13 06:37:21,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 75 states have (on average 1.4266666666666667) internal successors, (107), 75 states have internal predecessors, (107), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 06:37:21,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 119 transitions. [2024-10-13 06:37:21,102 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 119 transitions. Word has length 68 [2024-10-13 06:37:21,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:37:21,103 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 119 transitions. [2024-10-13 06:37:21,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-13 06:37:21,105 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 119 transitions. [2024-10-13 06:37:21,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-13 06:37:21,107 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:37:21,107 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:37:21,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 06:37:21,108 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:37:21,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:37:21,108 INFO L85 PathProgramCache]: Analyzing trace with hash -674002185, now seen corresponding path program 1 times [2024-10-13 06:37:21,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:37:21,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720020331] [2024-10-13 06:37:21,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:37:21,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:37:21,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:37:21,223 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 06:37:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:37:21,359 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 06:37:21,359 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 06:37:21,360 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 06:37:21,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 06:37:21,366 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-13 06:37:21,451 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 06:37:21,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 06:37:21 BoogieIcfgContainer [2024-10-13 06:37:21,458 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 06:37:21,459 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 06:37:21,459 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 06:37:21,459 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 06:37:21,462 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:37:19" (3/4) ... [2024-10-13 06:37:21,464 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 06:37:21,465 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 06:37:21,466 INFO L158 Benchmark]: Toolchain (without parser) took 3191.07ms. Allocated memory was 153.1MB in the beginning and 220.2MB in the end (delta: 67.1MB). Free memory was 83.0MB in the beginning and 76.8MB in the end (delta: 6.1MB). Peak memory consumption was 73.7MB. Max. memory is 16.1GB. [2024-10-13 06:37:21,466 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 153.1MB. Free memory is still 106.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 06:37:21,467 INFO L158 Benchmark]: CACSL2BoogieTranslator took 381.92ms. Allocated memory is still 153.1MB. Free memory was 82.8MB in the beginning and 119.7MB in the end (delta: -36.8MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. [2024-10-13 06:37:21,467 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.31ms. Allocated memory is still 153.1MB. Free memory was 119.7MB in the beginning and 116.0MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 06:37:21,467 INFO L158 Benchmark]: Boogie Preprocessor took 104.73ms. Allocated memory is still 153.1MB. Free memory was 116.0MB in the beginning and 112.4MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 06:37:21,468 INFO L158 Benchmark]: RCFGBuilder took 815.85ms. Allocated memory is still 153.1MB. Free memory was 112.3MB in the beginning and 79.3MB in the end (delta: 33.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-13 06:37:21,468 INFO L158 Benchmark]: TraceAbstraction took 1812.89ms. Allocated memory was 153.1MB in the beginning and 220.2MB in the end (delta: 67.1MB). Free memory was 78.8MB in the beginning and 77.9MB in the end (delta: 936.4kB). Peak memory consumption was 71.1MB. Max. memory is 16.1GB. [2024-10-13 06:37:21,469 INFO L158 Benchmark]: Witness Printer took 6.82ms. Allocated memory is still 220.2MB. Free memory was 77.9MB in the beginning and 76.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 06:37:21,475 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 153.1MB. Free memory is still 106.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 381.92ms. Allocated memory is still 153.1MB. Free memory was 82.8MB in the beginning and 119.7MB in the end (delta: -36.8MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.31ms. Allocated memory is still 153.1MB. Free memory was 119.7MB in the beginning and 116.0MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 104.73ms. Allocated memory is still 153.1MB. Free memory was 116.0MB in the beginning and 112.4MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 815.85ms. Allocated memory is still 153.1MB. Free memory was 112.3MB in the beginning and 79.3MB in the end (delta: 33.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1812.89ms. Allocated memory was 153.1MB in the beginning and 220.2MB in the end (delta: 67.1MB). Free memory was 78.8MB in the beginning and 77.9MB in the end (delta: 936.4kB). Peak memory consumption was 71.1MB. Max. memory is 16.1GB. * Witness Printer took 6.82ms. Allocated memory is still 220.2MB. Free memory was 77.9MB in the beginning and 76.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 69. Possible FailurePath: [L34] unsigned char isInitial = 0; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 2.5, 9.3, 3.4, 32, 1, 8, 5, 1, 1, 8 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 2.5, 9.3, 3.4, 32, 1, 8, 5, 1, 1, 8 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 2.5, 9.3, 3.4, 32, 1, 8, 5, 1, 1, 8 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 2.5, 9.3, 3.4, 32, 1, 8, 5, 1, 1, 8 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 2.5, 9.3, 3.4, 32, 1, 8, 5, 1, 1, 8 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 2.5, 9.3, 3.4, 32, 1, 8, 5, 1, 1, 8 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 2.5, 9.3, 3.4, 32, 1, 8, 5, 1, 1, 8 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 2.5, 9.3, 3.4, 32, 1, 8, 5, 1, 1, 8 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 2.5, 9.3, 3.4, 32, 1, 8, 5, 1, 1, 8 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 2.5, 9.3, 3.4, 32, 1, 8, 5, 1, 1, 8 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 2.5, 9.3, 3.4, 32, 1, 8, 5, 1, 1, 8 }; [L47] float* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L48] float* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L49] float* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L50] unsigned short int* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L51] unsigned short int* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L52] unsigned char* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L53] unsigned char* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L54] unsigned char* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L55] unsigned char* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L56] unsigned char* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] FCALL updateLastVariables() [L109] CALL updateVariables() [L87] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L88] EXPR WrapperStruct00.var_1_3 [L88] EXPR WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, 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_9_Pointer={4:14}, isInitial=1] [L88] EXPR WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L88] EXPR WrapperStruct00.var_1_3 [L88] EXPR WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, 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_9_Pointer={4:14}, isInitial=1] [L88] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, 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_9_Pointer={4:14}, isInitial=1] [L88] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, 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_9_Pointer={4:14}, isInitial=1] [L88] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, 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_9_Pointer={4:14}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, 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_9_Pointer={4:14}, \old(cond)=1, isInitial=1] [L88] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, 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_9_Pointer={4:14}, isInitial=1] [L89] WrapperStruct00.var_1_4 = __VERIFIER_nondet_float() [L90] EXPR WrapperStruct00.var_1_4 [L90] EXPR WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, 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_9_Pointer={4:14}, isInitial=1] [L90] EXPR WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F [L90] EXPR WrapperStruct00.var_1_4 [L90] EXPR WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, 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_9_Pointer={4:14}, isInitial=1] [L90] EXPR (WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, 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_9_Pointer={4:14}, isInitial=1] [L90] EXPR (WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, 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_9_Pointer={4:14}, isInitial=1] [L90] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, 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_9_Pointer={4:14}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, 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_9_Pointer={4:14}, \old(cond)=1, isInitial=1] [L90] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, 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_9_Pointer={4:14}, isInitial=1] [L91] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L92] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, 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_9_Pointer={4:14}, isInitial=1] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, 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_9_Pointer={4:14}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, 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_9_Pointer={4:14}, \old(cond)=1, isInitial=1] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, 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_9_Pointer={4:14}, isInitial=1] [L93] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, 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_9_Pointer={4:14}, isInitial=1] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, 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_9_Pointer={4:14}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, 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_9_Pointer={4:14}, \old(cond)=1, isInitial=1] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, 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_9_Pointer={4:14}, isInitial=1] [L94] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L95] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, 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_9_Pointer={4:14}, isInitial=1] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, 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_9_Pointer={4:14}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, 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_9_Pointer={4:14}, \old(cond)=1, isInitial=1] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, 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_9_Pointer={4:14}, isInitial=1] [L96] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, 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_9_Pointer={4:14}, isInitial=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, 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_9_Pointer={4:14}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, 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_9_Pointer={4:14}, \old(cond)=1, isInitial=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, 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_9_Pointer={4:14}, isInitial=1] [L109] RET updateVariables() [L110] CALL step() [L60] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L60] (*(WrapperStruct00_var_1_12_Pointer)) = (*(WrapperStruct00_var_1_13_Pointer)) [L61] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L61] (*(WrapperStruct00_var_1_14_Pointer)) = (*(WrapperStruct00_var_1_11_Pointer)) [L62] EXPR \read(*WrapperStruct00_var_1_12_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, 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_9_Pointer={4:14}, isInitial=1] [L62] COND TRUE (*(WrapperStruct00_var_1_12_Pointer)) [L63] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L63] (*(WrapperStruct00_var_1_1_Pointer)) = (*(WrapperStruct00_var_1_3_Pointer)) [L69] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L69] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L69] EXPR \read(*WrapperStruct00_var_1_3_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, 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_9_Pointer={4:14}, isInitial=1] [L69] COND FALSE !(((*(WrapperStruct00_var_1_1_Pointer)) + 8.125) > ((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))) [L72] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L72] (*(WrapperStruct00_var_1_5_Pointer)) = (*(WrapperStruct00_var_1_14_Pointer)) [L74] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L74] signed long int stepLocal_0 = 5 * (*(WrapperStruct00_var_1_14_Pointer)); [L75] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L75] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, 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_9_Pointer={4:14}, isInitial=1] [L75] EXPR (((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_1_Pointer))) [L75] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L75] EXPR (((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_1_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, 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_9_Pointer={4:14}, isInitial=1, stepLocal_0=30] [L75] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, 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_9_Pointer={4:14}, isInitial=1] [L75] COND FALSE !((((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_1_Pointer))))) == (*(WrapperStruct00_var_1_1_Pointer))) [L82] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L82] EXPR \read(*WrapperStruct00_var_1_3_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, 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_9_Pointer={4:14}, isInitial=1] [L82] COND TRUE (*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_3_Pointer)) [L83] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L83] (*(WrapperStruct00_var_1_10_Pointer)) = (*(WrapperStruct00_var_1_11_Pointer)) [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR \read(*WrapperStruct00_var_1_12_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, 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_9_Pointer={4:14}, isInitial=1] [L101] EXPR (*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_3_Pointer)))) : ((! ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) : 1) [L101] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L101] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L101] EXPR (*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_3_Pointer)))) : ((! ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, 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_9_Pointer={4:14}, isInitial=1] [L101] EXPR ((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_3_Pointer)))) : ((! ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) : 1)) && ((((*(WrapperStruct00_var_1_1_Pointer)) + 8.125) > ((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned short int) ((((((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? (((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_14_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, 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_9_Pointer={4:14}, isInitial=1] [L101] EXPR ((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_3_Pointer)))) : ((! ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) : 1)) && ((((*(WrapperStruct00_var_1_1_Pointer)) + 8.125) > ((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned short int) ((((((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? (((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_14_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, 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_9_Pointer={4:14}, isInitial=1] [L101] EXPR (((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_3_Pointer)))) : ((! ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) : 1)) && ((((*(WrapperStruct00_var_1_1_Pointer)) + 8.125) > ((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned short int) ((((((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? (((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_14_Pointer)))))) && (((((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_1_Pointer))))) == (*(WrapperStruct00_var_1_1_Pointer))) ? (((*(WrapperStruct00_var_1_14_Pointer)) > (5 * (*(WrapperStruct00_var_1_14_Pointer)))) ? (((*(WrapperStruct00_var_1_1_Pointer)) < ((*(WrapperStruct00_var_1_1_Pointer)) * 256.5f)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_14_Pointer)))) : 1) : 1) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, 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_9_Pointer={4:14}, isInitial=1] [L101] EXPR (((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_3_Pointer)))) : ((! ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) : 1)) && ((((*(WrapperStruct00_var_1_1_Pointer)) + 8.125) > ((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned short int) ((((((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? (((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_14_Pointer)))))) && (((((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_1_Pointer))))) == (*(WrapperStruct00_var_1_1_Pointer))) ? (((*(WrapperStruct00_var_1_14_Pointer)) > (5 * (*(WrapperStruct00_var_1_14_Pointer)))) ? (((*(WrapperStruct00_var_1_1_Pointer)) < ((*(WrapperStruct00_var_1_1_Pointer)) * 256.5f)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_14_Pointer)))) : 1) : 1) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, 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_9_Pointer={4:14}, isInitial=1] [L101] EXPR ((((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_3_Pointer)))) : ((! ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) : 1)) && ((((*(WrapperStruct00_var_1_1_Pointer)) + 8.125) > ((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned short int) ((((((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? (((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_14_Pointer)))))) && (((((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_1_Pointer))))) == (*(WrapperStruct00_var_1_1_Pointer))) ? (((*(WrapperStruct00_var_1_14_Pointer)) > (5 * (*(WrapperStruct00_var_1_14_Pointer)))) ? (((*(WrapperStruct00_var_1_1_Pointer)) < ((*(WrapperStruct00_var_1_1_Pointer)) * 256.5f)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_14_Pointer)))) : 1) : 1) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_11_Pointer)))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, 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_9_Pointer={4:14}, isInitial=1] [L101] EXPR ((((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_3_Pointer)))) : ((! ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) : 1)) && ((((*(WrapperStruct00_var_1_1_Pointer)) + 8.125) > ((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned short int) ((((((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? (((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_14_Pointer)))))) && (((((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_1_Pointer))))) == (*(WrapperStruct00_var_1_1_Pointer))) ? (((*(WrapperStruct00_var_1_14_Pointer)) > (5 * (*(WrapperStruct00_var_1_14_Pointer)))) ? (((*(WrapperStruct00_var_1_1_Pointer)) < ((*(WrapperStruct00_var_1_1_Pointer)) * 256.5f)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_14_Pointer)))) : 1) : 1) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_11_Pointer)))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, 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_9_Pointer={4:14}, isInitial=1] [L101] EXPR (((((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_3_Pointer)))) : ((! ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) : 1)) && ((((*(WrapperStruct00_var_1_1_Pointer)) + 8.125) > ((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned short int) ((((((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? (((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_14_Pointer)))))) && (((((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_1_Pointer))))) == (*(WrapperStruct00_var_1_1_Pointer))) ? (((*(WrapperStruct00_var_1_14_Pointer)) > (5 * (*(WrapperStruct00_var_1_14_Pointer)))) ? (((*(WrapperStruct00_var_1_1_Pointer)) < ((*(WrapperStruct00_var_1_1_Pointer)) * 256.5f)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_14_Pointer)))) : 1) : 1) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_11_Pointer)))) : 1)) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_13_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, 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_9_Pointer={4:14}, isInitial=1] [L101] EXPR (((((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_3_Pointer)))) : ((! ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) : 1)) && ((((*(WrapperStruct00_var_1_1_Pointer)) + 8.125) > ((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned short int) ((((((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? (((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_14_Pointer)))))) && (((((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_1_Pointer))))) == (*(WrapperStruct00_var_1_1_Pointer))) ? (((*(WrapperStruct00_var_1_14_Pointer)) > (5 * (*(WrapperStruct00_var_1_14_Pointer)))) ? (((*(WrapperStruct00_var_1_1_Pointer)) < ((*(WrapperStruct00_var_1_1_Pointer)) * 256.5f)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_14_Pointer)))) : 1) : 1) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_11_Pointer)))) : 1)) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_13_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, 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_9_Pointer={4:14}, isInitial=1] [L101] EXPR ((((((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_3_Pointer)))) : ((! ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) : 1)) && ((((*(WrapperStruct00_var_1_1_Pointer)) + 8.125) > ((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned short int) ((((((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? (((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_14_Pointer)))))) && (((((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_1_Pointer))))) == (*(WrapperStruct00_var_1_1_Pointer))) ? (((*(WrapperStruct00_var_1_14_Pointer)) > (5 * (*(WrapperStruct00_var_1_14_Pointer)))) ? (((*(WrapperStruct00_var_1_1_Pointer)) < ((*(WrapperStruct00_var_1_1_Pointer)) * 256.5f)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_14_Pointer)))) : 1) : 1) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_11_Pointer)))) : 1)) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_13_Pointer))))) && ((*(WrapperStruct00_var_1_14_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_11_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, 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_9_Pointer={4:14}, isInitial=1] [L101] EXPR ((((((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_3_Pointer)))) : ((! ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) : 1)) && ((((*(WrapperStruct00_var_1_1_Pointer)) + 8.125) > ((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned short int) ((((((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? (((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_14_Pointer)))))) && (((((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_1_Pointer))))) == (*(WrapperStruct00_var_1_1_Pointer))) ? (((*(WrapperStruct00_var_1_14_Pointer)) > (5 * (*(WrapperStruct00_var_1_14_Pointer)))) ? (((*(WrapperStruct00_var_1_1_Pointer)) < ((*(WrapperStruct00_var_1_1_Pointer)) * 256.5f)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_14_Pointer)))) : 1) : 1) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_11_Pointer)))) : 1)) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_13_Pointer))))) && ((*(WrapperStruct00_var_1_14_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_11_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, 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_9_Pointer={4:14}, isInitial=1] [L101-L102] return ((((((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_3_Pointer)))) : ((! ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) : 1)) && ((((*(WrapperStruct00_var_1_1_Pointer)) + 8.125) > ((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned short int) ((((((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? (((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_14_Pointer)))))) && (((((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_1_Pointer))))) == (*(WrapperStruct00_var_1_1_Pointer))) ? (((*(WrapperStruct00_var_1_14_Pointer)) > (5 * (*(WrapperStruct00_var_1_14_Pointer)))) ? (((*(WrapperStruct00_var_1_1_Pointer)) < ((*(WrapperStruct00_var_1_1_Pointer)) * 256.5f)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_14_Pointer)))) : 1) : 1) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_11_Pointer)))) : 1)) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_13_Pointer))))) && ((*(WrapperStruct00_var_1_14_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_11_Pointer)))) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, 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_9_Pointer={4:14}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, 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_9_Pointer={4:14}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 81 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 4, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 749 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 421 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 52 IncrementalHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 328 mSDtfsCounter, 52 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=3, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 272 NumberOfCodeBlocks, 272 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 201 ConstructedInterpolants, 0 QuantifiedInterpolants, 205 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 180/180 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 06:37:21,516 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-29.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 e4586f78ee751b6530c15131f84e0f59424b7aaca2999c7f31f95655f82bfb98 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:37:23,811 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:37:23,901 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 06:37:23,908 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:37:23,909 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:37:23,943 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:37:23,944 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:37:23,945 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:37:23,945 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:37:23,947 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:37:23,947 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:37:23,947 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:37:23,948 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:37:23,948 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:37:23,949 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:37:23,949 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:37:23,950 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:37:23,950 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:37:23,953 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:37:23,953 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:37:23,953 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:37:23,954 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:37:23,956 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:37:23,957 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 06:37:23,957 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 06:37:23,957 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:37:23,958 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 06:37:23,958 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:37:23,958 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:37:23,959 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:37:23,959 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:37:23,959 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:37:23,959 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:37:23,960 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:37:23,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:37:23,960 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:37:23,961 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:37:23,962 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:37:23,963 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 06:37:23,963 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 06:37:23,963 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:37:23,964 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:37:23,964 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:37:23,965 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:37:23,965 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 06:37:23,966 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 -> e4586f78ee751b6530c15131f84e0f59424b7aaca2999c7f31f95655f82bfb98 [2024-10-13 06:37:24,330 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:37:24,358 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:37:24,361 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:37:24,363 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:37:24,363 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:37:24,366 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-29.i [2024-10-13 06:37:26,000 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:37:26,234 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:37:26,235 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-29.i [2024-10-13 06:37:26,244 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a4e7ce6f/3c5e0b8fff9e43f68c093059870c3657/FLAGf6374e85e [2024-10-13 06:37:26,591 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a4e7ce6f/3c5e0b8fff9e43f68c093059870c3657 [2024-10-13 06:37:26,593 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:37:26,594 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:37:26,595 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:37:26,595 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:37:26,602 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:37:26,602 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:37:26" (1/1) ... [2024-10-13 06:37:26,605 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b2d54c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:37:26, skipping insertion in model container [2024-10-13 06:37:26,605 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:37:26" (1/1) ... [2024-10-13 06:37:26,632 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:37:26,827 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-29.i[917,930] [2024-10-13 06:37:26,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:37:26,920 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:37:26,935 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-29.i[917,930] [2024-10-13 06:37:26,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:37:27,003 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:37:27,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:37:27 WrapperNode [2024-10-13 06:37:27,004 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:37:27,005 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:37:27,005 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:37:27,006 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:37:27,012 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:37:27" (1/1) ... [2024-10-13 06:37:27,032 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:37:27" (1/1) ... [2024-10-13 06:37:27,080 INFO L138 Inliner]: procedures = 33, calls = 126, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 426 [2024-10-13 06:37:27,080 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:37:27,081 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:37:27,081 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:37:27,081 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:37:27,093 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:37:27" (1/1) ... [2024-10-13 06:37:27,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:37:27" (1/1) ... [2024-10-13 06:37:27,104 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:37:27" (1/1) ... [2024-10-13 06:37:27,136 INFO L175 MemorySlicer]: Split 108 memory accesses to 2 slices as follows [2, 106]. 98 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10]. The 12 writes are split as follows [0, 12]. [2024-10-13 06:37:27,137 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:37:27" (1/1) ... [2024-10-13 06:37:27,137 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:37:27" (1/1) ... [2024-10-13 06:37:27,165 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:37:27" (1/1) ... [2024-10-13 06:37:27,173 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:37:27" (1/1) ... [2024-10-13 06:37:27,176 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:37:27" (1/1) ... [2024-10-13 06:37:27,185 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:37:27" (1/1) ... [2024-10-13 06:37:27,191 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:37:27,192 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:37:27,192 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:37:27,192 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:37:27,193 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:37:27" (1/1) ... [2024-10-13 06:37:27,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:37:27,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:37:27,230 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 06:37:27,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 06:37:27,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:37:27,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 06:37:27,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 06:37:27,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-13 06:37:27,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-13 06:37:27,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 06:37:27,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 06:37:27,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-13 06:37:27,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-13 06:37:27,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-13 06:37:27,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-13 06:37:27,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-13 06:37:27,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-13 06:37:27,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-13 06:37:27,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-13 06:37:27,300 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:37:27,300 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:37:27,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:37:27,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:37:27,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-13 06:37:27,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-13 06:37:27,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-13 06:37:27,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-13 06:37:27,447 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:37:27,449 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:37:36,719 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2024-10-13 06:37:36,719 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:37:36,779 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:37:36,779 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:37:36,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:37:36 BoogieIcfgContainer [2024-10-13 06:37:36,780 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:37:36,782 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:37:36,782 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:37:36,786 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:37:36,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:37:26" (1/3) ... [2024-10-13 06:37:36,786 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e615d70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:37:36, skipping insertion in model container [2024-10-13 06:37:36,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:37:27" (2/3) ... [2024-10-13 06:37:36,788 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e615d70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:37:36, skipping insertion in model container [2024-10-13 06:37:36,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:37:36" (3/3) ... [2024-10-13 06:37:36,790 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-29.i [2024-10-13 06:37:36,807 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:37:36,807 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:37:36,876 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:37:36,886 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;@c492a1e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:37:36,887 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:37:36,892 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 72 states have (on average 1.5) internal successors, (108), 73 states have internal predecessors, (108), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 06:37:36,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-13 06:37:36,902 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:37:36,903 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:37:36,904 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:37:36,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:37:36,911 INFO L85 PathProgramCache]: Analyzing trace with hash -2034243773, now seen corresponding path program 1 times [2024-10-13 06:37:36,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:37:36,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1903046892] [2024-10-13 06:37:36,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:37:36,927 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:37:36,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:37:36,930 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:37:36,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 06:37:37,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:37:37,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 06:37:37,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:37:37,373 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-13 06:37:37,373 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:37:37,374 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:37:37,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1903046892] [2024-10-13 06:37:37,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1903046892] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:37:37,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:37:37,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:37:37,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226496674] [2024-10-13 06:37:37,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:37:37,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:37:37,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:37:37,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:37:37,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:37:37,405 INFO L87 Difference]: Start difference. First operand has 81 states, 72 states have (on average 1.5) internal successors, (108), 73 states have internal predecessors, (108), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-13 06:37:37,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:37:37,468 INFO L93 Difference]: Finished difference Result 159 states and 244 transitions. [2024-10-13 06:37:37,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:37:37,470 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 68 [2024-10-13 06:37:37,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:37:37,477 INFO L225 Difference]: With dead ends: 159 [2024-10-13 06:37:37,477 INFO L226 Difference]: Without dead ends: 79 [2024-10-13 06:37:37,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:37:37,483 INFO L432 NwaCegarLoop]: 111 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, 111 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:37:37,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:37:37,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-13 06:37:37,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-13 06:37:37,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 71 states have (on average 1.4507042253521127) internal successors, (103), 71 states have internal predecessors, (103), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 06:37:37,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 115 transitions. [2024-10-13 06:37:37,522 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 115 transitions. Word has length 68 [2024-10-13 06:37:37,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:37:37,522 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 115 transitions. [2024-10-13 06:37:37,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-13 06:37:37,523 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 115 transitions. [2024-10-13 06:37:37,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-13 06:37:37,525 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:37:37,525 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:37:37,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 06:37:37,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:37:37,730 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:37:37,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:37:37,731 INFO L85 PathProgramCache]: Analyzing trace with hash -731320069, now seen corresponding path program 1 times [2024-10-13 06:37:37,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:37:37,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1850683437] [2024-10-13 06:37:37,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:37:37,732 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:37:37,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:37:37,735 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:37:37,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 06:37:38,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:37:38,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 06:37:38,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:37:38,158 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-13 06:37:38,158 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:37:38,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:37:38,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1850683437] [2024-10-13 06:37:38,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1850683437] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:37:38,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:37:38,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:37:38,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287534247] [2024-10-13 06:37:38,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:37:38,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:37:38,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:37:38,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:37:38,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:37:38,167 INFO L87 Difference]: Start difference. First operand 79 states and 115 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-13 06:37:38,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:37:38,451 INFO L93 Difference]: Finished difference Result 164 states and 239 transitions. [2024-10-13 06:37:38,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:37:38,453 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 68 [2024-10-13 06:37:38,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:37:38,454 INFO L225 Difference]: With dead ends: 164 [2024-10-13 06:37:38,454 INFO L226 Difference]: Without dead ends: 86 [2024-10-13 06:37:38,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 63 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-13 06:37:38,456 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 1 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:37:38,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 507 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:37:38,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-13 06:37:38,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2024-10-13 06:37:38,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 77 states have (on average 1.4155844155844155) internal successors, (109), 77 states have internal predecessors, (109), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 06:37:38,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 121 transitions. [2024-10-13 06:37:38,476 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 121 transitions. Word has length 68 [2024-10-13 06:37:38,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:37:38,479 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 121 transitions. [2024-10-13 06:37:38,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-13 06:37:38,480 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 121 transitions. [2024-10-13 06:37:38,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-13 06:37:38,481 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:37:38,481 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:37:38,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 06:37:38,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:37:38,682 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:37:38,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:37:38,683 INFO L85 PathProgramCache]: Analyzing trace with hash -674061767, now seen corresponding path program 1 times [2024-10-13 06:37:38,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:37:38,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2010807756] [2024-10-13 06:37:38,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:37:38,684 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:37:38,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:37:38,687 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:37:38,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 06:37:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:37:39,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 06:37:39,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:37:39,166 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-13 06:37:39,166 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:37:39,166 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:37:39,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2010807756] [2024-10-13 06:37:39,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2010807756] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:37:39,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:37:39,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:37:39,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034284418] [2024-10-13 06:37:39,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:37:39,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:37:39,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:37:39,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:37:39,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:37:39,169 INFO L87 Difference]: Start difference. First operand 85 states and 121 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-13 06:37:39,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:37:39,406 INFO L93 Difference]: Finished difference Result 172 states and 245 transitions. [2024-10-13 06:37:39,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:37:39,407 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 68 [2024-10-13 06:37:39,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:37:39,408 INFO L225 Difference]: With dead ends: 172 [2024-10-13 06:37:39,408 INFO L226 Difference]: Without dead ends: 88 [2024-10-13 06:37:39,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:37:39,410 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 1 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:37:39,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 603 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:37:39,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-13 06:37:39,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2024-10-13 06:37:39,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 06:37:39,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 123 transitions. [2024-10-13 06:37:39,419 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 123 transitions. Word has length 68 [2024-10-13 06:37:39,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:37:39,420 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 123 transitions. [2024-10-13 06:37:39,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-13 06:37:39,421 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 123 transitions. [2024-10-13 06:37:39,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-13 06:37:39,425 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:37:39,425 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:37:39,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-13 06:37:39,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:37:39,626 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:37:39,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:37:39,627 INFO L85 PathProgramCache]: Analyzing trace with hash -674002185, now seen corresponding path program 1 times [2024-10-13 06:37:39,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:37:39,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [177200682] [2024-10-13 06:37:39,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:37:39,628 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:37:39,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:37:39,631 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:37:39,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 06:37:39,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:37:39,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 06:37:39,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:37:40,162 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2024-10-13 06:37:40,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 43 [2024-10-13 06:37:40,314 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-13 06:37:40,314 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:37:40,314 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:37:40,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [177200682] [2024-10-13 06:37:40,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [177200682] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:37:40,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:37:40,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:37:40,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795998809] [2024-10-13 06:37:40,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:37:40,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:37:40,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:37:40,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:37:40,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:37:40,317 INFO L87 Difference]: Start difference. First operand 87 states and 123 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-13 06:37:42,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 06:37:46,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 06:37:50,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 06:37:53,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 06:37:56,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 06:38:00,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 06:38:00,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:38:00,758 INFO L93 Difference]: Finished difference Result 223 states and 314 transitions. [2024-10-13 06:38:00,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:38:00,759 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 68 [2024-10-13 06:38:00,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:38:00,763 INFO L225 Difference]: With dead ends: 223 [2024-10-13 06:38:00,763 INFO L226 Difference]: Without dead ends: 137 [2024-10-13 06:38:00,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:38:00,767 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 56 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:38:00,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 273 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 20.3s Time] [2024-10-13 06:38:00,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-13 06:38:00,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 93. [2024-10-13 06:38:00,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 85 states have (on average 1.411764705882353) internal successors, (120), 85 states have internal predecessors, (120), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 06:38:00,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 132 transitions. [2024-10-13 06:38:00,787 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 132 transitions. Word has length 68 [2024-10-13 06:38:00,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:38:00,788 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 132 transitions. [2024-10-13 06:38:00,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-13 06:38:00,788 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 132 transitions. [2024-10-13 06:38:00,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-13 06:38:00,789 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:38:00,790 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:38:00,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-13 06:38:00,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:38:00,991 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:38:00,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:38:00,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1695070539, now seen corresponding path program 1 times [2024-10-13 06:38:00,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:38:00,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [29100113] [2024-10-13 06:38:00,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:38:00,992 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:38:00,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:38:00,995 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:38:00,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 06:38:01,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:01,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-13 06:38:01,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:38:01,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 06:38:03,893 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 64 treesize of output 32 [2024-10-13 06:38:05,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 40 [2024-10-13 06:38:06,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 43 [2024-10-13 06:38:08,191 INFO L349 Elim1Store]: treesize reduction 70, result has 23.9 percent of original size [2024-10-13 06:38:08,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 74 [2024-10-13 06:38:08,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 82 [2024-10-13 06:38:08,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 94 [2024-10-13 06:38:09,248 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:38:09,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 161 treesize of output 73 [2024-10-13 06:38:09,434 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 16 proven. 32 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 06:38:09,434 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:38:15,187 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:38:15,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [29100113] [2024-10-13 06:38:15,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [29100113] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:38:15,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1075361049] [2024-10-13 06:38:15,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:38:15,188 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 06:38:15,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 06:38:15,190 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 06:38:15,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-10-13 06:38:16,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:16,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-10-13 06:38:16,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:38:16,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 06:38:18,833 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 64 treesize of output 32 [2024-10-13 06:38:19,821 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 64 treesize of output 32 [2024-10-13 06:38:21,049 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 64 treesize of output 32 [2024-10-13 06:38:22,584 INFO L349 Elim1Store]: treesize reduction 58, result has 27.5 percent of original size [2024-10-13 06:38:22,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 63 [2024-10-13 06:38:22,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 71 [2024-10-13 06:38:23,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 117 [2024-10-13 06:38:35,527 WARN L286 SmtUtils]: Spent 5.34s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)