./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-36.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-36.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 9e2d5d0417bcd19dd1bd5aa35ba5f9873fa877cfd261a114441164de37024a87 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:58:00,151 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:58:00,215 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:58:00,221 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:58:00,230 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:58:00,272 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:58:00,273 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:58:00,273 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:58:00,274 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:58:00,274 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:58:00,275 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:58:00,275 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:58:00,276 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:58:00,277 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:58:00,279 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:58:00,279 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:58:00,280 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:58:00,280 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:58:00,280 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:58:00,280 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:58:00,280 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:58:00,284 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:58:00,284 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:58:00,284 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:58:00,285 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:58:00,285 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:58:00,285 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:58:00,285 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:58:00,286 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:58:00,286 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:58:00,286 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:58:00,286 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:58:00,287 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:58:00,287 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:58:00,287 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:58:00,288 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:58:00,288 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:58:00,288 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:58:00,288 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:58:00,288 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:58:00,289 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:58:00,289 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:58:00,290 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 -> 9e2d5d0417bcd19dd1bd5aa35ba5f9873fa877cfd261a114441164de37024a87 [2024-10-24 11:58:00,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:58:00,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:58:00,586 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:58:00,588 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:58:00,588 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:58:00,590 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-36.i [2024-10-24 11:58:02,157 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:58:02,379 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:58:02,380 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-36.i [2024-10-24 11:58:02,389 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4e44f017/034e8ab684b542f7894c145c4850b135/FLAG8c363fb90 [2024-10-24 11:58:02,747 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4e44f017/034e8ab684b542f7894c145c4850b135 [2024-10-24 11:58:02,749 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:58:02,750 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:58:02,752 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:58:02,752 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:58:02,760 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:58:02,761 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:58:02" (1/1) ... [2024-10-24 11:58:02,764 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1439b63c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:58:02, skipping insertion in model container [2024-10-24 11:58:02,765 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:58:02" (1/1) ... [2024-10-24 11:58:02,799 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:58:02,992 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-36.i[917,930] [2024-10-24 11:58:03,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:58:03,092 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:58:03,105 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-36.i[917,930] [2024-10-24 11:58:03,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:58:03,166 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:58:03,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:58:03 WrapperNode [2024-10-24 11:58:03,167 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:58:03,168 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:58:03,169 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:58:03,169 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:58:03,176 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:58:03" (1/1) ... [2024-10-24 11:58:03,190 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:58:03" (1/1) ... [2024-10-24 11:58:03,246 INFO L138 Inliner]: procedures = 29, calls = 156, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 562 [2024-10-24 11:58:03,247 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:58:03,248 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:58:03,248 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:58:03,248 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:58:03,271 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:58:03" (1/1) ... [2024-10-24 11:58:03,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:58:03" (1/1) ... [2024-10-24 11:58:03,282 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:58:03" (1/1) ... [2024-10-24 11:58:03,308 INFO L175 MemorySlicer]: Split 133 memory accesses to 2 slices as follows [2, 131]. 98 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 12]. The 18 writes are split as follows [0, 18]. [2024-10-24 11:58:03,308 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:58:03" (1/1) ... [2024-10-24 11:58:03,309 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:58:03" (1/1) ... [2024-10-24 11:58:03,324 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:58:03" (1/1) ... [2024-10-24 11:58:03,330 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:58:03" (1/1) ... [2024-10-24 11:58:03,333 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:58:03" (1/1) ... [2024-10-24 11:58:03,336 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:58:03" (1/1) ... [2024-10-24 11:58:03,354 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:58:03,355 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:58:03,355 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:58:03,355 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:58:03,356 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:58:03" (1/1) ... [2024-10-24 11:58:03,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:58:03,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:58:03,403 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:58:03,410 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:58:03,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:58:03,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 11:58:03,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 11:58:03,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 11:58:03,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 11:58:03,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 11:58:03,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 11:58:03,463 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 11:58:03,463 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 11:58:03,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 11:58:03,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 11:58:03,464 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:58:03,464 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:58:03,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:58:03,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 11:58:03,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:58:03,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:58:03,629 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:58:03,631 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:58:04,275 INFO L? ?]: Removed 140 outVars from TransFormulas that were not future-live. [2024-10-24 11:58:04,276 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:58:04,321 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:58:04,321 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:58:04,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:58:04 BoogieIcfgContainer [2024-10-24 11:58:04,322 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:58:04,325 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:58:04,325 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:58:04,329 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:58:04,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:58:02" (1/3) ... [2024-10-24 11:58:04,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51227195 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:58:04, skipping insertion in model container [2024-10-24 11:58:04,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:58:03" (2/3) ... [2024-10-24 11:58:04,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51227195 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:58:04, skipping insertion in model container [2024-10-24 11:58:04,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:58:04" (3/3) ... [2024-10-24 11:58:04,333 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-36.i [2024-10-24 11:58:04,352 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:58:04,353 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:58:04,418 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:58:04,428 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;@5d094940, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:58:04,428 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:58:04,434 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 102 states have (on average 1.5196078431372548) internal successors, (155), 103 states have internal predecessors, (155), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:58:04,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 11:58:04,449 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:58:04,450 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:04,452 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:58:04,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:58:04,459 INFO L85 PathProgramCache]: Analyzing trace with hash -477692360, now seen corresponding path program 1 times [2024-10-24 11:58:04,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:58:04,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115369984] [2024-10-24 11:58:04,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:58:04,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:58:04,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:04,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:58:04,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:04,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 11:58:04,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:04,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:58:04,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:04,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:58:04,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:04,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:58:04,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:04,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:58:04,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:04,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:58:04,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:04,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:58:04,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:04,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:58:04,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:04,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:58:04,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:04,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:58:04,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:04,846 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:58:04,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:58:04,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115369984] [2024-10-24 11:58:04,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115369984] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:58:04,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:58:04,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:58:04,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368163146] [2024-10-24 11:58:04,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:58:04,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:58:04,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:58:04,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:58:04,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:58:04,885 INFO L87 Difference]: Start difference. First operand has 116 states, 102 states have (on average 1.5196078431372548) internal successors, (155), 103 states have internal predecessors, (155), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:58:04,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:58:04,941 INFO L93 Difference]: Finished difference Result 229 states and 363 transitions. [2024-10-24 11:58:04,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:58:04,944 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 104 [2024-10-24 11:58:04,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:58:04,952 INFO L225 Difference]: With dead ends: 229 [2024-10-24 11:58:04,952 INFO L226 Difference]: Without dead ends: 114 [2024-10-24 11:58:04,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 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:58:04,967 INFO L432 NwaCegarLoop]: 168 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, 168 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:58:04,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:58:04,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-24 11:58:05,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-10-24 11:58:05,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 101 states have (on average 1.4851485148514851) internal successors, (150), 101 states have internal predecessors, (150), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:58:05,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 172 transitions. [2024-10-24 11:58:05,031 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 172 transitions. Word has length 104 [2024-10-24 11:58:05,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:58:05,033 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 172 transitions. [2024-10-24 11:58:05,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:58:05,034 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 172 transitions. [2024-10-24 11:58:05,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 11:58:05,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:58:05,041 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:05,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:58:05,041 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:58:05,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:58:05,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1357778366, now seen corresponding path program 1 times [2024-10-24 11:58:05,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:58:05,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801757978] [2024-10-24 11:58:05,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:58:05,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:58:05,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:05,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:58:05,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:05,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 11:58:05,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:05,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:58:05,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:05,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:58:05,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:05,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:58:05,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:05,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:58:05,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:05,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:58:05,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:05,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:58:05,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:05,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:58:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:05,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:58:05,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:05,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:58:05,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:05,435 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:58:05,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:58:05,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801757978] [2024-10-24 11:58:05,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801757978] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:58:05,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:58:05,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:58:05,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966595207] [2024-10-24 11:58:05,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:58:05,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:58:05,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:58:05,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:58:05,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:58:05,444 INFO L87 Difference]: Start difference. First operand 114 states and 172 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:58:05,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:58:05,506 INFO L93 Difference]: Finished difference Result 229 states and 346 transitions. [2024-10-24 11:58:05,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:58:05,508 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 104 [2024-10-24 11:58:05,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:58:05,510 INFO L225 Difference]: With dead ends: 229 [2024-10-24 11:58:05,510 INFO L226 Difference]: Without dead ends: 116 [2024-10-24 11:58:05,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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:58:05,514 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 491 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:58:05,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 491 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:58:05,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-24 11:58:05,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-10-24 11:58:05,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 103 states have (on average 1.4757281553398058) internal successors, (152), 103 states have internal predecessors, (152), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:58:05,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 174 transitions. [2024-10-24 11:58:05,536 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 174 transitions. Word has length 104 [2024-10-24 11:58:05,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:58:05,538 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 174 transitions. [2024-10-24 11:58:05,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:58:05,551 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 174 transitions. [2024-10-24 11:58:05,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 11:58:05,553 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:58:05,553 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:05,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:58:05,553 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:58:05,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:58:05,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1155954432, now seen corresponding path program 1 times [2024-10-24 11:58:05,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:58:05,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056642721] [2024-10-24 11:58:05,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:58:05,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:58:05,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:05,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:58:05,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:05,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 11:58:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:05,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:58:05,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:05,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:58:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:05,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:58:05,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:05,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:58:05,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:05,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:58:05,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:05,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:58:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:05,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:58:05,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:05,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:58:05,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:05,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:58:05,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:05,985 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:58:05,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:58:05,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056642721] [2024-10-24 11:58:05,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056642721] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:58:05,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:58:05,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:58:05,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592927196] [2024-10-24 11:58:05,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:58:05,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:58:05,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:58:05,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:58:05,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:58:05,992 INFO L87 Difference]: Start difference. First operand 116 states and 174 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:58:06,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:58:06,261 INFO L93 Difference]: Finished difference Result 351 states and 528 transitions. [2024-10-24 11:58:06,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:58:06,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2024-10-24 11:58:06,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:58:06,265 INFO L225 Difference]: With dead ends: 351 [2024-10-24 11:58:06,266 INFO L226 Difference]: Without dead ends: 236 [2024-10-24 11:58:06,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:58:06,268 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 184 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:58:06,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 397 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:58:06,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-10-24 11:58:06,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 205. [2024-10-24 11:58:06,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 180 states have (on average 1.4666666666666666) internal successors, (264), 180 states have internal predecessors, (264), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 11:58:06,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 308 transitions. [2024-10-24 11:58:06,291 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 308 transitions. Word has length 104 [2024-10-24 11:58:06,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:58:06,292 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 308 transitions. [2024-10-24 11:58:06,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:58:06,293 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 308 transitions. [2024-10-24 11:58:06,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 11:58:06,294 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:58:06,294 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:06,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:58:06,295 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:58:06,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:58:06,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1914366729, now seen corresponding path program 1 times [2024-10-24 11:58:06,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:58:06,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772171219] [2024-10-24 11:58:06,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:58:06,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:58:06,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:07,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:58:07,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:07,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 11:58:07,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:07,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:58:07,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:07,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:58:07,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:07,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:58:07,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:07,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:58:07,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:07,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:58:07,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:07,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:58:07,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:07,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:58:07,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:07,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:58:07,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:07,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:58:07,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:07,619 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:58:07,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:58:07,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772171219] [2024-10-24 11:58:07,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772171219] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:58:07,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:58:07,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:58:07,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653647414] [2024-10-24 11:58:07,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:58:07,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:58:07,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:58:07,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:58:07,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:58:07,626 INFO L87 Difference]: Start difference. First operand 205 states and 308 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:58:08,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:58:08,091 INFO L93 Difference]: Finished difference Result 454 states and 683 transitions. [2024-10-24 11:58:08,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:58:08,092 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-10-24 11:58:08,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:58:08,094 INFO L225 Difference]: With dead ends: 454 [2024-10-24 11:58:08,094 INFO L226 Difference]: Without dead ends: 339 [2024-10-24 11:58:08,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:58:08,096 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 314 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:58:08,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 785 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:58:08,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2024-10-24 11:58:08,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 243. [2024-10-24 11:58:08,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 218 states have (on average 1.4862385321100917) internal successors, (324), 218 states have internal predecessors, (324), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 11:58:08,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 368 transitions. [2024-10-24 11:58:08,130 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 368 transitions. Word has length 105 [2024-10-24 11:58:08,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:58:08,131 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 368 transitions. [2024-10-24 11:58:08,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:58:08,131 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 368 transitions. [2024-10-24 11:58:08,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 11:58:08,133 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:58:08,133 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:08,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:58:08,133 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:58:08,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:58:08,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1971206721, now seen corresponding path program 1 times [2024-10-24 11:58:08,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:58:08,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952776653] [2024-10-24 11:58:08,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:58:08,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:58:08,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:08,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:58:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:08,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 11:58:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:08,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:58:08,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:08,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:58:08,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:08,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:58:08,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:08,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:58:08,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:08,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:58:08,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:08,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:58:08,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:08,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:58:08,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:08,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:58:08,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:08,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:58:08,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:08,243 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:58:08,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:58:08,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952776653] [2024-10-24 11:58:08,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952776653] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:58:08,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:58:08,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:58:08,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95140309] [2024-10-24 11:58:08,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:58:08,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:58:08,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:58:08,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:58:08,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:58:08,248 INFO L87 Difference]: Start difference. First operand 243 states and 368 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:58:08,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:58:08,281 INFO L93 Difference]: Finished difference Result 405 states and 616 transitions. [2024-10-24 11:58:08,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:58:08,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2024-10-24 11:58:08,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:58:08,283 INFO L225 Difference]: With dead ends: 405 [2024-10-24 11:58:08,283 INFO L226 Difference]: Without dead ends: 245 [2024-10-24 11:58:08,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:58:08,285 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:58:08,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 329 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:58:08,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-10-24 11:58:08,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2024-10-24 11:58:08,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 220 states have (on average 1.481818181818182) internal successors, (326), 220 states have internal predecessors, (326), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 11:58:08,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 370 transitions. [2024-10-24 11:58:08,318 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 370 transitions. Word has length 107 [2024-10-24 11:58:08,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:58:08,319 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 370 transitions. [2024-10-24 11:58:08,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:58:08,320 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 370 transitions. [2024-10-24 11:58:08,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 11:58:08,321 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:58:08,321 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:08,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 11:58:08,323 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:58:08,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:58:08,323 INFO L85 PathProgramCache]: Analyzing trace with hash -22937985, now seen corresponding path program 1 times [2024-10-24 11:58:08,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:58:08,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351768801] [2024-10-24 11:58:08,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:58:08,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:58:08,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:08,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:58:08,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:08,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 11:58:08,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:08,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:58:08,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:08,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:58:08,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:08,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:58:08,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:08,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:58:08,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:08,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:58:08,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:08,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:58:08,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:08,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:58:08,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:08,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:58:08,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:08,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:58:08,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:09,002 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:58:09,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:58:09,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351768801] [2024-10-24 11:58:09,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351768801] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:58:09,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:58:09,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:58:09,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211466923] [2024-10-24 11:58:09,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:58:09,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:58:09,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:58:09,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:58:09,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:58:09,006 INFO L87 Difference]: Start difference. First operand 245 states and 370 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:58:09,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:58:09,258 INFO L93 Difference]: Finished difference Result 435 states and 655 transitions. [2024-10-24 11:58:09,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:58:09,259 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2024-10-24 11:58:09,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:58:09,261 INFO L225 Difference]: With dead ends: 435 [2024-10-24 11:58:09,261 INFO L226 Difference]: Without dead ends: 300 [2024-10-24 11:58:09,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:58:09,263 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 236 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:58:09,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 539 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:58:09,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-10-24 11:58:09,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 217. [2024-10-24 11:58:09,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 192 states have (on average 1.4583333333333333) internal successors, (280), 192 states have internal predecessors, (280), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 11:58:09,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 324 transitions. [2024-10-24 11:58:09,279 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 324 transitions. Word has length 107 [2024-10-24 11:58:09,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:58:09,279 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 324 transitions. [2024-10-24 11:58:09,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:58:09,280 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 324 transitions. [2024-10-24 11:58:09,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-24 11:58:09,281 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:58:09,281 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:09,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 11:58:09,282 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:58:09,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:58:09,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1801592309, now seen corresponding path program 1 times [2024-10-24 11:58:09,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:58:09,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657381662] [2024-10-24 11:58:09,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:58:09,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:58:09,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:09,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:58:09,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:09,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 11:58:09,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:09,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:58:09,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:09,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:58:09,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:09,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:58:09,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:09,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:58:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:09,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:58:09,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:09,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:58:09,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:09,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:58:09,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:09,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:58:09,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:09,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:58:09,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:09,480 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:58:09,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:58:09,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657381662] [2024-10-24 11:58:09,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657381662] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:58:09,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:58:09,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:58:09,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716095142] [2024-10-24 11:58:09,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:58:09,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:58:09,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:58:09,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:58:09,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:58:09,483 INFO L87 Difference]: Start difference. First operand 217 states and 324 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:58:09,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:58:09,525 INFO L93 Difference]: Finished difference Result 341 states and 509 transitions. [2024-10-24 11:58:09,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:58:09,526 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2024-10-24 11:58:09,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:58:09,528 INFO L225 Difference]: With dead ends: 341 [2024-10-24 11:58:09,528 INFO L226 Difference]: Without dead ends: 220 [2024-10-24 11:58:09,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:58:09,529 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:58:09,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 649 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:58:09,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-10-24 11:58:09,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2024-10-24 11:58:09,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 195 states have (on average 1.4512820512820512) internal successors, (283), 195 states have internal predecessors, (283), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 11:58:09,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 327 transitions. [2024-10-24 11:58:09,544 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 327 transitions. Word has length 109 [2024-10-24 11:58:09,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:58:09,544 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 327 transitions. [2024-10-24 11:58:09,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:58:09,545 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 327 transitions. [2024-10-24 11:58:09,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-24 11:58:09,546 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:58:09,546 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:09,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 11:58:09,546 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:58:09,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:58:09,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1367347352, now seen corresponding path program 1 times [2024-10-24 11:58:09,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:58:09,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574440640] [2024-10-24 11:58:09,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:58:09,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:58:09,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:09,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:58:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:09,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 11:58:09,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:09,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:58:09,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:09,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:58:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:09,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:58:09,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:10,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:58:10,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:10,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:58:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:10,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:58:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:10,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:58:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:10,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:58:10,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:10,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:58:10,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:10,024 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:58:10,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:58:10,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574440640] [2024-10-24 11:58:10,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574440640] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:58:10,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:58:10,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:58:10,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657057812] [2024-10-24 11:58:10,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:58:10,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:58:10,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:58:10,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:58:10,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:58:10,027 INFO L87 Difference]: Start difference. First operand 220 states and 327 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:58:10,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:58:10,278 INFO L93 Difference]: Finished difference Result 401 states and 594 transitions. [2024-10-24 11:58:10,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:58:10,278 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2024-10-24 11:58:10,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:58:10,280 INFO L225 Difference]: With dead ends: 401 [2024-10-24 11:58:10,280 INFO L226 Difference]: Without dead ends: 268 [2024-10-24 11:58:10,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:58:10,282 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 214 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:58:10,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 524 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:58:10,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-10-24 11:58:10,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 230. [2024-10-24 11:58:10,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 205 states have (on average 1.448780487804878) internal successors, (297), 205 states have internal predecessors, (297), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 11:58:10,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 341 transitions. [2024-10-24 11:58:10,300 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 341 transitions. Word has length 109 [2024-10-24 11:58:10,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:58:10,300 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 341 transitions. [2024-10-24 11:58:10,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:58:10,301 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 341 transitions. [2024-10-24 11:58:10,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-24 11:58:10,302 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:58:10,302 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:10,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 11:58:10,302 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:58:10,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:58:10,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1061964343, now seen corresponding path program 1 times [2024-10-24 11:58:10,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:58:10,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966454835] [2024-10-24 11:58:10,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:58:10,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:58:10,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:10,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:58:10,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:10,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 11:58:10,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:10,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:58:10,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:10,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:58:10,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:10,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:58:10,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:10,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:58:10,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:10,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:58:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:10,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:58:10,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:10,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:58:10,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:10,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:58:10,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:10,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:58:10,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:10,789 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:58:10,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:58:10,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966454835] [2024-10-24 11:58:10,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966454835] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:58:10,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:58:10,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:58:10,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579617085] [2024-10-24 11:58:10,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:58:10,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:58:10,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:58:10,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:58:10,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:58:10,791 INFO L87 Difference]: Start difference. First operand 230 states and 341 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:58:11,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:58:11,094 INFO L93 Difference]: Finished difference Result 424 states and 622 transitions. [2024-10-24 11:58:11,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:58:11,095 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2024-10-24 11:58:11,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:58:11,097 INFO L225 Difference]: With dead ends: 424 [2024-10-24 11:58:11,097 INFO L226 Difference]: Without dead ends: 290 [2024-10-24 11:58:11,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:58:11,098 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 196 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:58:11,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 651 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:58:11,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-10-24 11:58:11,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 234. [2024-10-24 11:58:11,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 209 states have (on average 1.4401913875598087) internal successors, (301), 209 states have internal predecessors, (301), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 11:58:11,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 345 transitions. [2024-10-24 11:58:11,115 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 345 transitions. Word has length 109 [2024-10-24 11:58:11,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:58:11,115 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 345 transitions. [2024-10-24 11:58:11,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:58:11,115 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 345 transitions. [2024-10-24 11:58:11,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-24 11:58:11,117 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:58:11,117 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:11,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 11:58:11,117 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:58:11,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:58:11,118 INFO L85 PathProgramCache]: Analyzing trace with hash -360899765, now seen corresponding path program 1 times [2024-10-24 11:58:11,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:58:11,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054901320] [2024-10-24 11:58:11,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:58:11,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:58:11,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:58:11,190 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:58:11,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:58:11,293 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:58:11,293 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:58:11,295 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:58:11,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 11:58:11,300 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:58:11,429 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:58:11,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:58:11 BoogieIcfgContainer [2024-10-24 11:58:11,433 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:58:11,433 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:58:11,434 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:58:11,434 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:58:11,434 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:58:04" (3/4) ... [2024-10-24 11:58:11,436 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:58:11,437 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:58:11,438 INFO L158 Benchmark]: Toolchain (without parser) took 8687.46ms. Allocated memory was 148.9MB in the beginning and 285.2MB in the end (delta: 136.3MB). Free memory was 99.9MB in the beginning and 206.3MB in the end (delta: -106.4MB). Peak memory consumption was 31.2MB. Max. memory is 16.1GB. [2024-10-24 11:58:11,438 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 148.9MB. Free memory is still 113.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:58:11,438 INFO L158 Benchmark]: CACSL2BoogieTranslator took 415.99ms. Allocated memory is still 148.9MB. Free memory was 99.9MB in the beginning and 82.7MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 11:58:11,439 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.66ms. Allocated memory is still 148.9MB. Free memory was 82.7MB in the beginning and 79.0MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:58:11,439 INFO L158 Benchmark]: Boogie Preprocessor took 106.23ms. Allocated memory is still 148.9MB. Free memory was 79.0MB in the beginning and 74.1MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:58:11,439 INFO L158 Benchmark]: RCFGBuilder took 967.02ms. Allocated memory was 148.9MB in the beginning and 197.1MB in the end (delta: 48.2MB). Free memory was 74.1MB in the beginning and 159.8MB in the end (delta: -85.7MB). Peak memory consumption was 49.5MB. Max. memory is 16.1GB. [2024-10-24 11:58:11,440 INFO L158 Benchmark]: TraceAbstraction took 7108.05ms. Allocated memory was 197.1MB in the beginning and 285.2MB in the end (delta: 88.1MB). Free memory was 158.7MB in the beginning and 206.3MB in the end (delta: -47.6MB). Peak memory consumption was 40.4MB. Max. memory is 16.1GB. [2024-10-24 11:58:11,440 INFO L158 Benchmark]: Witness Printer took 3.98ms. Allocated memory is still 285.2MB. Free memory is still 206.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:58:11,442 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.29ms. Allocated memory is still 148.9MB. Free memory is still 113.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 415.99ms. Allocated memory is still 148.9MB. Free memory was 99.9MB in the beginning and 82.7MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.66ms. Allocated memory is still 148.9MB. Free memory was 82.7MB in the beginning and 79.0MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 106.23ms. Allocated memory is still 148.9MB. Free memory was 79.0MB in the beginning and 74.1MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 967.02ms. Allocated memory was 148.9MB in the beginning and 197.1MB in the end (delta: 48.2MB). Free memory was 74.1MB in the beginning and 159.8MB in the end (delta: -85.7MB). Peak memory consumption was 49.5MB. Max. memory is 16.1GB. * TraceAbstraction took 7108.05ms. Allocated memory was 197.1MB in the beginning and 285.2MB in the end (delta: 88.1MB). Free memory was 158.7MB in the beginning and 206.3MB in the end (delta: -47.6MB). Peak memory consumption was 40.4MB. Max. memory is 16.1GB. * Witness Printer took 3.98ms. Allocated memory is still 285.2MB. Free memory is still 206.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 79, overapproximation of someBinaryDOUBLEComparisonOperation at line 124, overapproximation of shiftRight at line 67. Possible FailurePath: [L36] unsigned char isInitial = 0; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L51] unsigned long int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L52] float* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L53] unsigned char* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L54] float* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L55] unsigned char* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L56] unsigned char* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L57] double* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L58] double* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L59] double* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L60] double* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L61] unsigned char* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L62] unsigned char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L63] unsigned char last_1_WrapperStruct00_var_1_14 = 1; [L128] isInitial = 1 [L129] FCALL initially() [L130] COND TRUE 1 [L131] CALL updateLastVariables() [L121] EXPR WrapperStruct00.var_1_14 [L121] last_1_WrapperStruct00_var_1_14 = WrapperStruct00.var_1_14 [L131] RET updateLastVariables() [L132] CALL updateVariables() [L100] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L101] EXPR WrapperStruct00.var_1_3 [L101] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L101] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L101] EXPR WrapperStruct00.var_1_3 [L101] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L101] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L101] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L101] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L101] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L102] WrapperStruct00.var_1_4 = __VERIFIER_nondet_uchar() [L103] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L104] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L105] WrapperStruct00.var_1_5 = __VERIFIER_nondet_float() [L106] EXPR WrapperStruct00.var_1_5 [L106] EXPR WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L106] EXPR WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F [L106] EXPR WrapperStruct00.var_1_5 [L106] EXPR WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L106] EXPR (WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L106] EXPR (WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L106] CALL assume_abort_if_not((WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L106] RET assume_abort_if_not((WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L107] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L108] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L109] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L110] WrapperStruct00.var_1_11 = __VERIFIER_nondet_double() [L111] EXPR WrapperStruct00.var_1_11 [L111] EXPR WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L111] EXPR WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F [L111] EXPR WrapperStruct00.var_1_11 [L111] EXPR WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L111] EXPR (WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L111] EXPR (WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L111] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L111] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L112] WrapperStruct00.var_1_12 = __VERIFIER_nondet_double() [L113] EXPR WrapperStruct00.var_1_12 [L113] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L113] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F [L113] EXPR WrapperStruct00.var_1_12 [L113] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L113] EXPR (WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L113] EXPR (WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L113] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L113] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L114] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L115] EXPR WrapperStruct00.var_1_13 [L115] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L115] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L115] EXPR WrapperStruct00.var_1_13 [L115] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L115] EXPR (WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L115] EXPR (WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L115] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L115] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L116] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L117] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L118] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L132] RET updateVariables() [L133] CALL step() [L67] EXPR last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L67] COND FALSE !((last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14) < (- last_1_WrapperStruct00_var_1_14)) [L70] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L70] EXPR \read(*WrapperStruct00_var_1_12_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L70] COND FALSE !((*(WrapperStruct00_var_1_13_Pointer)) == (- (*(WrapperStruct00_var_1_12_Pointer)))) [L77] (*(WrapperStruct00_var_1_14_Pointer)) = 0 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L79] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L79] EXPR \read(*WrapperStruct00_var_1_3_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L79] COND TRUE (*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_3_Pointer)) [L80] (*(WrapperStruct00_var_1_10_Pointer)) = 4.6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L84] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L84] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L84] unsigned char stepLocal_0 = (*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_10_Pointer)); [L85] stepLocal_0 && (*(WrapperStruct00_var_1_7_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L85] stepLocal_0 && (*(WrapperStruct00_var_1_7_Pointer)) [L85] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L85] stepLocal_0 && (*(WrapperStruct00_var_1_7_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L85] COND TRUE stepLocal_0 && (*(WrapperStruct00_var_1_7_Pointer)) [L86] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L86] EXPR \read(*WrapperStruct00_var_1_10_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L86] EXPR (((*(WrapperStruct00_var_1_10_Pointer))) > ((- (*(WrapperStruct00_var_1_10_Pointer))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((- (*(WrapperStruct00_var_1_10_Pointer)))) [L86] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L86] EXPR (((*(WrapperStruct00_var_1_10_Pointer))) > ((- (*(WrapperStruct00_var_1_10_Pointer))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((- (*(WrapperStruct00_var_1_10_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L86] EXPR \read(*WrapperStruct00_var_1_10_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L86] COND TRUE (((((*(WrapperStruct00_var_1_10_Pointer))) > ((- (*(WrapperStruct00_var_1_10_Pointer))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((- (*(WrapperStruct00_var_1_10_Pointer)))))) != (*(WrapperStruct00_var_1_10_Pointer)) [L87] EXPR \read(*WrapperStruct00_var_1_7_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L87] COND TRUE (*(WrapperStruct00_var_1_7_Pointer)) [L88] (*(WrapperStruct00_var_1_1_Pointer)) = 10u VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L133] RET step() [L134] CALL, EXPR property() [L124] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L124] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L124] EXPR ((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_10_Pointer))) && (*(WrapperStruct00_var_1_7_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L124] EXPR ((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_10_Pointer))) && (*(WrapperStruct00_var_1_7_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L124] EXPR (((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_10_Pointer))) && (*(WrapperStruct00_var_1_7_Pointer))) ? (((((((*(WrapperStruct00_var_1_10_Pointer))) > ((- (*(WrapperStruct00_var_1_10_Pointer))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((- (*(WrapperStruct00_var_1_10_Pointer)))))) != (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) 10u)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer)))) [L124] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L124] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L124] EXPR (((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_10_Pointer))) && (*(WrapperStruct00_var_1_7_Pointer))) ? (((((((*(WrapperStruct00_var_1_10_Pointer))) > ((- (*(WrapperStruct00_var_1_10_Pointer))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((- (*(WrapperStruct00_var_1_10_Pointer)))))) != (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) 10u)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L124] EXPR ((((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_10_Pointer))) && (*(WrapperStruct00_var_1_7_Pointer))) ? (((((((*(WrapperStruct00_var_1_10_Pointer))) > ((- (*(WrapperStruct00_var_1_10_Pointer))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((- (*(WrapperStruct00_var_1_10_Pointer)))))) != (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) 10u)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) && (((last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14) < (- last_1_WrapperStruct00_var_1_14)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L124] EXPR ((((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_10_Pointer))) && (*(WrapperStruct00_var_1_7_Pointer))) ? (((((((*(WrapperStruct00_var_1_10_Pointer))) > ((- (*(WrapperStruct00_var_1_10_Pointer))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((- (*(WrapperStruct00_var_1_10_Pointer)))))) != (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) 10u)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) && (((last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14) < (- last_1_WrapperStruct00_var_1_14)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L124] EXPR (((((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_10_Pointer))) && (*(WrapperStruct00_var_1_7_Pointer))) ? (((((((*(WrapperStruct00_var_1_10_Pointer))) > ((- (*(WrapperStruct00_var_1_10_Pointer))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((- (*(WrapperStruct00_var_1_10_Pointer)))))) != (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) 10u)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) && (((last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14) < (- last_1_WrapperStruct00_var_1_14)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))) : 1)) && (((*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((double) 4.6)) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_11_Pointer))) > ((((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L124] EXPR (((((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_10_Pointer))) && (*(WrapperStruct00_var_1_7_Pointer))) ? (((((((*(WrapperStruct00_var_1_10_Pointer))) > ((- (*(WrapperStruct00_var_1_10_Pointer))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((- (*(WrapperStruct00_var_1_10_Pointer)))))) != (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) 10u)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) && (((last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14) < (- last_1_WrapperStruct00_var_1_14)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))) : 1)) && (((*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((double) 4.6)) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_11_Pointer))) > ((((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L124] EXPR ((((((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_10_Pointer))) && (*(WrapperStruct00_var_1_7_Pointer))) ? (((((((*(WrapperStruct00_var_1_10_Pointer))) > ((- (*(WrapperStruct00_var_1_10_Pointer))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((- (*(WrapperStruct00_var_1_10_Pointer)))))) != (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) 10u)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) && (((last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14) < (- last_1_WrapperStruct00_var_1_14)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))) : 1)) && (((*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((double) 4.6)) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_11_Pointer))) > ((((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer)))))))))))) && (((*(WrapperStruct00_var_1_13_Pointer)) == (- (*(WrapperStruct00_var_1_12_Pointer)))) ? (((*(WrapperStruct00_var_1_7_Pointer)) && (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_14_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_14_Pointer)) == ((unsigned char) 0))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L124] EXPR ((((((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_10_Pointer))) && (*(WrapperStruct00_var_1_7_Pointer))) ? (((((((*(WrapperStruct00_var_1_10_Pointer))) > ((- (*(WrapperStruct00_var_1_10_Pointer))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((- (*(WrapperStruct00_var_1_10_Pointer)))))) != (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) 10u)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) && (((last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14) < (- last_1_WrapperStruct00_var_1_14)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))) : 1)) && (((*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((double) 4.6)) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_11_Pointer))) > ((((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer)))))))))))) && (((*(WrapperStruct00_var_1_13_Pointer)) == (- (*(WrapperStruct00_var_1_12_Pointer)))) ? (((*(WrapperStruct00_var_1_7_Pointer)) && (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_14_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_14_Pointer)) == ((unsigned char) 0))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L124-L125] return ((((((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_10_Pointer))) && (*(WrapperStruct00_var_1_7_Pointer))) ? (((((((*(WrapperStruct00_var_1_10_Pointer))) > ((- (*(WrapperStruct00_var_1_10_Pointer))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((- (*(WrapperStruct00_var_1_10_Pointer)))))) != (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) 10u)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) && (((last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14) < (- last_1_WrapperStruct00_var_1_14)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))) : 1)) && (((*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((double) 4.6)) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_11_Pointer))) > ((((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer)))))))))))) && (((*(WrapperStruct00_var_1_13_Pointer)) == (- (*(WrapperStruct00_var_1_12_Pointer)))) ? (((*(WrapperStruct00_var_1_7_Pointer)) && (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_14_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_14_Pointer)) == ((unsigned char) 0))) ; [L134] RET, EXPR property() [L134] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 116 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 10, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1144 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1144 mSDsluCounter, 4533 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3103 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1201 IncrementalHoareTripleChecker+Invalid, 1263 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 1430 mSDtfsCounter, 1201 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 266 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=245occurred in iteration=5, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 304 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 1067 NumberOfCodeBlocks, 1067 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 949 ConstructedInterpolants, 0 QuantifiedInterpolants, 3070 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 1980/1980 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:58:11,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-36.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 9e2d5d0417bcd19dd1bd5aa35ba5f9873fa877cfd261a114441164de37024a87 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:58:13,842 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:58:13,935 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:58:13,947 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:58:13,948 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:58:13,984 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:58:13,986 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:58:13,986 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:58:13,987 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:58:13,988 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:58:13,989 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:58:13,989 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:58:13,990 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:58:13,990 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:58:13,992 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:58:13,993 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:58:13,993 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:58:13,994 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:58:13,994 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:58:13,994 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:58:13,994 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:58:13,999 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:58:13,999 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:58:13,999 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:58:13,999 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:58:14,000 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:58:14,000 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:58:14,000 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:58:14,000 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:58:14,001 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:58:14,001 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:58:14,001 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:58:14,001 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:58:14,002 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:58:14,002 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:58:14,004 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:58:14,005 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:58:14,005 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:58:14,006 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:58:14,006 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:58:14,006 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:58:14,007 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:58:14,007 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:58:14,007 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:58:14,007 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:58:14,008 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 -> 9e2d5d0417bcd19dd1bd5aa35ba5f9873fa877cfd261a114441164de37024a87 [2024-10-24 11:58:14,352 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:58:14,379 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:58:14,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:58:14,384 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:58:14,385 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:58:14,387 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-36.i [2024-10-24 11:58:16,045 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:58:16,281 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:58:16,281 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-36.i [2024-10-24 11:58:16,297 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eacddec3/b5d2d11b2e6f4a9fb1b25120bda1aa9f/FLAGda2b1e060 [2024-10-24 11:58:16,643 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eacddec3/b5d2d11b2e6f4a9fb1b25120bda1aa9f [2024-10-24 11:58:16,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:58:16,647 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:58:16,648 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:58:16,648 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:58:16,654 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:58:16,655 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:58:16" (1/1) ... [2024-10-24 11:58:16,656 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@188852a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:58:16, skipping insertion in model container [2024-10-24 11:58:16,656 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:58:16" (1/1) ... [2024-10-24 11:58:16,688 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:58:16,909 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-36.i[917,930] [2024-10-24 11:58:17,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:58:17,056 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:58:17,068 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-36.i[917,930] [2024-10-24 11:58:17,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:58:17,161 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:58:17,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:58:17 WrapperNode [2024-10-24 11:58:17,162 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:58:17,163 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:58:17,164 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:58:17,164 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:58:17,171 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:58:17" (1/1) ... [2024-10-24 11:58:17,198 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:58:17" (1/1) ... [2024-10-24 11:58:17,250 INFO L138 Inliner]: procedures = 36, calls = 156, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 548 [2024-10-24 11:58:17,253 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:58:17,254 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:58:17,254 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:58:17,254 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:58:17,268 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:58:17" (1/1) ... [2024-10-24 11:58:17,268 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:58:17" (1/1) ... [2024-10-24 11:58:17,281 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:58:17" (1/1) ... [2024-10-24 11:58:17,313 INFO L175 MemorySlicer]: Split 133 memory accesses to 2 slices as follows [2, 131]. 98 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 12]. The 18 writes are split as follows [0, 18]. [2024-10-24 11:58:17,313 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:58:17" (1/1) ... [2024-10-24 11:58:17,313 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:58:17" (1/1) ... [2024-10-24 11:58:17,344 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:58:17" (1/1) ... [2024-10-24 11:58:17,352 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:58:17" (1/1) ... [2024-10-24 11:58:17,357 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:58:17" (1/1) ... [2024-10-24 11:58:17,365 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:58:17" (1/1) ... [2024-10-24 11:58:17,375 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:58:17,377 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:58:17,378 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:58:17,378 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:58:17,379 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:58:17" (1/1) ... [2024-10-24 11:58:17,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:58:17,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:58:17,419 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:58:17,425 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:58:17,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:58:17,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-24 11:58:17,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-24 11:58:17,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-24 11:58:17,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-24 11:58:17,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 11:58:17,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 11:58:17,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:58:17,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 11:58:17,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-24 11:58:17,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-24 11:58:17,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-24 11:58:17,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-24 11:58:17,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-24 11:58:17,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-24 11:58:17,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 11:58:17,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 11:58:17,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-24 11:58:17,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-24 11:58:17,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-24 11:58:17,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-24 11:58:17,471 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:58:17,472 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:58:17,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:58:17,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:58:17,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-24 11:58:17,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-24 11:58:17,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 11:58:17,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 11:58:17,621 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:58:17,623 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:58:18,614 INFO L? ?]: Removed 149 outVars from TransFormulas that were not future-live. [2024-10-24 11:58:18,614 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:58:18,664 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:58:18,664 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:58:18,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:58:18 BoogieIcfgContainer [2024-10-24 11:58:18,665 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:58:18,667 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:58:18,667 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:58:18,671 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:58:18,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:58:16" (1/3) ... [2024-10-24 11:58:18,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69ba86c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:58:18, skipping insertion in model container [2024-10-24 11:58:18,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:58:17" (2/3) ... [2024-10-24 11:58:18,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69ba86c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:58:18, skipping insertion in model container [2024-10-24 11:58:18,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:58:18" (3/3) ... [2024-10-24 11:58:18,675 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-36.i [2024-10-24 11:58:18,693 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:58:18,694 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:58:18,774 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:58:18,783 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;@9a4d8ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:58:18,784 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:58:18,789 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 98 states have (on average 1.5204081632653061) internal successors, (149), 99 states have internal predecessors, (149), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:58:18,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 11:58:18,805 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:58:18,806 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:18,807 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:58:18,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:58:18,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1285315588, now seen corresponding path program 1 times [2024-10-24 11:58:18,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:58:18,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [249966194] [2024-10-24 11:58:18,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:58:18,834 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:58:18,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:58:18,837 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:58:18,854 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:58:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:19,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:58:19,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:58:19,256 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-24 11:58:19,257 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:58:19,257 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:58:19,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [249966194] [2024-10-24 11:58:19,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [249966194] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:58:19,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:58:19,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:58:19,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74426850] [2024-10-24 11:58:19,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:58:19,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:58:19,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:58:19,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:58:19,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:58:19,292 INFO L87 Difference]: Start difference. First operand has 112 states, 98 states have (on average 1.5204081632653061) internal successors, (149), 99 states have internal predecessors, (149), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:58:19,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:58:19,341 INFO L93 Difference]: Finished difference Result 217 states and 345 transitions. [2024-10-24 11:58:19,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:58:19,344 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2024-10-24 11:58:19,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:58:19,354 INFO L225 Difference]: With dead ends: 217 [2024-10-24 11:58:19,354 INFO L226 Difference]: Without dead ends: 106 [2024-10-24 11:58:19,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 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:58:19,363 INFO L432 NwaCegarLoop]: 154 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, 154 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:58:19,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:58:19,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-24 11:58:19,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-10-24 11:58:19,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 93 states have internal predecessors, (136), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:58:19,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 158 transitions. [2024-10-24 11:58:19,409 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 158 transitions. Word has length 103 [2024-10-24 11:58:19,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:58:19,410 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 158 transitions. [2024-10-24 11:58:19,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:58:19,410 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 158 transitions. [2024-10-24 11:58:19,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 11:58:19,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:58:19,414 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:19,423 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:58:19,615 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:58:19,616 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:58:19,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:58:19,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1980611650, now seen corresponding path program 1 times [2024-10-24 11:58:19,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:58:19,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [76260006] [2024-10-24 11:58:19,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:58:19,618 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:58:19,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:58:19,622 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:58:19,623 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:58:19,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:19,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:58:19,954 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:58:20,006 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-24 11:58:20,010 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:58:20,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:58:20,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [76260006] [2024-10-24 11:58:20,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [76260006] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:58:20,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:58:20,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:58:20,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954468995] [2024-10-24 11:58:20,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:58:20,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:58:20,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:58:20,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:58:20,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:58:20,016 INFO L87 Difference]: Start difference. First operand 106 states and 158 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:58:20,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:58:20,117 INFO L93 Difference]: Finished difference Result 213 states and 318 transitions. [2024-10-24 11:58:20,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:58:20,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2024-10-24 11:58:20,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:58:20,119 INFO L225 Difference]: With dead ends: 213 [2024-10-24 11:58:20,119 INFO L226 Difference]: Without dead ends: 108 [2024-10-24 11:58:20,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 100 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:58:20,121 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 449 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.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:58:20,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 449 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:58:20,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-24 11:58:20,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-10-24 11:58:20,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 95 states have (on average 1.4526315789473685) internal successors, (138), 95 states have internal predecessors, (138), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:58:20,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 160 transitions. [2024-10-24 11:58:20,132 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 160 transitions. Word has length 103 [2024-10-24 11:58:20,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:58:20,133 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 160 transitions. [2024-10-24 11:58:20,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:58:20,134 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 160 transitions. [2024-10-24 11:58:20,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 11:58:20,136 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:58:20,136 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:20,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 11:58:20,336 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:58:20,337 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:58:20,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:58:20,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1753655868, now seen corresponding path program 1 times [2024-10-24 11:58:20,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:58:20,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1648893456] [2024-10-24 11:58:20,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:58:20,340 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:58:20,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:58:20,343 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:58:20,344 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:58:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:20,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:58:20,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:58:20,859 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:58:20,861 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 184 treesize of output 64 [2024-10-24 11:58:20,891 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:58:20,892 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:58:20,892 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:58:20,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1648893456] [2024-10-24 11:58:20,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1648893456] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:58:20,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:58:20,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:58:20,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846298039] [2024-10-24 11:58:20,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:58:20,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:58:20,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:58:20,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:58:20,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:58:20,896 INFO L87 Difference]: Start difference. First operand 108 states and 160 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:58:20,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:58:20,953 INFO L93 Difference]: Finished difference Result 211 states and 312 transitions. [2024-10-24 11:58:20,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:58:20,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-10-24 11:58:20,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:58:20,955 INFO L225 Difference]: With dead ends: 211 [2024-10-24 11:58:20,955 INFO L226 Difference]: Without dead ends: 104 [2024-10-24 11:58:20,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:58:20,956 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 1 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:58:20,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 284 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:58:20,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-24 11:58:20,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-10-24 11:58:20,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 91 states have internal predecessors, (129), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:58:20,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 151 transitions. [2024-10-24 11:58:20,975 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 151 transitions. Word has length 103 [2024-10-24 11:58:20,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:58:20,976 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 151 transitions. [2024-10-24 11:58:20,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:58:20,977 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 151 transitions. [2024-10-24 11:58:20,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 11:58:20,978 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:58:20,979 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:20,990 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:58:21,182 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:58:21,182 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:58:21,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:58:21,183 INFO L85 PathProgramCache]: Analyzing trace with hash 742538618, now seen corresponding path program 1 times [2024-10-24 11:58:21,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:58:21,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [147695206] [2024-10-24 11:58:21,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:58:21,184 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:58:21,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:58:21,188 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:58:21,193 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:58:21,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:21,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 11:58:21,505 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:58:21,531 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:58:21,534 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:58:21,535 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:58:21,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [147695206] [2024-10-24 11:58:21,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [147695206] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:58:21,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:58:21,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:58:21,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547117530] [2024-10-24 11:58:21,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:58:21,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:58:21,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:58:21,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:58:21,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:58:21,539 INFO L87 Difference]: Start difference. First operand 104 states and 151 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:58:21,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:58:21,580 INFO L93 Difference]: Finished difference Result 201 states and 292 transitions. [2024-10-24 11:58:21,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:58:21,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-10-24 11:58:21,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:58:21,584 INFO L225 Difference]: With dead ends: 201 [2024-10-24 11:58:21,585 INFO L226 Difference]: Without dead ends: 98 [2024-10-24 11:58:21,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:58:21,586 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 1 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:58:21,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 263 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:58:21,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-24 11:58:21,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-10-24 11:58:21,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 85 states have (on average 1.388235294117647) internal successors, (118), 85 states have internal predecessors, (118), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:58:21,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2024-10-24 11:58:21,605 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 103 [2024-10-24 11:58:21,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:58:21,606 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2024-10-24 11:58:21,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:58:21,607 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2024-10-24 11:58:21,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 11:58:21,612 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:58:21,613 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:21,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-24 11:58:21,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:58:21,813 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:58:21,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:58:21,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1443603196, now seen corresponding path program 1 times [2024-10-24 11:58:21,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:58:21,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [75252470] [2024-10-24 11:58:21,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:58:21,815 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:58:21,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:58:21,818 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:58:21,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-24 11:58:22,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:58:22,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-24 11:58:22,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:58:23,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-10-24 11:58:23,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2024-10-24 11:58:26,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2024-10-24 11:58:26,544 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:58:26,544 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:58:26,545 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:58:26,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [75252470] [2024-10-24 11:58:26,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [75252470] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:58:26,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:58:26,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:58:26,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456522542] [2024-10-24 11:58:26,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:58:26,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:58:26,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:58:26,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:58:26,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=40, Unknown=1, NotChecked=0, Total=56 [2024-10-24 11:58:26,550 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:58:30,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:58:33,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:58:37,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.90s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:58:41,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.82s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:58:45,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.81s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:58:47,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:58:51,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.84s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:58:55,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.71s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:58:59,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.98s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:59:03,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:59:03,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:59:03,966 INFO L93 Difference]: Finished difference Result 234 states and 332 transitions. [2024-10-24 11:59:03,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:59:03,968 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-10-24 11:59:03,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:59:03,969 INFO L225 Difference]: With dead ends: 234 [2024-10-24 11:59:03,969 INFO L226 Difference]: Without dead ends: 137 [2024-10-24 11:59:03,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=45, Invalid=86, Unknown=1, NotChecked=0, Total=132 [2024-10-24 11:59:03,971 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 164 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 4 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 37.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:59:03,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 453 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 379 Invalid, 10 Unknown, 0 Unchecked, 37.2s Time] [2024-10-24 11:59:03,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-24 11:59:03,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 113. [2024-10-24 11:59:03,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 100 states have (on average 1.37) internal successors, (137), 100 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:59:03,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 159 transitions. [2024-10-24 11:59:03,993 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 159 transitions. Word has length 103 [2024-10-24 11:59:03,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:59:03,993 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 159 transitions. [2024-10-24 11:59:03,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:59:03,994 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 159 transitions. [2024-10-24 11:59:03,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 11:59:03,995 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:59:03,996 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:04,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-24 11:59:04,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:59:04,197 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:59:04,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:59:04,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1866540490, now seen corresponding path program 1 times [2024-10-24 11:59:04,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:59:04,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1120049425] [2024-10-24 11:59:04,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:59:04,198 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:59:04,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:59:04,199 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:59:04,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-24 11:59:04,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:59:04,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 11:59:04,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:59:04,501 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:59:04,501 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:59:04,502 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:59:04,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1120049425] [2024-10-24 11:59:04,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1120049425] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:59:04,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:59:04,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:59:04,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740441206] [2024-10-24 11:59:04,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:59:04,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:59:04,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:59:04,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:59:04,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:59:04,507 INFO L87 Difference]: Start difference. First operand 113 states and 159 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:59:04,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:59:04,573 INFO L93 Difference]: Finished difference Result 227 states and 320 transitions. [2024-10-24 11:59:04,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:59:04,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-10-24 11:59:04,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:59:04,576 INFO L225 Difference]: With dead ends: 227 [2024-10-24 11:59:04,576 INFO L226 Difference]: Without dead ends: 115 [2024-10-24 11:59:04,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:59:04,578 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:59:04,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 514 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:59:04,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-24 11:59:04,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-10-24 11:59:04,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 102 states have (on average 1.3627450980392157) internal successors, (139), 102 states have internal predecessors, (139), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:59:04,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 161 transitions. [2024-10-24 11:59:04,592 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 161 transitions. Word has length 105 [2024-10-24 11:59:04,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:59:04,593 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 161 transitions. [2024-10-24 11:59:04,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:59:04,594 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 161 transitions. [2024-10-24 11:59:04,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 11:59:04,595 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:59:04,595 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:04,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-24 11:59:04,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:59:04,796 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:59:04,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:59:04,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1008789156, now seen corresponding path program 1 times [2024-10-24 11:59:04,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:59:04,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1324407336] [2024-10-24 11:59:04,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:59:04,797 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:59:04,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:59:04,799 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:59:04,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-24 11:59:05,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:59:05,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 11:59:05,172 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:59:05,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2024-10-24 11:59:05,939 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:59:05,939 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:59:05,940 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:59:05,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1324407336] [2024-10-24 11:59:05,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1324407336] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:59:05,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:59:05,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:59:05,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827506463] [2024-10-24 11:59:05,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:59:05,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:59:05,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:59:05,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:59:05,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:59:05,942 INFO L87 Difference]: Start difference. First operand 115 states and 161 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:59:07,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:59:07,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:59:07,748 INFO L93 Difference]: Finished difference Result 227 states and 318 transitions. [2024-10-24 11:59:07,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:59:07,752 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-10-24 11:59:07,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:59:07,754 INFO L225 Difference]: With dead ends: 227 [2024-10-24 11:59:07,755 INFO L226 Difference]: Without dead ends: 113 [2024-10-24 11:59:07,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:59:07,756 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 105 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-24 11:59:07,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 357 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-24 11:59:07,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-24 11:59:07,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 98. [2024-10-24 11:59:07,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 85 states have (on average 1.3647058823529412) internal successors, (116), 85 states have internal predecessors, (116), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:59:07,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 138 transitions. [2024-10-24 11:59:07,776 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 138 transitions. Word has length 105 [2024-10-24 11:59:07,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:59:07,776 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 138 transitions. [2024-10-24 11:59:07,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:59:07,777 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 138 transitions. [2024-10-24 11:59:07,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 11:59:07,782 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:59:07,782 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:07,800 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 (8)] Forceful destruction successful, exit code 0 [2024-10-24 11:59:07,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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:59:07,983 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:59:07,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:59:07,984 INFO L85 PathProgramCache]: Analyzing trace with hash -529087121, now seen corresponding path program 1 times [2024-10-24 11:59:07,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:59:07,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [924098771] [2024-10-24 11:59:07,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:59:07,985 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:59:07,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:59:07,986 INFO L229 MonitoredProcess]: Starting monitored process 9 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:59:07,987 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 (9)] Waiting until timeout for monitored process [2024-10-24 11:59:08,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:59:08,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-24 11:59:08,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:59:09,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 11:59:09,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-10-24 11:59:09,540 INFO L349 Elim1Store]: treesize reduction 31, result has 26.2 percent of original size [2024-10-24 11:59:09,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 43 [2024-10-24 11:59:09,800 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:59:09,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 58 [2024-10-24 11:59:09,835 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:59:09,835 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:59:09,835 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:59:09,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [924098771] [2024-10-24 11:59:09,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [924098771] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:59:09,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:59:09,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:59:09,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661896799] [2024-10-24 11:59:09,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:59:09,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:59:09,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:59:09,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:59:09,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:59:09,837 INFO L87 Difference]: Start difference. First operand 98 states and 138 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:59:11,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:59:11,363 INFO L93 Difference]: Finished difference Result 230 states and 319 transitions. [2024-10-24 11:59:11,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:59:11,364 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2024-10-24 11:59:11,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:59:11,365 INFO L225 Difference]: With dead ends: 230 [2024-10-24 11:59:11,365 INFO L226 Difference]: Without dead ends: 133 [2024-10-24 11:59:11,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:59:11,366 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 187 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:59:11,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 444 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 11:59:11,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-24 11:59:11,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 114. [2024-10-24 11:59:11,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 101 states have (on average 1.316831683168317) internal successors, (133), 101 states have internal predecessors, (133), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:59:11,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 155 transitions. [2024-10-24 11:59:11,381 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 155 transitions. Word has length 107 [2024-10-24 11:59:11,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:59:11,381 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 155 transitions. [2024-10-24 11:59:11,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:59:11,382 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 155 transitions. [2024-10-24 11:59:11,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-24 11:59:11,382 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:59:11,383 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:11,397 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 (9)] Ended with exit code 0 [2024-10-24 11:59:11,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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:59:11,584 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:59:11,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:59:11,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1972146531, now seen corresponding path program 1 times [2024-10-24 11:59:11,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:59:11,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [877019868] [2024-10-24 11:59:11,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:59:11,585 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:59:11,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:59:11,589 INFO L229 MonitoredProcess]: Starting monitored process 10 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:59:11,590 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 (10)] Waiting until timeout for monitored process [2024-10-24 11:59:12,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:59:12,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-24 11:59:12,045 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:59:13,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-10-24 11:59:13,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2024-10-24 11:59:15,885 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:59:15,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 32 [2024-10-24 11:59:16,076 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:59:16,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 35 [2024-10-24 11:59:16,115 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:59:16,115 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:59:16,115 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:59:16,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [877019868] [2024-10-24 11:59:16,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [877019868] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:59:16,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:59:16,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:59:16,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60438439] [2024-10-24 11:59:16,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:59:16,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:59:16,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:59:16,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:59:16,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=55, Unknown=1, NotChecked=0, Total=72 [2024-10-24 11:59:16,118 INFO L87 Difference]: Start difference. First operand 114 states and 155 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:59:19,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:59:22,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.89s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:59:26,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.68s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:59:29,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]