./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-67.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-67.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2bfc3a2327f8b20a29fd925460a8337c18b9a784fffca7c1ea577a58172303bb --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 14:02:25,643 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:02:25,710 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 14:02:25,714 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:02:25,715 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:02:25,742 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:02:25,743 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:02:25,743 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:02:25,744 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:02:25,748 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:02:25,748 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:02:25,749 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:02:25,749 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:02:25,749 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:02:25,750 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:02:25,750 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:02:25,750 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:02:25,750 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 14:02:25,751 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 14:02:25,751 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 14:02:25,753 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:02:25,753 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:02:25,754 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:02:25,755 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:02:25,755 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:02:25,755 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 14:02:25,756 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:02:25,756 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:02:25,756 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:02:25,757 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:02:25,757 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:02:25,757 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:02:25,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:02:25,758 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:02:25,759 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:02:25,759 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:02:25,759 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 14:02:25,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 14:02:25,760 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:02:25,760 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:02:25,760 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:02:25,761 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:02:25,761 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2bfc3a2327f8b20a29fd925460a8337c18b9a784fffca7c1ea577a58172303bb [2024-10-11 14:02:26,022 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:02:26,048 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:02:26,052 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:02:26,054 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:02:26,054 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:02:26,055 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-67.i [2024-10-11 14:02:27,543 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:02:27,723 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:02:27,723 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-67.i [2024-10-11 14:02:27,734 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a96bf89e1/723a9f8fcedc4427871b5ef053fbde83/FLAG777c49cd8 [2024-10-11 14:02:27,756 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a96bf89e1/723a9f8fcedc4427871b5ef053fbde83 [2024-10-11 14:02:27,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:02:27,762 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:02:27,764 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:02:27,765 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:02:27,770 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:02:27,772 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:02:27" (1/1) ... [2024-10-11 14:02:27,773 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3668f5b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:27, skipping insertion in model container [2024-10-11 14:02:27,773 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:02:27" (1/1) ... [2024-10-11 14:02:27,803 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:02:27,986 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-67.i[917,930] [2024-10-11 14:02:28,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:02:28,080 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:02:28,095 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-67.i[917,930] [2024-10-11 14:02:28,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:02:28,253 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:02:28,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:28 WrapperNode [2024-10-11 14:02:28,258 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:02:28,259 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:02:28,259 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:02:28,259 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:02:28,268 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:28" (1/1) ... [2024-10-11 14:02:28,281 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:28" (1/1) ... [2024-10-11 14:02:28,323 INFO L138 Inliner]: procedures = 29, calls = 130, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 411 [2024-10-11 14:02:28,323 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:02:28,324 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:02:28,324 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:02:28,324 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:02:28,336 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:28" (1/1) ... [2024-10-11 14:02:28,337 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:28" (1/1) ... [2024-10-11 14:02:28,341 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:28" (1/1) ... [2024-10-11 14:02:28,361 INFO L175 MemorySlicer]: Split 106 memory accesses to 2 slices as follows [2, 104]. 98 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 12]. The 16 writes are split as follows [0, 16]. [2024-10-11 14:02:28,361 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:28" (1/1) ... [2024-10-11 14:02:28,361 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:28" (1/1) ... [2024-10-11 14:02:28,378 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:28" (1/1) ... [2024-10-11 14:02:28,385 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:28" (1/1) ... [2024-10-11 14:02:28,390 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:28" (1/1) ... [2024-10-11 14:02:28,392 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:28" (1/1) ... [2024-10-11 14:02:28,397 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:02:28,398 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:02:28,398 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:02:28,398 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:02:28,399 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:28" (1/1) ... [2024-10-11 14:02:28,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:02:28,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:02:28,432 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 14:02:28,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 14:02:28,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:02:28,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 14:02:28,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 14:02:28,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 14:02:28,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 14:02:28,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 14:02:28,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 14:02:28,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 14:02:28,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 14:02:28,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 14:02:28,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 14:02:28,475 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 14:02:28,475 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 14:02:28,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 14:02:28,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 14:02:28,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:02:28,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:02:28,587 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:02:28,588 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:02:29,054 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2024-10-11 14:02:29,055 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:02:29,101 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:02:29,102 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 14:02:29,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:02:29 BoogieIcfgContainer [2024-10-11 14:02:29,102 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:02:29,104 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:02:29,104 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:02:29,109 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:02:29,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:02:27" (1/3) ... [2024-10-11 14:02:29,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b7d9c55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:02:29, skipping insertion in model container [2024-10-11 14:02:29,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:28" (2/3) ... [2024-10-11 14:02:29,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b7d9c55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:02:29, skipping insertion in model container [2024-10-11 14:02:29,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:02:29" (3/3) ... [2024-10-11 14:02:29,112 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-67.i [2024-10-11 14:02:29,129 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:02:29,129 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 14:02:29,188 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:02:29,194 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;@5de0c6ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:02:29,194 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 14:02:29,198 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 72 states have internal predecessors, (102), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 14:02:29,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 14:02:29,206 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:02:29,207 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:02:29,208 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:02:29,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:02:29,212 INFO L85 PathProgramCache]: Analyzing trace with hash -317843377, now seen corresponding path program 1 times [2024-10-11 14:02:29,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:02:29,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803082921] [2024-10-11 14:02:29,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:02:29,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:02:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:29,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:02:29,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:29,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:02:29,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:29,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:02:29,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:29,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:02:29,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:29,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:02:29,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:29,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:02:29,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:29,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:02:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:29,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:02:29,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:29,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:02:29,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:29,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:02:29,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:29,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:02:29,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:29,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:02:29,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:29,633 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 14:02:29,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:02:29,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803082921] [2024-10-11 14:02:29,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803082921] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:02:29,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:02:29,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:02:29,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727207434] [2024-10-11 14:02:29,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:02:29,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 14:02:29,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:02:29,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 14:02:29,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 14:02:29,669 INFO L87 Difference]: Start difference. First operand has 86 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 72 states have internal predecessors, (102), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 14:02:29,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:02:29,715 INFO L93 Difference]: Finished difference Result 169 states and 262 transitions. [2024-10-11 14:02:29,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 14:02:29,718 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 99 [2024-10-11 14:02:29,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:02:29,744 INFO L225 Difference]: With dead ends: 169 [2024-10-11 14:02:29,744 INFO L226 Difference]: Without dead ends: 84 [2024-10-11 14:02:29,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 14:02:29,751 INFO L432 NwaCegarLoop]: 117 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, 117 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:02:29,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:02:29,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-11 14:02:29,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-11 14:02:29,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 70 states have internal predecessors, (97), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 14:02:29,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 121 transitions. [2024-10-11 14:02:29,821 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 121 transitions. Word has length 99 [2024-10-11 14:02:29,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:02:29,822 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 121 transitions. [2024-10-11 14:02:29,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 14:02:29,823 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 121 transitions. [2024-10-11 14:02:29,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 14:02:29,831 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:02:29,831 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:02:29,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 14:02:29,832 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:02:29,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:02:29,832 INFO L85 PathProgramCache]: Analyzing trace with hash -745607517, now seen corresponding path program 1 times [2024-10-11 14:02:29,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:02:29,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432436531] [2024-10-11 14:02:29,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:02:29,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:02:29,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:30,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:02:30,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:30,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:02:30,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:30,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:02:30,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:30,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:02:30,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:30,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:02:30,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:30,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:02:30,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:30,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:02:30,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:30,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:02:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:30,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:02:30,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:30,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:02:30,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:30,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:02:30,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:30,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:02:30,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:30,234 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 14:02:30,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:02:30,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432436531] [2024-10-11 14:02:30,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432436531] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:02:30,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:02:30,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:02:30,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007923046] [2024-10-11 14:02:30,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:02:30,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:02:30,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:02:30,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:02:30,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:02:30,243 INFO L87 Difference]: Start difference. First operand 84 states and 121 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:02:30,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:02:30,303 INFO L93 Difference]: Finished difference Result 170 states and 245 transitions. [2024-10-11 14:02:30,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:02:30,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 99 [2024-10-11 14:02:30,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:02:30,306 INFO L225 Difference]: With dead ends: 170 [2024-10-11 14:02:30,306 INFO L226 Difference]: Without dead ends: 87 [2024-10-11 14:02:30,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:02:30,309 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 1 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:02:30,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 335 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:02:30,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-11 14:02:30,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2024-10-11 14:02:30,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 72 states have (on average 1.375) internal successors, (99), 72 states have internal predecessors, (99), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 14:02:30,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 123 transitions. [2024-10-11 14:02:30,330 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 123 transitions. Word has length 99 [2024-10-11 14:02:30,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:02:30,332 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 123 transitions. [2024-10-11 14:02:30,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:02:30,333 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 123 transitions. [2024-10-11 14:02:30,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 14:02:30,336 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:02:30,336 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:02:30,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 14:02:30,337 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:02:30,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:02:30,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1554954143, now seen corresponding path program 1 times [2024-10-11 14:02:30,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:02:30,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128226336] [2024-10-11 14:02:30,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:02:30,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:02:30,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:30,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:02:30,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:30,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:02:30,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:30,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:02:30,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:30,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:02:30,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:30,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:02:30,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:30,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:02:30,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:30,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:02:30,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:30,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:02:30,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:30,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:02:30,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:30,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:02:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:30,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:02:30,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:30,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:02:30,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:30,636 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 14:02:30,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:02:30,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128226336] [2024-10-11 14:02:30,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128226336] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:02:30,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:02:30,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:02:30,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003867933] [2024-10-11 14:02:30,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:02:30,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:02:30,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:02:30,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:02:30,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:02:30,643 INFO L87 Difference]: Start difference. First operand 86 states and 123 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:02:30,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:02:30,698 INFO L93 Difference]: Finished difference Result 174 states and 249 transitions. [2024-10-11 14:02:30,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:02:30,699 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 99 [2024-10-11 14:02:30,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:02:30,701 INFO L225 Difference]: With dead ends: 174 [2024-10-11 14:02:30,701 INFO L226 Difference]: Without dead ends: 89 [2024-10-11 14:02:30,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:02:30,702 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 1 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:02:30,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 336 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:02:30,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-11 14:02:30,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2024-10-11 14:02:30,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 74 states have (on average 1.364864864864865) internal successors, (101), 74 states have internal predecessors, (101), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 14:02:30,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 125 transitions. [2024-10-11 14:02:30,719 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 125 transitions. Word has length 99 [2024-10-11 14:02:30,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:02:30,722 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 125 transitions. [2024-10-11 14:02:30,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:02:30,723 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 125 transitions. [2024-10-11 14:02:30,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 14:02:30,724 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:02:30,724 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:02:30,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 14:02:30,725 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:02:30,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:02:30,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1497695841, now seen corresponding path program 1 times [2024-10-11 14:02:30,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:02:30,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903284431] [2024-10-11 14:02:30,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:02:30,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:02:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:30,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:02:30,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:30,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:02:30,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:30,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:02:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:30,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:02:30,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:30,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:02:30,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:30,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:02:30,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:30,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:02:30,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:30,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:02:30,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:30,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:02:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:30,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:02:30,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:30,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:02:30,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:30,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:02:30,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:30,934 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 14:02:30,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:02:30,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903284431] [2024-10-11 14:02:30,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903284431] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:02:30,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:02:30,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:02:30,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742791560] [2024-10-11 14:02:30,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:02:30,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:02:30,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:02:30,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:02:30,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:02:30,942 INFO L87 Difference]: Start difference. First operand 88 states and 125 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:02:30,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:02:30,980 INFO L93 Difference]: Finished difference Result 178 states and 253 transitions. [2024-10-11 14:02:30,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:02:30,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 99 [2024-10-11 14:02:30,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:02:30,982 INFO L225 Difference]: With dead ends: 178 [2024-10-11 14:02:30,982 INFO L226 Difference]: Without dead ends: 91 [2024-10-11 14:02:30,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:02:30,983 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 1 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:02:30,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 339 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:02:30,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-11 14:02:30,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2024-10-11 14:02:30,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 76 states have (on average 1.355263157894737) internal successors, (103), 76 states have internal predecessors, (103), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 14:02:30,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 127 transitions. [2024-10-11 14:02:31,000 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 127 transitions. Word has length 99 [2024-10-11 14:02:31,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:02:31,000 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 127 transitions. [2024-10-11 14:02:31,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:02:31,001 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 127 transitions. [2024-10-11 14:02:31,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 14:02:31,004 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:02:31,004 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:02:31,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 14:02:31,004 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:02:31,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:02:31,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1497636259, now seen corresponding path program 1 times [2024-10-11 14:02:31,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:02:31,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710802104] [2024-10-11 14:02:31,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:02:31,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:02:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:40,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:02:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:40,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:02:40,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:40,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:02:40,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:40,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:02:40,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:40,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:02:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:40,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:02:40,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:40,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:02:40,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:40,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:02:40,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:40,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:02:40,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:40,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:02:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:40,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:02:40,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:40,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:02:40,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:40,581 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 14:02:40,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:02:40,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710802104] [2024-10-11 14:02:40,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710802104] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:02:40,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:02:40,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-11 14:02:40,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414378289] [2024-10-11 14:02:40,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:02:40,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 14:02:40,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:02:40,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 14:02:40,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2024-10-11 14:02:40,584 INFO L87 Difference]: Start difference. First operand 90 states and 127 transitions. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 14:02:43,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:02:43,953 INFO L93 Difference]: Finished difference Result 288 states and 406 transitions. [2024-10-11 14:02:43,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 14:02:43,954 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 99 [2024-10-11 14:02:43,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:02:43,956 INFO L225 Difference]: With dead ends: 288 [2024-10-11 14:02:43,956 INFO L226 Difference]: Without dead ends: 199 [2024-10-11 14:02:43,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=156, Invalid=494, Unknown=0, NotChecked=0, Total=650 [2024-10-11 14:02:43,958 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 608 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 14:02:43,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [608 Valid, 649 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 14:02:43,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-11 14:02:43,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 105. [2024-10-11 14:02:43,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 91 states have (on average 1.3846153846153846) internal successors, (126), 91 states have internal predecessors, (126), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 14:02:43,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 150 transitions. [2024-10-11 14:02:43,982 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 150 transitions. Word has length 99 [2024-10-11 14:02:43,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:02:43,982 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 150 transitions. [2024-10-11 14:02:43,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 14:02:43,983 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 150 transitions. [2024-10-11 14:02:43,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 14:02:43,986 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:02:43,986 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:02:43,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 14:02:43,987 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:02:43,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:02:43,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1278781541, now seen corresponding path program 1 times [2024-10-11 14:02:43,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:02:43,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389153] [2024-10-11 14:02:43,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:02:43,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:02:44,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:44,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:02:44,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:44,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:02:44,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:44,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:02:44,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:44,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:02:44,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:44,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:02:44,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:44,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:02:44,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:44,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:02:44,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:44,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:02:44,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:44,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:02:44,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:44,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:02:44,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:44,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:02:44,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:44,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:02:44,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:44,068 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 14:02:44,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:02:44,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389153] [2024-10-11 14:02:44,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389153] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:02:44,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:02:44,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:02:44,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291326689] [2024-10-11 14:02:44,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:02:44,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:02:44,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:02:44,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:02:44,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:02:44,073 INFO L87 Difference]: Start difference. First operand 105 states and 150 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:02:44,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:02:44,108 INFO L93 Difference]: Finished difference Result 262 states and 372 transitions. [2024-10-11 14:02:44,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:02:44,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 99 [2024-10-11 14:02:44,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:02:44,110 INFO L225 Difference]: With dead ends: 262 [2024-10-11 14:02:44,110 INFO L226 Difference]: Without dead ends: 158 [2024-10-11 14:02:44,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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-11 14:02:44,112 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 60 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:02:44,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 296 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:02:44,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-10-11 14:02:44,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 119. [2024-10-11 14:02:44,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 105 states have (on average 1.4) internal successors, (147), 105 states have internal predecessors, (147), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 14:02:44,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 171 transitions. [2024-10-11 14:02:44,137 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 171 transitions. Word has length 99 [2024-10-11 14:02:44,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:02:44,138 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 171 transitions. [2024-10-11 14:02:44,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:02:44,138 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 171 transitions. [2024-10-11 14:02:44,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 14:02:44,139 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:02:44,139 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:02:44,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 14:02:44,140 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:02:44,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:02:44,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1953500601, now seen corresponding path program 1 times [2024-10-11 14:02:44,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:02:44,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923957155] [2024-10-11 14:02:44,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:02:44,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:02:44,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:48,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:02:48,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:48,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:02:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:48,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:02:48,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:48,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:02:48,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:48,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:02:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:48,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:02:48,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:48,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:02:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:48,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:02:48,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:48,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:02:48,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:48,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:02:48,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:48,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:02:48,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:48,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:02:48,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:48,385 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 14:02:48,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:02:48,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923957155] [2024-10-11 14:02:48,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923957155] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:02:48,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:02:48,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 14:02:48,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594528071] [2024-10-11 14:02:48,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:02:48,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 14:02:48,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:02:48,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 14:02:48,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-10-11 14:02:48,388 INFO L87 Difference]: Start difference. First operand 119 states and 171 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 14:02:49,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:02:49,804 INFO L93 Difference]: Finished difference Result 276 states and 392 transitions. [2024-10-11 14:02:49,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 14:02:49,805 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 100 [2024-10-11 14:02:49,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:02:49,806 INFO L225 Difference]: With dead ends: 276 [2024-10-11 14:02:49,806 INFO L226 Difference]: Without dead ends: 158 [2024-10-11 14:02:49,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-10-11 14:02:49,808 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 284 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 14:02:49,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 348 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 14:02:49,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-10-11 14:02:49,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 106. [2024-10-11 14:02:49,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 92 states have (on average 1.3695652173913044) internal successors, (126), 92 states have internal predecessors, (126), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 14:02:49,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 150 transitions. [2024-10-11 14:02:49,836 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 150 transitions. Word has length 100 [2024-10-11 14:02:49,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:02:49,836 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 150 transitions. [2024-10-11 14:02:49,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 14:02:49,837 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 150 transitions. [2024-10-11 14:02:49,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 14:02:49,838 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:02:49,838 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:02:49,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 14:02:49,838 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:02:49,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:02:49,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1302700498, now seen corresponding path program 1 times [2024-10-11 14:02:49,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:02:49,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463549073] [2024-10-11 14:02:49,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:02:49,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:02:49,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:51,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:02:51,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:51,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:02:51,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:51,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:02:51,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:51,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:02:51,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:51,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:02:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:51,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:02:51,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:51,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:02:51,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:51,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:02:51,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:51,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:02:51,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:51,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:02:51,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:51,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:02:51,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:51,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:02:51,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:51,222 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 14:02:51,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:02:51,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463549073] [2024-10-11 14:02:51,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463549073] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:02:51,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:02:51,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 14:02:51,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143288852] [2024-10-11 14:02:51,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:02:51,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 14:02:51,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:02:51,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 14:02:51,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-11 14:02:51,224 INFO L87 Difference]: Start difference. First operand 106 states and 150 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 14:02:51,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:02:51,929 INFO L93 Difference]: Finished difference Result 273 states and 385 transitions. [2024-10-11 14:02:51,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 14:02:51,930 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2024-10-11 14:02:51,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:02:51,933 INFO L225 Difference]: With dead ends: 273 [2024-10-11 14:02:51,933 INFO L226 Difference]: Without dead ends: 168 [2024-10-11 14:02:51,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-11 14:02:51,934 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 210 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 14:02:51,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 441 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 14:02:51,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-10-11 14:02:51,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 135. [2024-10-11 14:02:51,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 121 states have (on average 1.3884297520661157) internal successors, (168), 121 states have internal predecessors, (168), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 14:02:51,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 192 transitions. [2024-10-11 14:02:51,959 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 192 transitions. Word has length 103 [2024-10-11 14:02:51,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:02:51,960 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 192 transitions. [2024-10-11 14:02:51,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 14:02:51,960 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 192 transitions. [2024-10-11 14:02:51,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 14:02:51,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:02:51,963 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:02:51,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 14:02:51,963 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:02:51,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:02:51,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1769039049, now seen corresponding path program 1 times [2024-10-11 14:02:51,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:02:51,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085252482] [2024-10-11 14:02:51,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:02:51,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:02:52,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:53,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:02:53,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:53,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:02:53,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:53,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:02:53,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:53,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:02:53,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:53,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:02:53,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:53,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:02:53,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:53,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:02:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:53,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:02:53,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:53,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:02:53,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:53,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:02:53,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:53,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:02:53,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:53,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:02:53,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:53,789 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 14:02:53,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:02:53,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085252482] [2024-10-11 14:02:53,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085252482] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:02:53,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:02:53,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 14:02:53,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828097875] [2024-10-11 14:02:53,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:02:53,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 14:02:53,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:02:53,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 14:02:53,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-11 14:02:53,792 INFO L87 Difference]: Start difference. First operand 135 states and 192 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 14:02:54,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:02:54,659 INFO L93 Difference]: Finished difference Result 304 states and 429 transitions. [2024-10-11 14:02:54,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 14:02:54,660 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2024-10-11 14:02:54,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:02:54,661 INFO L225 Difference]: With dead ends: 304 [2024-10-11 14:02:54,664 INFO L226 Difference]: Without dead ends: 170 [2024-10-11 14:02:54,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2024-10-11 14:02:54,666 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 269 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 14:02:54,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 476 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 14:02:54,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-11 14:02:54,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 137. [2024-10-11 14:02:54,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 123 states have internal predecessors, (170), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 14:02:54,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 194 transitions. [2024-10-11 14:02:54,696 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 194 transitions. Word has length 105 [2024-10-11 14:02:54,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:02:54,696 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 194 transitions. [2024-10-11 14:02:54,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 14:02:54,696 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 194 transitions. [2024-10-11 14:02:54,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 14:02:54,697 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:02:54,697 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:02:54,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 14:02:54,698 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:02:54,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:02:54,698 INFO L85 PathProgramCache]: Analyzing trace with hash 88759881, now seen corresponding path program 1 times [2024-10-11 14:02:54,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:02:54,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536437687] [2024-10-11 14:02:54,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:02:54,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:02:54,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:56,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:02:56,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:56,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:02:56,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:56,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:02:56,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:56,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:02:56,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:56,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:02:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:56,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:02:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:56,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:02:56,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:56,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:02:56,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:56,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:02:56,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:56,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:02:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:56,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:02:56,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:56,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:02:56,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:56,435 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 14:02:56,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:02:56,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536437687] [2024-10-11 14:02:56,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536437687] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:02:56,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:02:56,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 14:02:56,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611539289] [2024-10-11 14:02:56,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:02:56,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 14:02:56,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:02:56,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 14:02:56,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-11 14:02:56,438 INFO L87 Difference]: Start difference. First operand 137 states and 194 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 14:02:57,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:02:57,211 INFO L93 Difference]: Finished difference Result 330 states and 467 transitions. [2024-10-11 14:02:57,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 14:02:57,212 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2024-10-11 14:02:57,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:02:57,213 INFO L225 Difference]: With dead ends: 330 [2024-10-11 14:02:57,213 INFO L226 Difference]: Without dead ends: 194 [2024-10-11 14:02:57,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2024-10-11 14:02:57,214 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 245 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 14:02:57,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 409 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 14:02:57,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-10-11 14:02:57,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 165. [2024-10-11 14:02:57,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 151 states have (on average 1.403973509933775) internal successors, (212), 151 states have internal predecessors, (212), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 14:02:57,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 236 transitions. [2024-10-11 14:02:57,234 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 236 transitions. Word has length 105 [2024-10-11 14:02:57,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:02:57,235 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 236 transitions. [2024-10-11 14:02:57,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 14:02:57,235 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 236 transitions. [2024-10-11 14:02:57,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-11 14:02:57,236 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:02:57,236 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:02:57,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 14:02:57,236 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:02:57,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:02:57,237 INFO L85 PathProgramCache]: Analyzing trace with hash -754362701, now seen corresponding path program 1 times [2024-10-11 14:02:57,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:02:57,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129181804] [2024-10-11 14:02:57,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:02:57,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:02:57,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:58,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:02:58,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:58,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:02:58,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:58,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:02:58,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:58,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:02:58,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:58,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:02:58,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:58,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:02:58,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:58,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:02:58,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:58,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:02:58,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:58,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:02:58,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:58,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:02:58,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:58,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:02:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:58,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:02:58,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:58,762 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 14:02:58,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:02:58,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129181804] [2024-10-11 14:02:58,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129181804] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:02:58,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:02:58,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 14:02:58,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28959473] [2024-10-11 14:02:58,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:02:58,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 14:02:58,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:02:58,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 14:02:58,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-11 14:02:58,766 INFO L87 Difference]: Start difference. First operand 165 states and 236 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 14:02:59,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:02:59,290 INFO L93 Difference]: Finished difference Result 395 states and 562 transitions. [2024-10-11 14:02:59,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:02:59,291 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 106 [2024-10-11 14:02:59,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:02:59,292 INFO L225 Difference]: With dead ends: 395 [2024-10-11 14:02:59,292 INFO L226 Difference]: Without dead ends: 231 [2024-10-11 14:02:59,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-10-11 14:02:59,293 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 293 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 14:02:59,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 337 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 14:02:59,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-10-11 14:02:59,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 192. [2024-10-11 14:02:59,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 178 states have (on average 1.4101123595505618) internal successors, (251), 178 states have internal predecessors, (251), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 14:02:59,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 275 transitions. [2024-10-11 14:02:59,313 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 275 transitions. Word has length 106 [2024-10-11 14:02:59,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:02:59,314 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 275 transitions. [2024-10-11 14:02:59,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 14:02:59,314 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 275 transitions. [2024-10-11 14:02:59,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-11 14:02:59,315 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:02:59,316 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:02:59,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 14:02:59,316 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:02:59,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:02:59,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1414175444, now seen corresponding path program 1 times [2024-10-11 14:02:59,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:02:59,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586801590] [2024-10-11 14:02:59,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:02:59,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:02:59,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:00,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:03:00,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:00,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:03:00,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:00,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:03:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:00,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:03:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:00,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:03:00,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:00,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:03:00,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:00,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:03:00,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:00,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:03:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:00,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:03:00,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:00,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:03:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:00,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:03:00,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:00,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:03:00,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:00,902 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 14:03:00,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:03:00,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586801590] [2024-10-11 14:03:00,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586801590] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:03:00,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:03:00,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 14:03:00,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919493492] [2024-10-11 14:03:00,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:03:00,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 14:03:00,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:03:00,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 14:03:00,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:03:00,904 INFO L87 Difference]: Start difference. First operand 192 states and 275 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:03:01,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:03:01,273 INFO L93 Difference]: Finished difference Result 418 states and 594 transitions. [2024-10-11 14:03:01,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:03:01,274 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 106 [2024-10-11 14:03:01,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:03:01,275 INFO L225 Difference]: With dead ends: 418 [2024-10-11 14:03:01,276 INFO L226 Difference]: Without dead ends: 227 [2024-10-11 14:03:01,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-10-11 14:03:01,276 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 242 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 14:03:01,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 321 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 14:03:01,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-10-11 14:03:01,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 191. [2024-10-11 14:03:01,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 177 states have (on average 1.4011299435028248) internal successors, (248), 177 states have internal predecessors, (248), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 14:03:01,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 272 transitions. [2024-10-11 14:03:01,294 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 272 transitions. Word has length 106 [2024-10-11 14:03:01,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:03:01,294 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 272 transitions. [2024-10-11 14:03:01,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:03:01,294 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 272 transitions. [2024-10-11 14:03:01,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-11 14:03:01,295 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:03:01,296 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:03:01,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 14:03:01,296 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:03:01,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:03:01,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1047179178, now seen corresponding path program 1 times [2024-10-11 14:03:01,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:03:01,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170648640] [2024-10-11 14:03:01,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:03:01,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:03:01,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 14:03:01,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [650815171] [2024-10-11 14:03:01,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:03:01,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:03:01,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:03:01,364 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:03:01,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 14:03:01,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:03:01,638 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 14:03:01,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:03:02,030 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 14:03:02,031 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 14:03:02,032 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 14:03:02,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 14:03:02,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 14:03:02,237 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:03:02,379 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 14:03:02,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:03:02 BoogieIcfgContainer [2024-10-11 14:03:02,383 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 14:03:02,384 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 14:03:02,384 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 14:03:02,384 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 14:03:02,384 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:02:29" (3/4) ... [2024-10-11 14:03:02,386 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 14:03:02,387 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 14:03:02,388 INFO L158 Benchmark]: Toolchain (without parser) took 34625.81ms. Allocated memory was 159.4MB in the beginning and 778.0MB in the end (delta: 618.7MB). Free memory was 88.6MB in the beginning and 480.6MB in the end (delta: -392.0MB). Peak memory consumption was 229.0MB. Max. memory is 16.1GB. [2024-10-11 14:03:02,388 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 159.4MB. Free memory is still 113.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 14:03:02,388 INFO L158 Benchmark]: CACSL2BoogieTranslator took 493.64ms. Allocated memory is still 159.4MB. Free memory was 88.5MB in the beginning and 127.7MB in the end (delta: -39.3MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2024-10-11 14:03:02,388 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.70ms. Allocated memory is still 159.4MB. Free memory was 127.7MB in the beginning and 124.1MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 14:03:02,389 INFO L158 Benchmark]: Boogie Preprocessor took 73.06ms. Allocated memory is still 159.4MB. Free memory was 124.1MB in the beginning and 120.5MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 14:03:02,389 INFO L158 Benchmark]: RCFGBuilder took 704.52ms. Allocated memory is still 159.4MB. Free memory was 120.5MB in the beginning and 84.3MB in the end (delta: 36.2MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-11 14:03:02,390 INFO L158 Benchmark]: TraceAbstraction took 33279.32ms. Allocated memory was 159.4MB in the beginning and 778.0MB in the end (delta: 618.7MB). Free memory was 83.7MB in the beginning and 481.7MB in the end (delta: -398.0MB). Peak memory consumption was 222.4MB. Max. memory is 16.1GB. [2024-10-11 14:03:02,390 INFO L158 Benchmark]: Witness Printer took 3.50ms. Allocated memory is still 778.0MB. Free memory was 481.7MB in the beginning and 480.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 14:03:02,391 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.21ms. Allocated memory is still 159.4MB. Free memory is still 113.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 493.64ms. Allocated memory is still 159.4MB. Free memory was 88.5MB in the beginning and 127.7MB in the end (delta: -39.3MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.70ms. Allocated memory is still 159.4MB. Free memory was 127.7MB in the beginning and 124.1MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.06ms. Allocated memory is still 159.4MB. Free memory was 124.1MB in the beginning and 120.5MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 704.52ms. Allocated memory is still 159.4MB. Free memory was 120.5MB in the beginning and 84.3MB in the end (delta: 36.2MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 33279.32ms. Allocated memory was 159.4MB in the beginning and 778.0MB in the end (delta: 618.7MB). Free memory was 83.7MB in the beginning and 481.7MB in the end (delta: -398.0MB). Peak memory consumption was 222.4MB. Max. memory is 16.1GB. * Witness Printer took 3.50ms. Allocated memory is still 778.0MB. Free memory was 481.7MB in the beginning and 480.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 115, overapproximation of shiftRight at line 123. Possible FailurePath: [L36] unsigned char isInitial = 0; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 2, -64, 256, 128, 256, 50, 0, -4, 15.125, 0.9, 25.875, 50 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 2, -64, 256, 128, 256, 50, 0, -4, 15.125, 0.9, 25.875, 50 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 2, -64, 256, 128, 256, 50, 0, -4, 15.125, 0.9, 25.875, 50 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 2, -64, 256, 128, 256, 50, 0, -4, 15.125, 0.9, 25.875, 50 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 2, -64, 256, 128, 256, 50, 0, -4, 15.125, 0.9, 25.875, 50 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 2, -64, 256, 128, 256, 50, 0, -4, 15.125, 0.9, 25.875, 50 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 2, -64, 256, 128, 256, 50, 0, -4, 15.125, 0.9, 25.875, 50 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 2, -64, 256, 128, 256, 50, 0, -4, 15.125, 0.9, 25.875, 50 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 2, -64, 256, 128, 256, 50, 0, -4, 15.125, 0.9, 25.875, 50 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 2, -64, 256, 128, 256, 50, 0, -4, 15.125, 0.9, 25.875, 50 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 2, -64, 256, 128, 256, 50, 0, -4, 15.125, 0.9, 25.875, 50 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 2, -64, 256, 128, 256, 50, 0, -4, 15.125, 0.9, 25.875, 50 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 2, -64, 256, 128, 256, 50, 0, -4, 15.125, 0.9, 25.875, 50 }; [L51] signed short int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L52] signed short int* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L53] signed short int* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L54] unsigned short int* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L55] unsigned short int* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L56] signed long int* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L57] unsigned char* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L58] signed long int* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L59] float* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L60] float* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L61] double* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L62] unsigned short int* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L63] signed short int last_1_WrapperStruct00_var_1_1 = 2; [L64] unsigned short int last_1_WrapperStruct00_var_1_6 = 128; [L65] signed long int last_1_WrapperStruct00_var_1_8 = 50; [L127] isInitial = 1 [L128] FCALL initially() [L129] COND TRUE 1 [L130] CALL updateLastVariables() [L118] EXPR WrapperStruct00.var_1_1 [L118] last_1_WrapperStruct00_var_1_1 = WrapperStruct00.var_1_1 [L119] EXPR WrapperStruct00.var_1_6 [L119] last_1_WrapperStruct00_var_1_6 = WrapperStruct00.var_1_6 [L120] EXPR WrapperStruct00.var_1_8 [L120] last_1_WrapperStruct00_var_1_8 = WrapperStruct00.var_1_8 [L130] RET updateLastVariables() [L131] CALL updateVariables() [L98] WrapperStruct00.var_1_4 = __VERIFIER_nondet_short() [L99] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= -16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= -16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L100] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L101] WrapperStruct00.var_1_5 = __VERIFIER_nondet_short() [L102] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= -16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= -16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L103] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L104] WrapperStruct00.var_1_7 = __VERIFIER_nondet_ushort() [L105] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L106] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [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:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L109] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [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:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [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:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L110] WrapperStruct00.var_1_10 = __VERIFIER_nondet_long() [L111] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= -2147483648) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= -2147483648) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L112] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L113] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_10 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_10 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L114] WrapperStruct00.var_1_12 = __VERIFIER_nondet_float() [L115] EXPR WrapperStruct00.var_1_12 [L115] 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:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L115] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F [L115] EXPR WrapperStruct00.var_1_12 [L115] 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:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L115] 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:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L115] 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:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L115] 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:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L115] 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:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L131] RET updateVariables() [L132] CALL step() [L69] COND TRUE ! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1) [L70] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L70] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L70] (*(WrapperStruct00_var_1_1_Pointer)) = ((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))) [L72] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L72] signed long int stepLocal_0 = 1 * (*(WrapperStruct00_var_1_4_Pointer)); [L73] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L73] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L73] EXPR (*(WrapperStruct00_var_1_1_Pointer)) >> (*(WrapperStruct00_var_1_5_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50, stepLocal_0=-4] [L73] COND TRUE ((*(WrapperStruct00_var_1_1_Pointer)) >> (*(WrapperStruct00_var_1_5_Pointer))) > stepLocal_0 [L74] EXPR \read(*WrapperStruct00_var_1_7_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L74] EXPR (((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) > (0)) ? ((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) : (0) [L74] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L74] EXPR (((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) > (0)) ? ((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) : (0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L74] (*(WrapperStruct00_var_1_6_Pointer)) = (((((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) > (0)) ? ((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) : (0))) [L78] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L78] (*(WrapperStruct00_var_1_11_Pointer)) = (*(WrapperStruct00_var_1_12_Pointer)) [L79] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L79] (*(WrapperStruct00_var_1_13_Pointer)) = (*(WrapperStruct00_var_1_12_Pointer)) [L80] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L80] (*(WrapperStruct00_var_1_14_Pointer)) = (*(WrapperStruct00_var_1_7_Pointer)) [L81] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L81] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L81] signed long int stepLocal_2 = (*(WrapperStruct00_var_1_4_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer)); [L82] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L82] unsigned short int stepLocal_1 = (*(WrapperStruct00_var_1_7_Pointer)); [L83] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L83] COND FALSE !((*(WrapperStruct00_var_1_9_Pointer))) [L86] EXPR \read(*WrapperStruct00_var_1_14_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L86] COND FALSE !((*(WrapperStruct00_var_1_14_Pointer)) > stepLocal_2) [L93] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L93] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L93] (*(WrapperStruct00_var_1_8_Pointer)) = ((*(WrapperStruct00_var_1_6_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))) [L132] RET step() [L133] CALL, EXPR property() [L123] EXPR (! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) : 1 [L123] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L123] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L123] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L123] EXPR (! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L123] EXPR ((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) : 1) && ((((*(WrapperStruct00_var_1_1_Pointer)) >> (*(WrapperStruct00_var_1_5_Pointer))) > (1 * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) > (0)) ? ((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) : (0))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_7_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L123] EXPR ((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) : 1) && ((((*(WrapperStruct00_var_1_1_Pointer)) >> (*(WrapperStruct00_var_1_5_Pointer))) > (1 * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) > (0)) ? ((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) : (0))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_7_Pointer))))) [L123] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L123] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L123] EXPR (*(WrapperStruct00_var_1_1_Pointer)) >> (*(WrapperStruct00_var_1_5_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L123] EXPR \read(*WrapperStruct00_var_1_4_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L123] EXPR (((*(WrapperStruct00_var_1_1_Pointer)) >> (*(WrapperStruct00_var_1_5_Pointer))) > (1 * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) > (0)) ? ((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) : (0))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_7_Pointer)))) [L123] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L123] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L123] EXPR (((*(WrapperStruct00_var_1_1_Pointer)) >> (*(WrapperStruct00_var_1_5_Pointer))) > (1 * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) > (0)) ? ((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) : (0))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_7_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L123] EXPR ((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) : 1) && ((((*(WrapperStruct00_var_1_1_Pointer)) >> (*(WrapperStruct00_var_1_5_Pointer))) > (1 * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) > (0)) ? ((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) : (0))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_7_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L123] EXPR (((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) : 1) && ((((*(WrapperStruct00_var_1_1_Pointer)) >> (*(WrapperStruct00_var_1_5_Pointer))) > (1 * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) > (0)) ? ((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) : (0))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_7_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_6_Pointer))) < (last_1_WrapperStruct00_var_1_8)) ? ((*(WrapperStruct00_var_1_6_Pointer))) : (last_1_WrapperStruct00_var_1_8))))) : (((*(WrapperStruct00_var_1_14_Pointer)) > ((*(WrapperStruct00_var_1_4_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_7_Pointer)) > (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_4_Pointer))) < (100)) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (100))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (last_1_WrapperStruct00_var_1_8 - (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_6_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L123] EXPR (((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) : 1) && ((((*(WrapperStruct00_var_1_1_Pointer)) >> (*(WrapperStruct00_var_1_5_Pointer))) > (1 * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) > (0)) ? ((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) : (0))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_7_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_6_Pointer))) < (last_1_WrapperStruct00_var_1_8)) ? ((*(WrapperStruct00_var_1_6_Pointer))) : (last_1_WrapperStruct00_var_1_8))))) : (((*(WrapperStruct00_var_1_14_Pointer)) > ((*(WrapperStruct00_var_1_4_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_7_Pointer)) > (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_4_Pointer))) < (100)) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (100))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (last_1_WrapperStruct00_var_1_8 - (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_6_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L123] EXPR ((((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) : 1) && ((((*(WrapperStruct00_var_1_1_Pointer)) >> (*(WrapperStruct00_var_1_5_Pointer))) > (1 * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) > (0)) ? ((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) : (0))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_7_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_6_Pointer))) < (last_1_WrapperStruct00_var_1_8)) ? ((*(WrapperStruct00_var_1_6_Pointer))) : (last_1_WrapperStruct00_var_1_8))))) : (((*(WrapperStruct00_var_1_14_Pointer)) > ((*(WrapperStruct00_var_1_4_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_7_Pointer)) > (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_4_Pointer))) < (100)) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (100))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (last_1_WrapperStruct00_var_1_8 - (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_6_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer)))))))) && ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L123] EXPR ((((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) : 1) && ((((*(WrapperStruct00_var_1_1_Pointer)) >> (*(WrapperStruct00_var_1_5_Pointer))) > (1 * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) > (0)) ? ((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) : (0))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_7_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_6_Pointer))) < (last_1_WrapperStruct00_var_1_8)) ? ((*(WrapperStruct00_var_1_6_Pointer))) : (last_1_WrapperStruct00_var_1_8))))) : (((*(WrapperStruct00_var_1_14_Pointer)) > ((*(WrapperStruct00_var_1_4_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_7_Pointer)) > (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_4_Pointer))) < (100)) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (100))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (last_1_WrapperStruct00_var_1_8 - (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_6_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer)))))))) && ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L123] EXPR (((((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) : 1) && ((((*(WrapperStruct00_var_1_1_Pointer)) >> (*(WrapperStruct00_var_1_5_Pointer))) > (1 * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) > (0)) ? ((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) : (0))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_7_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_6_Pointer))) < (last_1_WrapperStruct00_var_1_8)) ? ((*(WrapperStruct00_var_1_6_Pointer))) : (last_1_WrapperStruct00_var_1_8))))) : (((*(WrapperStruct00_var_1_14_Pointer)) > ((*(WrapperStruct00_var_1_4_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_7_Pointer)) > (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_4_Pointer))) < (100)) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (100))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (last_1_WrapperStruct00_var_1_8 - (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_6_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer)))))))) && ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) && ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L123] EXPR (((((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) : 1) && ((((*(WrapperStruct00_var_1_1_Pointer)) >> (*(WrapperStruct00_var_1_5_Pointer))) > (1 * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) > (0)) ? ((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) : (0))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_7_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_6_Pointer))) < (last_1_WrapperStruct00_var_1_8)) ? ((*(WrapperStruct00_var_1_6_Pointer))) : (last_1_WrapperStruct00_var_1_8))))) : (((*(WrapperStruct00_var_1_14_Pointer)) > ((*(WrapperStruct00_var_1_4_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_7_Pointer)) > (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_4_Pointer))) < (100)) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (100))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (last_1_WrapperStruct00_var_1_8 - (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_6_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer)))))))) && ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) && ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L123] EXPR ((((((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) : 1) && ((((*(WrapperStruct00_var_1_1_Pointer)) >> (*(WrapperStruct00_var_1_5_Pointer))) > (1 * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) > (0)) ? ((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) : (0))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_7_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_6_Pointer))) < (last_1_WrapperStruct00_var_1_8)) ? ((*(WrapperStruct00_var_1_6_Pointer))) : (last_1_WrapperStruct00_var_1_8))))) : (((*(WrapperStruct00_var_1_14_Pointer)) > ((*(WrapperStruct00_var_1_4_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_7_Pointer)) > (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_4_Pointer))) < (100)) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (100))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (last_1_WrapperStruct00_var_1_8 - (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_6_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer)))))))) && ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) && ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer))))) && ((*(WrapperStruct00_var_1_14_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_7_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L123] EXPR ((((((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) : 1) && ((((*(WrapperStruct00_var_1_1_Pointer)) >> (*(WrapperStruct00_var_1_5_Pointer))) > (1 * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) > (0)) ? ((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) : (0))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_7_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_6_Pointer))) < (last_1_WrapperStruct00_var_1_8)) ? ((*(WrapperStruct00_var_1_6_Pointer))) : (last_1_WrapperStruct00_var_1_8))))) : (((*(WrapperStruct00_var_1_14_Pointer)) > ((*(WrapperStruct00_var_1_4_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_7_Pointer)) > (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_4_Pointer))) < (100)) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (100))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (last_1_WrapperStruct00_var_1_8 - (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_6_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer)))))))) && ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) && ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer))))) && ((*(WrapperStruct00_var_1_14_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_7_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L123-L124] return ((((((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) : 1) && ((((*(WrapperStruct00_var_1_1_Pointer)) >> (*(WrapperStruct00_var_1_5_Pointer))) > (1 * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) > (0)) ? ((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) : (0))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_7_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_6_Pointer))) < (last_1_WrapperStruct00_var_1_8)) ? ((*(WrapperStruct00_var_1_6_Pointer))) : (last_1_WrapperStruct00_var_1_8))))) : (((*(WrapperStruct00_var_1_14_Pointer)) > ((*(WrapperStruct00_var_1_4_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_7_Pointer)) > (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_4_Pointer))) < (100)) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (100))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (last_1_WrapperStruct00_var_1_8 - (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_6_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer)))))))) && ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) && ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer))))) && ((*(WrapperStruct00_var_1_14_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_7_Pointer)))) ; [L133] RET, EXPR property() [L133] 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:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.1s, OverallIterations: 13, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2214 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2214 mSDsluCounter, 4404 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3156 mSDsCounter, 175 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3852 IncrementalHoareTripleChecker+Invalid, 4027 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 175 mSolverCounterUnsat, 1248 mSDtfsCounter, 3852 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 451 GetRequests, 331 SyntacticMatches, 4 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=192occurred in iteration=11, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 358 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 22.3s InterpolantComputationTime, 1433 NumberOfCodeBlocks, 1433 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1207 ConstructedInterpolants, 0 QuantifiedInterpolants, 22106 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 3168/3168 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 14:03:02,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-67.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2bfc3a2327f8b20a29fd925460a8337c18b9a784fffca7c1ea577a58172303bb --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 14:03:04,618 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:03:04,706 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 14:03:04,713 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:03:04,714 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:03:04,747 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:03:04,748 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:03:04,749 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:03:04,749 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:03:04,750 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:03:04,751 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:03:04,752 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:03:04,752 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:03:04,752 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:03:04,753 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:03:04,754 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:03:04,754 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:03:04,754 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 14:03:04,757 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 14:03:04,757 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:03:04,758 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:03:04,758 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:03:04,758 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:03:04,758 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 14:03:04,759 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 14:03:04,759 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:03:04,759 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 14:03:04,759 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 14:03:04,759 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:03:04,760 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:03:04,760 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:03:04,760 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:03:04,760 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:03:04,760 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:03:04,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:03:04,761 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:03:04,761 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:03:04,761 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:03:04,761 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 14:03:04,762 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 14:03:04,762 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:03:04,764 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:03:04,764 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:03:04,764 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:03:04,765 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 14:03:04,765 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2bfc3a2327f8b20a29fd925460a8337c18b9a784fffca7c1ea577a58172303bb [2024-10-11 14:03:05,051 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:03:05,073 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:03:05,078 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:03:05,079 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:03:05,080 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:03:05,081 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-67.i [2024-10-11 14:03:06,574 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:03:06,820 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:03:06,824 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-67.i [2024-10-11 14:03:06,837 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e973f2cd2/e2ebd073d4fe44dc8b9ddc9d376510a1/FLAGa89522c92 [2024-10-11 14:03:06,855 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e973f2cd2/e2ebd073d4fe44dc8b9ddc9d376510a1 [2024-10-11 14:03:06,859 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:03:06,861 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:03:06,863 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:03:06,864 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:03:06,869 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:03:06,869 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:03:06" (1/1) ... [2024-10-11 14:03:06,871 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3aecfddc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:03:06, skipping insertion in model container [2024-10-11 14:03:06,872 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:03:06" (1/1) ... [2024-10-11 14:03:06,902 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:03:07,079 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-67.i[917,930] [2024-10-11 14:03:07,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:03:07,180 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:03:07,191 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-67.i[917,930] [2024-10-11 14:03:07,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:03:07,269 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:03:07,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:03:07 WrapperNode [2024-10-11 14:03:07,270 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:03:07,271 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:03:07,271 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:03:07,271 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:03:07,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:03:07" (1/1) ... [2024-10-11 14:03:07,290 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:03:07" (1/1) ... [2024-10-11 14:03:07,335 INFO L138 Inliner]: procedures = 39, calls = 130, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 394 [2024-10-11 14:03:07,335 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:03:07,336 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:03:07,336 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:03:07,336 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:03:07,349 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:03:07" (1/1) ... [2024-10-11 14:03:07,349 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:03:07" (1/1) ... [2024-10-11 14:03:07,363 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:03:07" (1/1) ... [2024-10-11 14:03:07,397 INFO L175 MemorySlicer]: Split 106 memory accesses to 2 slices as follows [2, 104]. 98 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 12]. The 16 writes are split as follows [0, 16]. [2024-10-11 14:03:07,398 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:03:07" (1/1) ... [2024-10-11 14:03:07,398 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:03:07" (1/1) ... [2024-10-11 14:03:07,424 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:03:07" (1/1) ... [2024-10-11 14:03:07,432 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:03:07" (1/1) ... [2024-10-11 14:03:07,437 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:03:07" (1/1) ... [2024-10-11 14:03:07,440 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:03:07" (1/1) ... [2024-10-11 14:03:07,445 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:03:07,446 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:03:07,446 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:03:07,446 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:03:07,447 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:03:07" (1/1) ... [2024-10-11 14:03:07,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:03:07,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:03:07,487 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 14:03:07,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 14:03:07,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:03:07,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-11 14:03:07,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-11 14:03:07,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-11 14:03:07,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-11 14:03:07,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 14:03:07,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 14:03:07,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-11 14:03:07,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-11 14:03:07,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 14:03:07,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 14:03:07,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-11 14:03:07,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-11 14:03:07,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-11 14:03:07,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-11 14:03:07,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-11 14:03:07,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-11 14:03:07,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 14:03:07,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 14:03:07,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-11 14:03:07,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-11 14:03:07,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-11 14:03:07,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-11 14:03:07,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-11 14:03:07,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-11 14:03:07,537 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 14:03:07,537 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 14:03:07,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:03:07,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:03:07,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-11 14:03:07,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-11 14:03:07,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-11 14:03:07,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-11 14:03:07,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 14:03:07,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 14:03:07,680 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:03:07,686 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:03:08,417 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2024-10-11 14:03:08,418 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:03:08,497 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:03:08,499 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 14:03:08,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:03:08 BoogieIcfgContainer [2024-10-11 14:03:08,500 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:03:08,502 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:03:08,503 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:03:08,506 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:03:08,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:03:06" (1/3) ... [2024-10-11 14:03:08,508 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1284fbf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:03:08, skipping insertion in model container [2024-10-11 14:03:08,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:03:07" (2/3) ... [2024-10-11 14:03:08,508 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1284fbf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:03:08, skipping insertion in model container [2024-10-11 14:03:08,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:03:08" (3/3) ... [2024-10-11 14:03:08,510 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-67.i [2024-10-11 14:03:08,530 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:03:08,530 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 14:03:08,599 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:03:08,606 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;@6ca6fe22, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:03:08,606 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 14:03:08,610 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 67 states have internal predecessors, (95), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 14:03:08,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 14:03:08,623 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:03:08,623 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:03:08,624 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:03:08,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:03:08,629 INFO L85 PathProgramCache]: Analyzing trace with hash 445929398, now seen corresponding path program 1 times [2024-10-11 14:03:08,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 14:03:08,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [235499070] [2024-10-11 14:03:08,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:03:08,646 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 14:03:08,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 14:03:08,649 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 14:03:08,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 14:03:08,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:08,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 14:03:08,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:03:09,024 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2024-10-11 14:03:09,026 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 14:03:09,026 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 14:03:09,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [235499070] [2024-10-11 14:03:09,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [235499070] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:03:09,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:03:09,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:03:09,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43934261] [2024-10-11 14:03:09,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:03:09,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 14:03:09,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 14:03:09,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 14:03:09,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 14:03:09,060 INFO L87 Difference]: Start difference. First operand has 81 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 67 states have internal predecessors, (95), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 14:03:09,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:03:09,116 INFO L93 Difference]: Finished difference Result 159 states and 248 transitions. [2024-10-11 14:03:09,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 14:03:09,119 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 98 [2024-10-11 14:03:09,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:03:09,127 INFO L225 Difference]: With dead ends: 159 [2024-10-11 14:03:09,127 INFO L226 Difference]: Without dead ends: 79 [2024-10-11 14:03:09,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 14:03:09,133 INFO L432 NwaCegarLoop]: 110 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, 110 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:03:09,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:03:09,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-11 14:03:09,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-11 14:03:09,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 65 states have internal predecessors, (90), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 14:03:09,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 114 transitions. [2024-10-11 14:03:09,183 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 114 transitions. Word has length 98 [2024-10-11 14:03:09,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:03:09,184 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 114 transitions. [2024-10-11 14:03:09,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 14:03:09,184 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 114 transitions. [2024-10-11 14:03:09,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 14:03:09,190 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:03:09,190 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:03:09,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 14:03:09,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 14:03:09,391 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:03:09,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:03:09,392 INFO L85 PathProgramCache]: Analyzing trace with hash -399153438, now seen corresponding path program 1 times [2024-10-11 14:03:09,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 14:03:09,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [832744591] [2024-10-11 14:03:09,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:03:09,394 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 14:03:09,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 14:03:09,398 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 14:03:09,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 14:03:09,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:09,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 14:03:09,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:03:09,752 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 14:03:09,752 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 14:03:09,752 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 14:03:09,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [832744591] [2024-10-11 14:03:09,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [832744591] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:03:09,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:03:09,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:03:09,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24687136] [2024-10-11 14:03:09,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:03:09,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:03:09,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 14:03:09,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:03:09,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:03:09,758 INFO L87 Difference]: Start difference. First operand 79 states and 114 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:03:09,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:03:09,857 INFO L93 Difference]: Finished difference Result 162 states and 234 transitions. [2024-10-11 14:03:09,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:03:09,860 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 98 [2024-10-11 14:03:09,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:03:09,861 INFO L225 Difference]: With dead ends: 162 [2024-10-11 14:03:09,861 INFO L226 Difference]: Without dead ends: 84 [2024-10-11 14:03:09,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 94 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-11 14:03:09,865 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 1 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 14:03:09,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 410 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 14:03:09,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-11 14:03:09,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2024-10-11 14:03:09,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 69 states have (on average 1.3623188405797102) internal successors, (94), 69 states have internal predecessors, (94), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 14:03:09,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 118 transitions. [2024-10-11 14:03:09,880 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 118 transitions. Word has length 98 [2024-10-11 14:03:09,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:03:09,885 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 118 transitions. [2024-10-11 14:03:09,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:03:09,885 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 118 transitions. [2024-10-11 14:03:09,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 14:03:09,887 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:03:09,887 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:03:09,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 14:03:10,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 14:03:10,088 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:03:10,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:03:10,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1208500064, now seen corresponding path program 1 times [2024-10-11 14:03:10,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 14:03:10,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [338722720] [2024-10-11 14:03:10,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:03:10,094 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 14:03:10,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 14:03:10,096 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 14:03:10,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 14:03:10,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:10,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 14:03:10,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:03:10,392 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 14:03:10,393 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 14:03:10,393 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 14:03:10,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [338722720] [2024-10-11 14:03:10,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [338722720] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:03:10,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:03:10,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 14:03:10,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835459124] [2024-10-11 14:03:10,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:03:10,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:03:10,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 14:03:10,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:03:10,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:03:10,397 INFO L87 Difference]: Start difference. First operand 83 states and 118 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:03:10,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:03:10,537 INFO L93 Difference]: Finished difference Result 168 states and 239 transitions. [2024-10-11 14:03:10,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:03:10,537 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 98 [2024-10-11 14:03:10,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:03:10,539 INFO L225 Difference]: With dead ends: 168 [2024-10-11 14:03:10,539 INFO L226 Difference]: Without dead ends: 86 [2024-10-11 14:03:10,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:03:10,540 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 1 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 14:03:10,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 503 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 14:03:10,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-11 14:03:10,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2024-10-11 14:03:10,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 71 states have (on average 1.352112676056338) internal successors, (96), 71 states have internal predecessors, (96), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 14:03:10,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 120 transitions. [2024-10-11 14:03:10,554 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 120 transitions. Word has length 98 [2024-10-11 14:03:10,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:03:10,555 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 120 transitions. [2024-10-11 14:03:10,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:03:10,555 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 120 transitions. [2024-10-11 14:03:10,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 14:03:10,556 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:03:10,556 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:03:10,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-11 14:03:10,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 14:03:10,758 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:03:10,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:03:10,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1151241762, now seen corresponding path program 1 times [2024-10-11 14:03:10,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 14:03:10,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [572930741] [2024-10-11 14:03:10,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:03:10,761 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 14:03:10,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 14:03:10,763 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 14:03:10,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 14:03:10,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:10,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 14:03:10,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:03:11,042 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 14:03:11,043 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 14:03:11,043 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 14:03:11,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [572930741] [2024-10-11 14:03:11,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [572930741] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:03:11,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:03:11,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 14:03:11,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692907393] [2024-10-11 14:03:11,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:03:11,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 14:03:11,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 14:03:11,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 14:03:11,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 14:03:11,045 INFO L87 Difference]: Start difference. First operand 85 states and 120 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:03:11,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:03:11,191 INFO L93 Difference]: Finished difference Result 172 states and 243 transitions. [2024-10-11 14:03:11,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 14:03:11,192 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 98 [2024-10-11 14:03:11,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:03:11,193 INFO L225 Difference]: With dead ends: 172 [2024-10-11 14:03:11,193 INFO L226 Difference]: Without dead ends: 88 [2024-10-11 14:03:11,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 14:03:11,198 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 1 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 14:03:11,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 598 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 14:03:11,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-11 14:03:11,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2024-10-11 14:03:11,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 73 states have (on average 1.3424657534246576) internal successors, (98), 73 states have internal predecessors, (98), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 14:03:11,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 122 transitions. [2024-10-11 14:03:11,213 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 122 transitions. Word has length 98 [2024-10-11 14:03:11,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:03:11,214 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 122 transitions. [2024-10-11 14:03:11,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:03:11,216 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 122 transitions. [2024-10-11 14:03:11,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 14:03:11,217 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:03:11,217 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:03:11,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 14:03:11,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 14:03:11,418 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:03:11,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:03:11,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1151182180, now seen corresponding path program 1 times [2024-10-11 14:03:11,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 14:03:11,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1807042956] [2024-10-11 14:03:11,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:03:11,420 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 14:03:11,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 14:03:11,422 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 14:03:11,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 14:03:11,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:11,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-10-11 14:03:11,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:03:12,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 14:03:14,644 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 31 treesize of output 26 [2024-10-11 14:03:17,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 47 [2024-10-11 14:03:18,913 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 50 treesize of output 40 [2024-10-11 14:03:20,201 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 50 treesize of output 40 [2024-10-11 14:03:22,083 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 50 treesize of output 40 [2024-10-11 14:03:23,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 55 [2024-10-11 14:03:23,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 71 [2024-10-11 14:03:23,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 28 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 88 [2024-10-11 14:03:27,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 92 [2024-10-11 14:03:29,959 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:03:29,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 153 treesize of output 93 [2024-10-11 14:03:30,121 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 52 proven. 128 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 14:03:30,124 INFO L311 TraceCheckSpWp]: Computing backward predicates...