./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-0.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-0.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 1f08343bb0cf522246be558fede7ff780229ba54086d45a049bb2b3d9e469da9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:54:44,466 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:54:44,542 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:54:44,546 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:54:44,548 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:54:44,576 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:54:44,578 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:54:44,579 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:54:44,580 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:54:44,583 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:54:44,584 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:54:44,584 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:54:44,585 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:54:44,585 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:54:44,585 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:54:44,587 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:54:44,587 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:54:44,587 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:54:44,588 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:54:44,589 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:54:44,589 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:54:44,589 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:54:44,590 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:54:44,590 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:54:44,590 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:54:44,591 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:54:44,591 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:54:44,591 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:54:44,592 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:54:44,592 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:54:44,593 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:54:44,593 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:54:44,593 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:54:44,594 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:54:44,594 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:54:44,594 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:54:44,595 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:54:44,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:54:44,595 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:54:44,595 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:54:44,596 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:54:44,596 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:54:44,596 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 -> 1f08343bb0cf522246be558fede7ff780229ba54086d45a049bb2b3d9e469da9 [2024-10-24 11:54:44,869 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:54:44,895 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:54:44,899 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:54:44,900 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:54:44,901 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:54:44,902 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-0.i [2024-10-24 11:54:46,407 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:54:46,595 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:54:46,595 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-0.i [2024-10-24 11:54:46,604 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/929fb1385/91da8dc645344be9b8e228bde7bc82bf/FLAG272b4e84f [2024-10-24 11:54:46,616 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/929fb1385/91da8dc645344be9b8e228bde7bc82bf [2024-10-24 11:54:46,618 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:54:46,620 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:54:46,621 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:54:46,621 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:54:46,627 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:54:46,628 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:54:46" (1/1) ... [2024-10-24 11:54:46,629 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@97328ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:46, skipping insertion in model container [2024-10-24 11:54:46,632 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:54:46" (1/1) ... [2024-10-24 11:54:46,661 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:54:46,819 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-0.i[916,929] [2024-10-24 11:54:46,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:54:46,883 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:54:46,910 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-0.i[916,929] [2024-10-24 11:54:46,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:54:46,972 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:54:46,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:46 WrapperNode [2024-10-24 11:54:46,973 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:54:46,974 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:54:46,974 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:54:46,974 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:54:46,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:46" (1/1) ... [2024-10-24 11:54:46,995 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:46" (1/1) ... [2024-10-24 11:54:47,027 INFO L138 Inliner]: procedures = 29, calls = 111, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 368 [2024-10-24 11:54:47,028 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:54:47,028 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:54:47,028 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:54:47,029 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:54:47,041 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:46" (1/1) ... [2024-10-24 11:54:47,042 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:46" (1/1) ... [2024-10-24 11:54:47,049 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:46" (1/1) ... [2024-10-24 11:54:47,068 INFO L175 MemorySlicer]: Split 91 memory accesses to 2 slices as follows [2, 89]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 13 writes are split as follows [0, 13]. [2024-10-24 11:54:47,069 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:46" (1/1) ... [2024-10-24 11:54:47,069 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:46" (1/1) ... [2024-10-24 11:54:47,082 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:46" (1/1) ... [2024-10-24 11:54:47,087 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:46" (1/1) ... [2024-10-24 11:54:47,093 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:46" (1/1) ... [2024-10-24 11:54:47,095 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:46" (1/1) ... [2024-10-24 11:54:47,107 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:54:47,108 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:54:47,108 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:54:47,108 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:54:47,109 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:46" (1/1) ... [2024-10-24 11:54:47,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:54:47,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:54:47,156 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:54:47,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:54:47,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:54:47,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 11:54:47,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 11:54:47,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 11:54:47,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 11:54:47,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 11:54:47,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 11:54:47,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 11:54:47,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 11:54:47,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 11:54:47,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 11:54:47,212 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:54:47,212 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:54:47,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:54:47,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 11:54:47,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:54:47,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:54:47,333 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:54:47,335 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:54:47,743 INFO L? ?]: Removed 77 outVars from TransFormulas that were not future-live. [2024-10-24 11:54:47,743 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:54:47,785 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:54:47,785 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:54:47,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:54:47 BoogieIcfgContainer [2024-10-24 11:54:47,786 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:54:47,789 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:54:47,790 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:54:47,794 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:54:47,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:54:46" (1/3) ... [2024-10-24 11:54:47,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14fabaf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:54:47, skipping insertion in model container [2024-10-24 11:54:47,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:46" (2/3) ... [2024-10-24 11:54:47,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14fabaf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:54:47, skipping insertion in model container [2024-10-24 11:54:47,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:54:47" (3/3) ... [2024-10-24 11:54:47,798 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-0.i [2024-10-24 11:54:47,816 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:54:47,817 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:54:47,876 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:54:47,883 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;@6d2bf5dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:54:47,883 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:54:47,888 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 67 states have (on average 1.507462686567164) internal successors, (101), 68 states have internal predecessors, (101), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-24 11:54:47,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-24 11:54:47,899 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:54:47,900 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:54:47,900 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:54:47,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:54:47,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1714216881, now seen corresponding path program 1 times [2024-10-24 11:54:47,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:54:47,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757485333] [2024-10-24 11:54:47,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:54:47,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:54:48,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:48,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:54:48,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:48,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:54:48,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:48,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:54:48,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:48,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:54:48,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:48,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:54:48,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:48,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:54:48,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:48,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:54:48,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:48,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:54:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:48,224 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 11:54:48,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:54:48,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757485333] [2024-10-24 11:54:48,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757485333] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:54:48,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:54:48,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:54:48,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425936633] [2024-10-24 11:54:48,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:54:48,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:54:48,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:54:48,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:54:48,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:54:48,261 INFO L87 Difference]: Start difference. First operand has 78 states, 67 states have (on average 1.507462686567164) internal successors, (101), 68 states have internal predecessors, (101), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 11:54:48,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:54:48,311 INFO L93 Difference]: Finished difference Result 150 states and 235 transitions. [2024-10-24 11:54:48,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:54:48,314 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2024-10-24 11:54:48,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:54:48,320 INFO L225 Difference]: With dead ends: 150 [2024-10-24 11:54:48,320 INFO L226 Difference]: Without dead ends: 73 [2024-10-24 11:54:48,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:54:48,326 INFO L432 NwaCegarLoop]: 99 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, 99 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:54:48,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:54:48,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-24 11:54:48,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-24 11:54:48,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 63 states have (on average 1.380952380952381) internal successors, (87), 63 states have internal predecessors, (87), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-24 11:54:48,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 103 transitions. [2024-10-24 11:54:48,395 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 103 transitions. Word has length 73 [2024-10-24 11:54:48,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:54:48,395 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 103 transitions. [2024-10-24 11:54:48,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 11:54:48,396 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 103 transitions. [2024-10-24 11:54:48,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-24 11:54:48,399 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:54:48,399 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:54:48,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:54:48,399 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:54:48,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:54:48,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1293091715, now seen corresponding path program 1 times [2024-10-24 11:54:48,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:54:48,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674975315] [2024-10-24 11:54:48,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:54:48,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:54:48,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:48,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:54:48,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:48,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:54:48,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:48,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:54:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:48,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:54:48,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:48,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:54:48,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:48,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:54:48,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:48,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:54:48,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:48,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:54:48,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:48,703 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 11:54:48,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:54:48,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674975315] [2024-10-24 11:54:48,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674975315] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:54:48,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:54:48,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:54:48,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705722422] [2024-10-24 11:54:48,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:54:48,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:54:48,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:54:48,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:54:48,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:54:48,709 INFO L87 Difference]: Start difference. First operand 73 states and 103 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 11:54:48,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:54:48,765 INFO L93 Difference]: Finished difference Result 147 states and 208 transitions. [2024-10-24 11:54:48,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:54:48,766 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2024-10-24 11:54:48,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:54:48,767 INFO L225 Difference]: With dead ends: 147 [2024-10-24 11:54:48,767 INFO L226 Difference]: Without dead ends: 75 [2024-10-24 11:54:48,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:54:48,769 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:54:48,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 284 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:54:48,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-24 11:54:48,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-10-24 11:54:48,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 65 states have internal predecessors, (89), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-24 11:54:48,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 105 transitions. [2024-10-24 11:54:48,788 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 105 transitions. Word has length 73 [2024-10-24 11:54:48,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:54:48,790 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 105 transitions. [2024-10-24 11:54:48,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 11:54:48,790 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 105 transitions. [2024-10-24 11:54:48,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-24 11:54:48,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:54:48,792 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:54:48,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:54:48,792 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:54:48,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:54:48,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1853791493, now seen corresponding path program 1 times [2024-10-24 11:54:48,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:54:48,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698919710] [2024-10-24 11:54:48,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:54:48,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:54:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:54:48,878 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:54:48,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:54:49,011 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:54:49,012 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:54:49,014 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:54:49,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:54:49,019 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-24 11:54:49,112 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:54:49,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:54:49 BoogieIcfgContainer [2024-10-24 11:54:49,119 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:54:49,120 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:54:49,120 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:54:49,120 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:54:49,121 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:54:47" (3/4) ... [2024-10-24 11:54:49,124 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:54:49,126 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:54:49,126 INFO L158 Benchmark]: Toolchain (without parser) took 2506.42ms. Allocated memory was 146.8MB in the beginning and 209.7MB in the end (delta: 62.9MB). Free memory was 76.8MB in the beginning and 115.8MB in the end (delta: -39.0MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. [2024-10-24 11:54:49,127 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 146.8MB. Free memory is still 98.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:54:49,128 INFO L158 Benchmark]: CACSL2BoogieTranslator took 352.32ms. Allocated memory was 146.8MB in the beginning and 209.7MB in the end (delta: 62.9MB). Free memory was 76.6MB in the beginning and 181.0MB in the end (delta: -104.5MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. [2024-10-24 11:54:49,130 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.53ms. Allocated memory is still 209.7MB. Free memory was 181.0MB in the beginning and 177.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 11:54:49,130 INFO L158 Benchmark]: Boogie Preprocessor took 79.13ms. Allocated memory is still 209.7MB. Free memory was 177.9MB in the beginning and 173.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:54:49,130 INFO L158 Benchmark]: RCFGBuilder took 677.91ms. Allocated memory is still 209.7MB. Free memory was 173.7MB in the beginning and 142.3MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-24 11:54:49,131 INFO L158 Benchmark]: TraceAbstraction took 1330.08ms. Allocated memory is still 209.7MB. Free memory was 142.3MB in the beginning and 115.8MB in the end (delta: 26.4MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB. [2024-10-24 11:54:49,131 INFO L158 Benchmark]: Witness Printer took 5.54ms. Allocated memory is still 209.7MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:54:49,133 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 146.8MB. Free memory is still 98.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 352.32ms. Allocated memory was 146.8MB in the beginning and 209.7MB in the end (delta: 62.9MB). Free memory was 76.6MB in the beginning and 181.0MB in the end (delta: -104.5MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.53ms. Allocated memory is still 209.7MB. Free memory was 181.0MB in the beginning and 177.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.13ms. Allocated memory is still 209.7MB. Free memory was 177.9MB in the beginning and 173.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 677.91ms. Allocated memory is still 209.7MB. Free memory was 173.7MB in the beginning and 142.3MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1330.08ms. Allocated memory is still 209.7MB. Free memory was 142.3MB in the beginning and 115.8MB in the end (delta: 26.4MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB. * Witness Printer took 5.54ms. Allocated memory is still 209.7MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 112, overapproximation of someBinaryArithmeticDOUBLEoperation at line 71. Possible FailurePath: [L33] unsigned char isInitial = 0; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L45] double* WrapperStruct0_var_1_1_Pointer = &(WrapperStruct0.var_1_1); [L46] unsigned char* WrapperStruct0_var_1_2_Pointer = &(WrapperStruct0.var_1_2); [L47] double* WrapperStruct0_var_1_3_Pointer = &(WrapperStruct0.var_1_3); [L48] double* WrapperStruct0_var_1_4_Pointer = &(WrapperStruct0.var_1_4); [L49] double* WrapperStruct0_var_1_5_Pointer = &(WrapperStruct0.var_1_5); [L50] unsigned char* WrapperStruct0_var_1_9_Pointer = &(WrapperStruct0.var_1_9); [L51] unsigned char* WrapperStruct0_var_1_10_Pointer = &(WrapperStruct0.var_1_10); [L52] unsigned char* WrapperStruct0_var_1_12_Pointer = &(WrapperStruct0.var_1_12); [L53] unsigned short int* WrapperStruct0_var_1_13_Pointer = &(WrapperStruct0.var_1_13); [L54] double last_1_WrapperStruct0_var_1_5 = 5.25; [L55] unsigned char last_1_WrapperStruct0_var_1_10 = 100; [L56] unsigned short int last_1_WrapperStruct0_var_1_13 = 5; [L116] isInitial = 1 [L117] FCALL initially() [L118] COND TRUE 1 [L119] CALL updateLastVariables() [L107] EXPR WrapperStruct0.var_1_5 [L107] last_1_WrapperStruct0_var_1_5 = WrapperStruct0.var_1_5 [L108] EXPR WrapperStruct0.var_1_10 [L108] last_1_WrapperStruct0_var_1_10 = WrapperStruct0.var_1_10 [L109] EXPR WrapperStruct0.var_1_13 [L109] last_1_WrapperStruct0_var_1_13 = WrapperStruct0.var_1_13 [L119] RET updateLastVariables() [L120] CALL updateVariables() [L92] WrapperStruct0.var_1_2 = __VERIFIER_nondet_uchar() [L93] EXPR WrapperStruct0.var_1_2 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L93] CALL assume_abort_if_not(WrapperStruct0.var_1_2 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L93] RET assume_abort_if_not(WrapperStruct0.var_1_2 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L94] EXPR WrapperStruct0.var_1_2 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L94] CALL assume_abort_if_not(WrapperStruct0.var_1_2 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L94] RET assume_abort_if_not(WrapperStruct0.var_1_2 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L95] WrapperStruct0.var_1_3 = __VERIFIER_nondet_double() [L96] EXPR WrapperStruct0.var_1_3 [L96] EXPR WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L96] EXPR WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F [L96] EXPR WrapperStruct0.var_1_3 [L96] EXPR WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L96] EXPR (WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F) || (WrapperStruct0.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L96] EXPR (WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F) || (WrapperStruct0.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L96] CALL assume_abort_if_not((WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F) || (WrapperStruct0.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L96] RET assume_abort_if_not((WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F) || (WrapperStruct0.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L97] WrapperStruct0.var_1_4 = __VERIFIER_nondet_double() [L98] EXPR WrapperStruct0.var_1_4 [L98] EXPR WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L98] EXPR WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F [L98] EXPR WrapperStruct0.var_1_4 [L98] EXPR WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L98] EXPR (WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F) || (WrapperStruct0.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L98] EXPR (WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F) || (WrapperStruct0.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L98] CALL assume_abort_if_not((WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F) || (WrapperStruct0.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L98] RET assume_abort_if_not((WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F) || (WrapperStruct0.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L99] WrapperStruct0.var_1_9 = __VERIFIER_nondet_uchar() [L100] EXPR WrapperStruct0.var_1_9 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L100] CALL assume_abort_if_not(WrapperStruct0.var_1_9 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L100] RET assume_abort_if_not(WrapperStruct0.var_1_9 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L101] EXPR WrapperStruct0.var_1_9 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L101] CALL assume_abort_if_not(WrapperStruct0.var_1_9 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L101] RET assume_abort_if_not(WrapperStruct0.var_1_9 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L102] WrapperStruct0.var_1_12 = __VERIFIER_nondet_uchar() [L103] EXPR WrapperStruct0.var_1_12 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L103] CALL assume_abort_if_not(WrapperStruct0.var_1_12 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L103] RET assume_abort_if_not(WrapperStruct0.var_1_12 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L104] EXPR WrapperStruct0.var_1_12 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L104] CALL assume_abort_if_not(WrapperStruct0.var_1_12 <= 254) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L104] RET assume_abort_if_not(WrapperStruct0.var_1_12 <= 254) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L120] RET updateVariables() [L121] CALL step() [L60] EXPR \read(*WrapperStruct0_var_1_9_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L60] COND FALSE !((*(WrapperStruct0_var_1_9_Pointer))) [L65] COND FALSE !((last_1_WrapperStruct0_var_1_13 + last_1_WrapperStruct0_var_1_13) < last_1_WrapperStruct0_var_1_13) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L70] EXPR \read(*WrapperStruct0_var_1_2_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L70] COND TRUE ! (*(WrapperStruct0_var_1_2_Pointer)) [L71] EXPR \read(*WrapperStruct0_var_1_3_Pointer) [L71] EXPR \read(*WrapperStruct0_var_1_4_Pointer) [L71] (*(WrapperStruct0_var_1_1_Pointer)) = ((*(WrapperStruct0_var_1_3_Pointer)) - (*(WrapperStruct0_var_1_4_Pointer))) [L75] EXPR \read(*WrapperStruct0_var_1_3_Pointer) [L75] EXPR \read(*WrapperStruct0_var_1_4_Pointer) [L75] EXPR \read(*WrapperStruct0_var_1_1_Pointer) [L75] EXPR \read(*WrapperStruct0_var_1_1_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L75] COND FALSE !(((*(WrapperStruct0_var_1_3_Pointer)) + ((*(WrapperStruct0_var_1_4_Pointer)) + (*(WrapperStruct0_var_1_1_Pointer)))) != (*(WrapperStruct0_var_1_1_Pointer))) [L88] EXPR \read(*WrapperStruct0_var_1_3_Pointer) [L88] (*(WrapperStruct0_var_1_5_Pointer)) = (*(WrapperStruct0_var_1_3_Pointer)) [L121] RET step() [L122] CALL, EXPR property() [L112] EXPR \read(*WrapperStruct0_var_1_2_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L112] EXPR (! (*(WrapperStruct0_var_1_2_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((*(WrapperStruct0_var_1_3_Pointer)) - (*(WrapperStruct0_var_1_4_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((((16.2) < ((*(WrapperStruct0_var_1_3_Pointer)))) ? (16.2) : ((*(WrapperStruct0_var_1_3_Pointer))))))) [L112] EXPR \read(*WrapperStruct0_var_1_1_Pointer) [L112] EXPR \read(*WrapperStruct0_var_1_3_Pointer) [L112] EXPR \read(*WrapperStruct0_var_1_4_Pointer) [L112] EXPR (! (*(WrapperStruct0_var_1_2_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((*(WrapperStruct0_var_1_3_Pointer)) - (*(WrapperStruct0_var_1_4_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((((16.2) < ((*(WrapperStruct0_var_1_3_Pointer)))) ? (16.2) : ((*(WrapperStruct0_var_1_3_Pointer))))))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L112] EXPR ((! (*(WrapperStruct0_var_1_2_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((*(WrapperStruct0_var_1_3_Pointer)) - (*(WrapperStruct0_var_1_4_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((((16.2) < ((*(WrapperStruct0_var_1_3_Pointer)))) ? (16.2) : ((*(WrapperStruct0_var_1_3_Pointer)))))))) && ((((*(WrapperStruct0_var_1_3_Pointer)) + ((*(WrapperStruct0_var_1_4_Pointer)) + (*(WrapperStruct0_var_1_1_Pointer)))) != (*(WrapperStruct0_var_1_1_Pointer))) ? ((*(WrapperStruct0_var_1_2_Pointer)) ? (((- (*(WrapperStruct0_var_1_13_Pointer))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_9_Pointer)) ? ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_4_Pointer)))) : 1) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L112] EXPR ((! (*(WrapperStruct0_var_1_2_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((*(WrapperStruct0_var_1_3_Pointer)) - (*(WrapperStruct0_var_1_4_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((((16.2) < ((*(WrapperStruct0_var_1_3_Pointer)))) ? (16.2) : ((*(WrapperStruct0_var_1_3_Pointer)))))))) && ((((*(WrapperStruct0_var_1_3_Pointer)) + ((*(WrapperStruct0_var_1_4_Pointer)) + (*(WrapperStruct0_var_1_1_Pointer)))) != (*(WrapperStruct0_var_1_1_Pointer))) ? ((*(WrapperStruct0_var_1_2_Pointer)) ? (((- (*(WrapperStruct0_var_1_13_Pointer))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_9_Pointer)) ? ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_4_Pointer)))) : 1) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L112] EXPR (((! (*(WrapperStruct0_var_1_2_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((*(WrapperStruct0_var_1_3_Pointer)) - (*(WrapperStruct0_var_1_4_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((((16.2) < ((*(WrapperStruct0_var_1_3_Pointer)))) ? (16.2) : ((*(WrapperStruct0_var_1_3_Pointer)))))))) && ((((*(WrapperStruct0_var_1_3_Pointer)) + ((*(WrapperStruct0_var_1_4_Pointer)) + (*(WrapperStruct0_var_1_1_Pointer)))) != (*(WrapperStruct0_var_1_1_Pointer))) ? ((*(WrapperStruct0_var_1_2_Pointer)) ? (((- (*(WrapperStruct0_var_1_13_Pointer))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_9_Pointer)) ? ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_4_Pointer)))) : 1) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((last_1_WrapperStruct0_var_1_13 + last_1_WrapperStruct0_var_1_13) < last_1_WrapperStruct0_var_1_13) ? ((last_1_WrapperStruct0_var_1_13 > last_1_WrapperStruct0_var_1_13) ? ((*(WrapperStruct0_var_1_10_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer)))) : 1) : 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L112] EXPR (((! (*(WrapperStruct0_var_1_2_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((*(WrapperStruct0_var_1_3_Pointer)) - (*(WrapperStruct0_var_1_4_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((((16.2) < ((*(WrapperStruct0_var_1_3_Pointer)))) ? (16.2) : ((*(WrapperStruct0_var_1_3_Pointer)))))))) && ((((*(WrapperStruct0_var_1_3_Pointer)) + ((*(WrapperStruct0_var_1_4_Pointer)) + (*(WrapperStruct0_var_1_1_Pointer)))) != (*(WrapperStruct0_var_1_1_Pointer))) ? ((*(WrapperStruct0_var_1_2_Pointer)) ? (((- (*(WrapperStruct0_var_1_13_Pointer))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_9_Pointer)) ? ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_4_Pointer)))) : 1) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((last_1_WrapperStruct0_var_1_13 + last_1_WrapperStruct0_var_1_13) < last_1_WrapperStruct0_var_1_13) ? ((last_1_WrapperStruct0_var_1_13 > last_1_WrapperStruct0_var_1_13) ? ((*(WrapperStruct0_var_1_10_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer)))) : 1) : 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L112] EXPR ((((! (*(WrapperStruct0_var_1_2_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((*(WrapperStruct0_var_1_3_Pointer)) - (*(WrapperStruct0_var_1_4_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((((16.2) < ((*(WrapperStruct0_var_1_3_Pointer)))) ? (16.2) : ((*(WrapperStruct0_var_1_3_Pointer)))))))) && ((((*(WrapperStruct0_var_1_3_Pointer)) + ((*(WrapperStruct0_var_1_4_Pointer)) + (*(WrapperStruct0_var_1_1_Pointer)))) != (*(WrapperStruct0_var_1_1_Pointer))) ? ((*(WrapperStruct0_var_1_2_Pointer)) ? (((- (*(WrapperStruct0_var_1_13_Pointer))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_9_Pointer)) ? ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_4_Pointer)))) : 1) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((last_1_WrapperStruct0_var_1_13 + last_1_WrapperStruct0_var_1_13) < last_1_WrapperStruct0_var_1_13) ? ((last_1_WrapperStruct0_var_1_13 > last_1_WrapperStruct0_var_1_13) ? ((*(WrapperStruct0_var_1_10_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer)))) : 1) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) ? ((((*(WrapperStruct0_var_1_4_Pointer)) * ((*(WrapperStruct0_var_1_3_Pointer)) - 5.3)) <= last_1_WrapperStruct0_var_1_5) ? ((*(WrapperStruct0_var_1_13_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_10)) : 1) : 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L112] EXPR ((((! (*(WrapperStruct0_var_1_2_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((*(WrapperStruct0_var_1_3_Pointer)) - (*(WrapperStruct0_var_1_4_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((((16.2) < ((*(WrapperStruct0_var_1_3_Pointer)))) ? (16.2) : ((*(WrapperStruct0_var_1_3_Pointer)))))))) && ((((*(WrapperStruct0_var_1_3_Pointer)) + ((*(WrapperStruct0_var_1_4_Pointer)) + (*(WrapperStruct0_var_1_1_Pointer)))) != (*(WrapperStruct0_var_1_1_Pointer))) ? ((*(WrapperStruct0_var_1_2_Pointer)) ? (((- (*(WrapperStruct0_var_1_13_Pointer))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_9_Pointer)) ? ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_4_Pointer)))) : 1) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((last_1_WrapperStruct0_var_1_13 + last_1_WrapperStruct0_var_1_13) < last_1_WrapperStruct0_var_1_13) ? ((last_1_WrapperStruct0_var_1_13 > last_1_WrapperStruct0_var_1_13) ? ((*(WrapperStruct0_var_1_10_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer)))) : 1) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) ? ((((*(WrapperStruct0_var_1_4_Pointer)) * ((*(WrapperStruct0_var_1_3_Pointer)) - 5.3)) <= last_1_WrapperStruct0_var_1_5) ? ((*(WrapperStruct0_var_1_13_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_10)) : 1) : 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L112-L113] return ((((! (*(WrapperStruct0_var_1_2_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((*(WrapperStruct0_var_1_3_Pointer)) - (*(WrapperStruct0_var_1_4_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((((16.2) < ((*(WrapperStruct0_var_1_3_Pointer)))) ? (16.2) : ((*(WrapperStruct0_var_1_3_Pointer)))))))) && ((((*(WrapperStruct0_var_1_3_Pointer)) + ((*(WrapperStruct0_var_1_4_Pointer)) + (*(WrapperStruct0_var_1_1_Pointer)))) != (*(WrapperStruct0_var_1_1_Pointer))) ? ((*(WrapperStruct0_var_1_2_Pointer)) ? (((- (*(WrapperStruct0_var_1_13_Pointer))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_9_Pointer)) ? ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_4_Pointer)))) : 1) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((last_1_WrapperStruct0_var_1_13 + last_1_WrapperStruct0_var_1_13) < last_1_WrapperStruct0_var_1_13) ? ((last_1_WrapperStruct0_var_1_13 > last_1_WrapperStruct0_var_1_13) ? ((*(WrapperStruct0_var_1_10_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer)))) : 1) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) ? ((((*(WrapperStruct0_var_1_4_Pointer)) * ((*(WrapperStruct0_var_1_3_Pointer)) - 5.3)) <= last_1_WrapperStruct0_var_1_5) ? ((*(WrapperStruct0_var_1_13_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_10)) : 1) : 1) ; [L122] RET, EXPR property() [L122] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L19] reach_error() VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 3, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 383 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 187 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 28 IncrementalHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 196 mSDtfsCounter, 28 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 219 NumberOfCodeBlocks, 219 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 144 ConstructedInterpolants, 0 QuantifiedInterpolants, 146 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 224/224 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 11:54:49,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-0.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 1f08343bb0cf522246be558fede7ff780229ba54086d45a049bb2b3d9e469da9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:54:51,351 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:54:51,429 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:54:51,434 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:54:51,435 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:54:51,468 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:54:51,469 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:54:51,470 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:54:51,470 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:54:51,472 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:54:51,472 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:54:51,472 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:54:51,473 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:54:51,473 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:54:51,473 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:54:51,474 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:54:51,474 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:54:51,474 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:54:51,475 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:54:51,475 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:54:51,475 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:54:51,479 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:54:51,479 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:54:51,479 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:54:51,479 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:54:51,480 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:54:51,480 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:54:51,480 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:54:51,480 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:54:51,481 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:54:51,481 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:54:51,481 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:54:51,481 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:54:51,482 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:54:51,482 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:54:51,486 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:54:51,486 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:54:51,486 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:54:51,486 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:54:51,487 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:54:51,487 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:54:51,488 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:54:51,488 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:54:51,488 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:54:51,489 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:54:51,489 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 -> 1f08343bb0cf522246be558fede7ff780229ba54086d45a049bb2b3d9e469da9 [2024-10-24 11:54:51,833 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:54:51,854 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:54:51,858 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:54:51,859 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:54:51,860 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:54:51,862 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-0.i [2024-10-24 11:54:53,356 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:54:53,591 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:54:53,593 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-0.i [2024-10-24 11:54:53,605 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/054af8afa/d80a77f21390473383a49ae35083ca2a/FLAGc1e3831ee [2024-10-24 11:54:53,955 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/054af8afa/d80a77f21390473383a49ae35083ca2a [2024-10-24 11:54:53,957 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:54:53,958 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:54:53,959 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:54:53,960 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:54:53,964 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:54:53,965 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:54:53" (1/1) ... [2024-10-24 11:54:53,966 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f6550c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:53, skipping insertion in model container [2024-10-24 11:54:53,966 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:54:53" (1/1) ... [2024-10-24 11:54:53,995 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:54:54,200 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-0.i[916,929] [2024-10-24 11:54:54,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:54:54,297 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:54:54,311 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-0.i[916,929] [2024-10-24 11:54:54,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:54:54,390 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:54:54,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:54 WrapperNode [2024-10-24 11:54:54,391 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:54:54,392 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:54:54,392 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:54:54,392 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:54:54,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:54" (1/1) ... [2024-10-24 11:54:54,421 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:54" (1/1) ... [2024-10-24 11:54:54,467 INFO L138 Inliner]: procedures = 33, calls = 111, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 368 [2024-10-24 11:54:54,468 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:54:54,469 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:54:54,469 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:54:54,469 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:54:54,481 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:54" (1/1) ... [2024-10-24 11:54:54,481 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:54" (1/1) ... [2024-10-24 11:54:54,489 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:54" (1/1) ... [2024-10-24 11:54:54,524 INFO L175 MemorySlicer]: Split 91 memory accesses to 2 slices as follows [2, 89]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 13 writes are split as follows [0, 13]. [2024-10-24 11:54:54,525 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:54" (1/1) ... [2024-10-24 11:54:54,526 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:54" (1/1) ... [2024-10-24 11:54:54,550 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:54" (1/1) ... [2024-10-24 11:54:54,560 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:54" (1/1) ... [2024-10-24 11:54:54,566 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:54" (1/1) ... [2024-10-24 11:54:54,569 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:54" (1/1) ... [2024-10-24 11:54:54,574 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:54:54,575 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:54:54,579 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:54:54,579 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:54:54,580 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:54" (1/1) ... [2024-10-24 11:54:54,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:54:54,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:54:54,613 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:54:54,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:54:54,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:54:54,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-24 11:54:54,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-24 11:54:54,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-24 11:54:54,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-24 11:54:54,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 11:54:54,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 11:54:54,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-24 11:54:54,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-24 11:54:54,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:54:54,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 11:54:54,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-24 11:54:54,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-24 11:54:54,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-24 11:54:54,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-24 11:54:54,657 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:54:54,657 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:54:54,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:54:54,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:54:54,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-24 11:54:54,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-24 11:54:54,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-24 11:54:54,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-24 11:54:54,774 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:54:54,776 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:55:13,323 INFO L? ?]: Removed 76 outVars from TransFormulas that were not future-live. [2024-10-24 11:55:13,323 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:55:13,389 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:55:13,390 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:55:13,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:55:13 BoogieIcfgContainer [2024-10-24 11:55:13,391 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:55:13,406 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:55:13,407 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:55:13,410 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:55:13,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:54:53" (1/3) ... [2024-10-24 11:55:13,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bd7875f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:55:13, skipping insertion in model container [2024-10-24 11:55:13,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:54" (2/3) ... [2024-10-24 11:55:13,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bd7875f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:55:13, skipping insertion in model container [2024-10-24 11:55:13,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:55:13" (3/3) ... [2024-10-24 11:55:13,414 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-0.i [2024-10-24 11:55:13,434 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:55:13,435 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:55:13,499 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:55:13,505 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;@dc3adb9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:55:13,505 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:55:13,509 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 67 states have (on average 1.507462686567164) internal successors, (101), 68 states have internal predecessors, (101), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-24 11:55:13,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-24 11:55:13,521 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:55:13,522 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:55:13,523 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:55:13,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:55:13,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1714216881, now seen corresponding path program 1 times [2024-10-24 11:55:13,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:55:13,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1344574215] [2024-10-24 11:55:13,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:55:13,545 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:55:13,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:55:13,548 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:55:13,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 11:55:14,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:14,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:55:14,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:55:14,073 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-10-24 11:55:14,074 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:55:14,074 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:55:14,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1344574215] [2024-10-24 11:55:14,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1344574215] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:55:14,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:55:14,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:55:14,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610653067] [2024-10-24 11:55:14,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:55:14,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:55:14,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:55:14,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:55:14,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:55:14,109 INFO L87 Difference]: Start difference. First operand has 78 states, 67 states have (on average 1.507462686567164) internal successors, (101), 68 states have internal predecessors, (101), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 11:55:14,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:55:14,166 INFO L93 Difference]: Finished difference Result 150 states and 235 transitions. [2024-10-24 11:55:14,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:55:14,170 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2024-10-24 11:55:14,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:55:14,176 INFO L225 Difference]: With dead ends: 150 [2024-10-24 11:55:14,176 INFO L226 Difference]: Without dead ends: 73 [2024-10-24 11:55:14,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:55:14,187 INFO L432 NwaCegarLoop]: 99 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, 99 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:55:14,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:55:14,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-24 11:55:14,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-24 11:55:14,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 63 states have (on average 1.380952380952381) internal successors, (87), 63 states have internal predecessors, (87), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-24 11:55:14,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 103 transitions. [2024-10-24 11:55:14,220 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 103 transitions. Word has length 73 [2024-10-24 11:55:14,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:55:14,220 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 103 transitions. [2024-10-24 11:55:14,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 11:55:14,220 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 103 transitions. [2024-10-24 11:55:14,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-24 11:55:14,225 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:55:14,225 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:55:14,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 11:55:14,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:55:14,426 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:55:14,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:55:14,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1293091715, now seen corresponding path program 1 times [2024-10-24 11:55:14,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:55:14,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1751817894] [2024-10-24 11:55:14,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:55:14,428 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:55:14,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:55:14,432 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:55:14,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 11:55:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:14,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:55:14,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:55:15,007 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-24 11:55:15,008 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:55:15,008 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:55:15,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1751817894] [2024-10-24 11:55:15,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1751817894] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:55:15,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:55:15,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:55:15,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522766126] [2024-10-24 11:55:15,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:55:15,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:55:15,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:55:15,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:55:15,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:55:15,012 INFO L87 Difference]: Start difference. First operand 73 states and 103 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 11:55:15,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:55:15,222 INFO L93 Difference]: Finished difference Result 147 states and 208 transitions. [2024-10-24 11:55:15,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:55:15,223 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2024-10-24 11:55:15,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:55:15,224 INFO L225 Difference]: With dead ends: 147 [2024-10-24 11:55:15,225 INFO L226 Difference]: Without dead ends: 75 [2024-10-24 11:55:15,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:55:15,226 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:55:15,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 284 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:55:15,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-24 11:55:15,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-10-24 11:55:15,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 65 states have internal predecessors, (89), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-24 11:55:15,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 105 transitions. [2024-10-24 11:55:15,241 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 105 transitions. Word has length 73 [2024-10-24 11:55:15,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:55:15,242 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 105 transitions. [2024-10-24 11:55:15,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 11:55:15,243 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 105 transitions. [2024-10-24 11:55:15,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-24 11:55:15,245 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:55:15,245 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:55:15,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 11:55:15,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:55:15,446 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:55:15,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:55:15,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1853791493, now seen corresponding path program 1 times [2024-10-24 11:55:15,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:55:15,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [174653629] [2024-10-24 11:55:15,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:55:15,448 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:55:15,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:55:15,450 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:55:15,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 11:55:15,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:15,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 11:55:15,880 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:55:16,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:55:16,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-10-24 11:55:16,349 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-24 11:55:16,350 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:55:16,350 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:55:16,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [174653629] [2024-10-24 11:55:16,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [174653629] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:55:16,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:55:16,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:55:16,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72103632] [2024-10-24 11:55:16,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:55:16,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:55:16,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:55:16,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:55:16,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:55:16,353 INFO L87 Difference]: Start difference. First operand 75 states and 105 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 11:55:21,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:55:26,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 11:55:30,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 11:55:32,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:55:39,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:55:41,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:55:45,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.80s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 11:55:45,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:55:45,723 INFO L93 Difference]: Finished difference Result 149 states and 209 transitions. [2024-10-24 11:55:45,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:55:45,757 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2024-10-24 11:55:45,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:55:45,758 INFO L225 Difference]: With dead ends: 149 [2024-10-24 11:55:45,758 INFO L226 Difference]: Without dead ends: 75 [2024-10-24 11:55:45,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:55:45,760 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 93 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:55:45,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 256 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 143 Invalid, 4 Unknown, 0 Unchecked, 29.2s Time] [2024-10-24 11:55:45,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-24 11:55:45,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2024-10-24 11:55:45,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 63 states have internal predecessors, (86), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-24 11:55:45,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 102 transitions. [2024-10-24 11:55:45,767 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 102 transitions. Word has length 73 [2024-10-24 11:55:45,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:55:45,768 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 102 transitions. [2024-10-24 11:55:45,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 11:55:45,768 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 102 transitions. [2024-10-24 11:55:45,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-24 11:55:45,769 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:55:45,770 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:55:45,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-24 11:55:45,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:55:45,971 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:55:45,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:55:45,971 INFO L85 PathProgramCache]: Analyzing trace with hash 103770307, now seen corresponding path program 1 times [2024-10-24 11:55:45,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:55:45,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [332506214] [2024-10-24 11:55:45,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:55:45,972 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:55:45,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:55:45,976 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:55:45,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 11:55:46,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:46,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 11:55:46,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:55:46,747 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:55:46,747 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 172 treesize of output 64 [2024-10-24 11:55:47,093 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 60 proven. 8 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-24 11:55:47,093 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:55:47,883 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:55:47,883 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 110 treesize of output 1 [2024-10-24 11:55:47,918 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-10-24 11:55:47,919 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:55:47,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [332506214] [2024-10-24 11:55:47,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [332506214] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:55:47,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:55:47,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-10-24 11:55:47,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517929536] [2024-10-24 11:55:47,919 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:55:47,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 11:55:47,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:55:47,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 11:55:47,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:55:47,924 INFO L87 Difference]: Start difference. First operand 73 states and 102 transitions. Second operand has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-24 11:55:53,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:55:57,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:56:01,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:56:06,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 11:56:09,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:56:13,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:56:16,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:56:20,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:56:23,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []