./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-s_file-26.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-26.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4f32f3e0457a6141f1106de27eaab44d0716424a3dba3667fc2cbc28838d3ee1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:46:13,058 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:46:13,136 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:46:13,142 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:46:13,143 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:46:13,180 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:46:13,180 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:46:13,181 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:46:13,181 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:46:13,182 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:46:13,183 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:46:13,183 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:46:13,184 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:46:13,186 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:46:13,187 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:46:13,187 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:46:13,187 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:46:13,187 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:46:13,188 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:46:13,188 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:46:13,189 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:46:13,189 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:46:13,190 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:46:13,190 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:46:13,190 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:46:13,191 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:46:13,191 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:46:13,191 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:46:13,192 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:46:13,192 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:46:13,192 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:46:13,193 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:46:13,193 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:46:13,193 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:46:13,194 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:46:13,194 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:46:13,194 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:46:13,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:46:13,195 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:46:13,195 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:46:13,195 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:46:13,196 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:46:13,196 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4f32f3e0457a6141f1106de27eaab44d0716424a3dba3667fc2cbc28838d3ee1 [2024-10-24 11:46:13,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:46:13,513 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:46:13,517 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:46:13,519 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:46:13,520 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:46:13,522 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-26.i [2024-10-24 11:46:15,014 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:46:15,228 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:46:15,228 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-26.i [2024-10-24 11:46:15,237 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0adeebb0b/a589f2acd8834552a85ef703e7ae1b7b/FLAGb5d6e5d04 [2024-10-24 11:46:15,259 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0adeebb0b/a589f2acd8834552a85ef703e7ae1b7b [2024-10-24 11:46:15,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:46:15,265 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:46:15,267 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:46:15,268 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:46:15,275 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:46:15,275 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:46:15" (1/1) ... [2024-10-24 11:46:15,276 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70ad1b51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:46:15, skipping insertion in model container [2024-10-24 11:46:15,277 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:46:15" (1/1) ... [2024-10-24 11:46:15,306 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:46:15,495 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-s_file-26.i[916,929] [2024-10-24 11:46:15,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:46:15,560 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:46:15,572 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-s_file-26.i[916,929] [2024-10-24 11:46:15,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:46:15,635 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:46:15,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:46:15 WrapperNode [2024-10-24 11:46:15,636 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:46:15,637 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:46:15,637 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:46:15,638 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:46:15,644 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:46:15" (1/1) ... [2024-10-24 11:46:15,659 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:46:15" (1/1) ... [2024-10-24 11:46:15,706 INFO L138 Inliner]: procedures = 29, calls = 150, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 472 [2024-10-24 11:46:15,706 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:46:15,707 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:46:15,707 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:46:15,707 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:46:15,719 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:46:15" (1/1) ... [2024-10-24 11:46:15,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:46:15" (1/1) ... [2024-10-24 11:46:15,733 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:46:15" (1/1) ... [2024-10-24 11:46:15,763 INFO L175 MemorySlicer]: Split 129 memory accesses to 2 slices as follows [2, 127]. 98 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10]. The 11 writes are split as follows [0, 11]. [2024-10-24 11:46:15,763 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:46:15" (1/1) ... [2024-10-24 11:46:15,764 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:46:15" (1/1) ... [2024-10-24 11:46:15,790 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:46:15" (1/1) ... [2024-10-24 11:46:15,799 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:46:15" (1/1) ... [2024-10-24 11:46:15,809 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:46:15" (1/1) ... [2024-10-24 11:46:15,816 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:46:15" (1/1) ... [2024-10-24 11:46:15,824 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:46:15,826 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:46:15,826 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:46:15,826 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:46:15,827 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:46:15" (1/1) ... [2024-10-24 11:46:15,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:46:15,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:46:15,875 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:46:15,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:46:15,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:46:15,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 11:46:15,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 11:46:15,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 11:46:15,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 11:46:15,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 11:46:15,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 11:46:15,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 11:46:15,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 11:46:15,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 11:46:15,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 11:46:15,945 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:46:15,945 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:46:15,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:46:15,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 11:46:15,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:46:15,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:46:16,051 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:46:16,053 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:46:16,568 INFO L? ?]: Removed 160 outVars from TransFormulas that were not future-live. [2024-10-24 11:46:16,569 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:46:16,614 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:46:16,614 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:46:16,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:46:16 BoogieIcfgContainer [2024-10-24 11:46:16,615 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:46:16,618 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:46:16,618 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:46:16,622 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:46:16,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:46:15" (1/3) ... [2024-10-24 11:46:16,625 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d9dce43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:46:16, skipping insertion in model container [2024-10-24 11:46:16,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:46:15" (2/3) ... [2024-10-24 11:46:16,626 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d9dce43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:46:16, skipping insertion in model container [2024-10-24 11:46:16,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:46:16" (3/3) ... [2024-10-24 11:46:16,628 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-26.i [2024-10-24 11:46:16,648 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:46:16,648 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:46:16,714 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:46:16,721 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;@20fe84a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:46:16,722 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:46:16,726 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 74 states have (on average 1.472972972972973) internal successors, (109), 75 states have internal predecessors, (109), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:46:16,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-24 11:46:16,739 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:46:16,741 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:46:16,741 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:46:16,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:46:16,747 INFO L85 PathProgramCache]: Analyzing trace with hash 674655894, now seen corresponding path program 1 times [2024-10-24 11:46:16,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:46:16,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657422675] [2024-10-24 11:46:16,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:46:16,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:46:16,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:17,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:46:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:17,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:46:17,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:17,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:46:17,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:17,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:46:17,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:17,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:46:17,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:17,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:46:17,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:17,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:46:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:17,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:46:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:17,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:46:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:17,089 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:46:17,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:46:17,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657422675] [2024-10-24 11:46:17,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657422675] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:46:17,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:46:17,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:46:17,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939647768] [2024-10-24 11:46:17,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:46:17,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:46:17,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:46:17,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:46:17,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:46:17,171 INFO L87 Difference]: Start difference. First operand has 86 states, 74 states have (on average 1.472972972972973) internal successors, (109), 75 states have internal predecessors, (109), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:46:17,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:46:17,268 INFO L93 Difference]: Finished difference Result 169 states and 261 transitions. [2024-10-24 11:46:17,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:46:17,274 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2024-10-24 11:46:17,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:46:17,282 INFO L225 Difference]: With dead ends: 169 [2024-10-24 11:46:17,283 INFO L226 Difference]: Without dead ends: 84 [2024-10-24 11:46:17,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:46:17,293 INFO L432 NwaCegarLoop]: 118 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, 118 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:46:17,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:46:17,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-24 11:46:17,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-24 11:46:17,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.4246575342465753) internal successors, (104), 73 states have internal predecessors, (104), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:46:17,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 122 transitions. [2024-10-24 11:46:17,333 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 122 transitions. Word has length 84 [2024-10-24 11:46:17,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:46:17,334 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 122 transitions. [2024-10-24 11:46:17,334 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:46:17,335 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 122 transitions. [2024-10-24 11:46:17,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-24 11:46:17,338 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:46:17,338 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:46:17,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:46:17,339 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:46:17,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:46:17,340 INFO L85 PathProgramCache]: Analyzing trace with hash -154189688, now seen corresponding path program 1 times [2024-10-24 11:46:17,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:46:17,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433681325] [2024-10-24 11:46:17,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:46:17,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:46:17,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:17,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:46:17,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:17,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:46:17,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:17,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:46:17,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:17,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:46:17,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:17,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:46:17,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:17,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:46:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:17,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:46:17,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:17,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:46:17,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:17,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:46:17,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:17,635 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:46:17,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:46:17,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433681325] [2024-10-24 11:46:17,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433681325] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:46:17,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:46:17,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:46:17,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54948043] [2024-10-24 11:46:17,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:46:17,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:46:17,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:46:17,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:46:17,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:46:17,639 INFO L87 Difference]: Start difference. First operand 84 states and 122 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:46:17,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:46:17,700 INFO L93 Difference]: Finished difference Result 169 states and 246 transitions. [2024-10-24 11:46:17,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:46:17,703 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), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2024-10-24 11:46:17,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:46:17,704 INFO L225 Difference]: With dead ends: 169 [2024-10-24 11:46:17,704 INFO L226 Difference]: Without dead ends: 86 [2024-10-24 11:46:17,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:46:17,706 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:46:17,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 341 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:46:17,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-24 11:46:17,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-24 11:46:17,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 75 states have (on average 1.4133333333333333) internal successors, (106), 75 states have internal predecessors, (106), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:46:17,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 124 transitions. [2024-10-24 11:46:17,717 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 124 transitions. Word has length 84 [2024-10-24 11:46:17,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:46:17,719 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 124 transitions. [2024-10-24 11:46:17,719 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), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:46:17,719 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 124 transitions. [2024-10-24 11:46:17,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-24 11:46:17,721 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:46:17,722 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:46:17,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:46:17,722 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:46:17,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:46:17,723 INFO L85 PathProgramCache]: Analyzing trace with hash -2062647478, now seen corresponding path program 1 times [2024-10-24 11:46:17,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:46:17,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897380613] [2024-10-24 11:46:17,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:46:17,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:46:17,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:17,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:46:17,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:17,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:46:17,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:17,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:46:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:17,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:46:17,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:17,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:46:17,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:17,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:46:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:17,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:46:17,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:17,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:46:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:17,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:46:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:17,950 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:46:17,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:46:17,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897380613] [2024-10-24 11:46:17,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897380613] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:46:17,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:46:17,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:46:17,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776189932] [2024-10-24 11:46:17,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:46:17,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:46:17,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:46:17,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:46:17,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:46:17,955 INFO L87 Difference]: Start difference. First operand 86 states and 124 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:46:18,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:46:18,005 INFO L93 Difference]: Finished difference Result 174 states and 251 transitions. [2024-10-24 11:46:18,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:46:18,009 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-10-24 11:46:18,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:46:18,010 INFO L225 Difference]: With dead ends: 174 [2024-10-24 11:46:18,010 INFO L226 Difference]: Without dead ends: 89 [2024-10-24 11:46:18,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:46:18,015 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 1 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:46:18,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 341 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:46:18,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-24 11:46:18,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2024-10-24 11:46:18,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 77 states have internal predecessors, (108), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:46:18,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 126 transitions. [2024-10-24 11:46:18,031 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 126 transitions. Word has length 84 [2024-10-24 11:46:18,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:46:18,032 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 126 transitions. [2024-10-24 11:46:18,032 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:46:18,032 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 126 transitions. [2024-10-24 11:46:18,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-24 11:46:18,036 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:46:18,036 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:46:18,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:46:18,036 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:46:18,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:46:18,037 INFO L85 PathProgramCache]: Analyzing trace with hash -2062587896, now seen corresponding path program 1 times [2024-10-24 11:46:18,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:46:18,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825979336] [2024-10-24 11:46:18,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:46:18,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:46:18,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:18,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:46:18,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:18,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:46:18,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:18,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:46:18,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:18,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:46:18,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:18,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:46:18,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:18,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:46:18,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:18,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:46:18,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:18,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:46:18,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:18,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:46:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:18,373 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:46:18,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:46:18,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825979336] [2024-10-24 11:46:18,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825979336] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:46:18,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:46:18,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:46:18,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15188154] [2024-10-24 11:46:18,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:46:18,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:46:18,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:46:18,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:46:18,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:46:18,375 INFO L87 Difference]: Start difference. First operand 88 states and 126 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:46:18,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:46:18,402 INFO L93 Difference]: Finished difference Result 175 states and 251 transitions. [2024-10-24 11:46:18,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:46:18,406 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-10-24 11:46:18,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:46:18,408 INFO L225 Difference]: With dead ends: 175 [2024-10-24 11:46:18,408 INFO L226 Difference]: Without dead ends: 88 [2024-10-24 11:46:18,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:46:18,410 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:46:18,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 229 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:46:18,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-24 11:46:18,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-24 11:46:18,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 77 states have internal predecessors, (107), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:46:18,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 125 transitions. [2024-10-24 11:46:18,423 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 125 transitions. Word has length 84 [2024-10-24 11:46:18,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:46:18,424 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 125 transitions. [2024-10-24 11:46:18,424 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:46:18,424 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 125 transitions. [2024-10-24 11:46:18,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-24 11:46:18,425 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:46:18,425 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:46:18,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:46:18,426 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:46:18,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:46:18,429 INFO L85 PathProgramCache]: Analyzing trace with hash 543435658, now seen corresponding path program 1 times [2024-10-24 11:46:18,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:46:18,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837338718] [2024-10-24 11:46:18,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:46:18,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:46:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 11:46:18,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [965480423] [2024-10-24 11:46:18,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:46:18,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:46:18,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:46:18,599 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:46:18,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 11:46:19,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:46:19,145 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:46:19,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:46:19,449 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:46:19,449 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:46:19,450 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:46:19,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 11:46:19,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:46:19,660 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-24 11:46:19,723 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:46:19,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:46:19 BoogieIcfgContainer [2024-10-24 11:46:19,731 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:46:19,731 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:46:19,731 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:46:19,732 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:46:19,734 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:46:16" (3/4) ... [2024-10-24 11:46:19,736 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:46:19,737 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:46:19,738 INFO L158 Benchmark]: Toolchain (without parser) took 4472.72ms. Allocated memory was 159.4MB in the beginning and 195.0MB in the end (delta: 35.7MB). Free memory was 87.6MB in the beginning and 72.2MB in the end (delta: 15.4MB). Peak memory consumption was 54.2MB. Max. memory is 16.1GB. [2024-10-24 11:46:19,738 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 159.4MB. Free memory was 109.6MB in the beginning and 109.5MB in the end (delta: 129.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:46:19,739 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.06ms. Allocated memory is still 159.4MB. Free memory was 87.4MB in the beginning and 70.2MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 11:46:19,739 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.43ms. Allocated memory is still 159.4MB. Free memory was 70.2MB in the beginning and 65.5MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:46:19,739 INFO L158 Benchmark]: Boogie Preprocessor took 117.70ms. Allocated memory is still 159.4MB. Free memory was 65.5MB in the beginning and 60.4MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:46:19,743 INFO L158 Benchmark]: RCFGBuilder took 790.40ms. Allocated memory was 159.4MB in the beginning and 195.0MB in the end (delta: 35.7MB). Free memory was 60.4MB in the beginning and 130.7MB in the end (delta: -70.3MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2024-10-24 11:46:19,744 INFO L158 Benchmark]: TraceAbstraction took 3112.56ms. Allocated memory is still 195.0MB. Free memory was 129.6MB in the beginning and 72.2MB in the end (delta: 57.4MB). Peak memory consumption was 58.5MB. Max. memory is 16.1GB. [2024-10-24 11:46:19,744 INFO L158 Benchmark]: Witness Printer took 5.99ms. Allocated memory is still 195.0MB. Free memory is still 72.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:46:19,746 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.27ms. Allocated memory is still 159.4MB. Free memory was 109.6MB in the beginning and 109.5MB in the end (delta: 129.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 369.06ms. Allocated memory is still 159.4MB. Free memory was 87.4MB in the beginning and 70.2MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.43ms. Allocated memory is still 159.4MB. Free memory was 70.2MB in the beginning and 65.5MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 117.70ms. Allocated memory is still 159.4MB. Free memory was 65.5MB in the beginning and 60.4MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 790.40ms. Allocated memory was 159.4MB in the beginning and 195.0MB in the end (delta: 35.7MB). Free memory was 60.4MB in the beginning and 130.7MB in the end (delta: -70.3MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3112.56ms. Allocated memory is still 195.0MB. Free memory was 129.6MB in the beginning and 72.2MB in the end (delta: 57.4MB). Peak memory consumption was 58.5MB. Max. memory is 16.1GB. * Witness Printer took 5.99ms. Allocated memory is still 195.0MB. Free memory is still 72.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 86, overapproximation of someBinaryArithmeticFLOAToperation at line 51. Possible FailurePath: [L34] unsigned char isInitial = 0; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { -1, 1, 1.125, 199.5, 100000000000000.3, 64, 2, 50, -32, 8.75 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { -1, 1, 1.125, 199.5, 100000000000000.3, 64, 2, 50, -32, 8.75 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { -1, 1, 1.125, 199.5, 100000000000000.3, 64, 2, 50, -32, 8.75 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { -1, 1, 1.125, 199.5, 100000000000000.3, 64, 2, 50, -32, 8.75 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { -1, 1, 1.125, 199.5, 100000000000000.3, 64, 2, 50, -32, 8.75 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { -1, 1, 1.125, 199.5, 100000000000000.3, 64, 2, 50, -32, 8.75 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { -1, 1, 1.125, 199.5, 100000000000000.3, 64, 2, 50, -32, 8.75 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { -1, 1, 1.125, 199.5, 100000000000000.3, 64, 2, 50, -32, 8.75 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { -1, 1, 1.125, 199.5, 100000000000000.3, 64, 2, 50, -32, 8.75 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { -1, 1, 1.125, 199.5, 100000000000000.3, 64, 2, 50, -32, 8.75 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { -1, 1, 1.125, 199.5, 100000000000000.3, 64, 2, 50, -32, 8.75 }; [L47] unsigned char last_1_WrapperStruct00_var_1_15 = 64; [L90] isInitial = 1 [L91] FCALL initially() [L92] COND TRUE 1 [L93] CALL updateLastVariables() [L83] EXPR WrapperStruct00.var_1_15 [L83] last_1_WrapperStruct00_var_1_15 = WrapperStruct00.var_1_15 [L93] RET updateLastVariables() [L94] CALL updateVariables() [L67] WrapperStruct00.var_1_4 = __VERIFIER_nondet_short() [L68] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L68] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= -32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L68] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= -32767) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L69] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L69] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L69] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L70] WrapperStruct00.var_1_13 = __VERIFIER_nondet_float() [L71] EXPR WrapperStruct00.var_1_13 [L71] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L71] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F [L71] EXPR WrapperStruct00.var_1_13 [L71] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L71] EXPR (WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L71] EXPR (WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L71] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L71] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L72] WrapperStruct00.var_1_14 = __VERIFIER_nondet_float() [L73] EXPR WrapperStruct00.var_1_14 [L73] EXPR WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L73] EXPR WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F [L73] EXPR WrapperStruct00.var_1_14 [L73] EXPR WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L73] EXPR (WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L73] EXPR (WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L73] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L73] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L74] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L75] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L75] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L75] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L76] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L76] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L76] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L77] WrapperStruct00.var_1_19 = __VERIFIER_nondet_long() [L78] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L78] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= -2147483648) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L78] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= -2147483648) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L79] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L79] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L79] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L80] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L80] CALL assume_abort_if_not(WrapperStruct00.var_1_19 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L80] RET assume_abort_if_not(WrapperStruct00.var_1_19 != 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L94] RET updateVariables() [L95] CALL step() [L51] EXPR WrapperStruct00.var_1_13 [L51] EXPR WrapperStruct00.var_1_14 [L51] WrapperStruct00.var_1_12 = ((0.85f - WrapperStruct00.var_1_13) + WrapperStruct00.var_1_14) [L52] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L52] COND TRUE (- last_1_WrapperStruct00_var_1_15) >= (WrapperStruct00.var_1_4 / ((((-4) < 0 ) ? -(-4) : (-4)))) [L53] EXPR WrapperStruct00.var_1_16 [L53] WrapperStruct00.var_1_15 = WrapperStruct00.var_1_16 [L55] EXPR WrapperStruct00.var_1_13 [L55] WrapperStruct00.var_1_20 = WrapperStruct00.var_1_13 [L56] EXPR WrapperStruct00.var_1_20 [L56] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L56] COND TRUE WrapperStruct00.var_1_20 > WrapperStruct00.var_1_20 [L57] EXPR WrapperStruct00.var_1_15 [L57] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L57] EXPR ((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15) [L57] EXPR WrapperStruct00.var_1_15 [L57] EXPR ((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L57] WrapperStruct00.var_1_1 = ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) [L61] EXPR WrapperStruct00.var_1_15 [L61] EXPR WrapperStruct00.var_1_15 [L61] EXPR WrapperStruct00.var_1_1 [L61] signed long int stepLocal_0 = WrapperStruct00.var_1_15 + (WrapperStruct00.var_1_15 + WrapperStruct00.var_1_1); [L62] EXPR WrapperStruct00.var_1_15 [L62] EXPR WrapperStruct00.var_1_1 [L62] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L62] COND FALSE !(stepLocal_0 != (WrapperStruct00.var_1_15 * (WrapperStruct00.var_1_1 / WrapperStruct00.var_1_19))) [L95] RET step() [L96] CALL, EXPR property() [L86] EXPR WrapperStruct00.var_1_20 [L86] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L86] EXPR (WrapperStruct00.var_1_20 > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((signed short int) ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) < ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))) ? ((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))))))) [L86] EXPR WrapperStruct00.var_1_1 [L86] EXPR WrapperStruct00.var_1_15 [L86] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L86] EXPR ((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15) [L86] EXPR WrapperStruct00.var_1_15 [L86] EXPR ((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L86] EXPR (WrapperStruct00.var_1_20 > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((signed short int) ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) < ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))) ? ((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L86] EXPR ((WrapperStruct00.var_1_20 > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((signed short int) ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) < ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))) ? ((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))))) && (WrapperStruct00.var_1_12 == ((float) ((0.85f - WrapperStruct00.var_1_13) + WrapperStruct00.var_1_14))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L86] EXPR ((WrapperStruct00.var_1_20 > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((signed short int) ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) < ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))) ? ((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))))) && (WrapperStruct00.var_1_12 == ((float) ((0.85f - WrapperStruct00.var_1_13) + WrapperStruct00.var_1_14))) [L86] EXPR WrapperStruct00.var_1_12 [L86] EXPR WrapperStruct00.var_1_13 [L86] EXPR WrapperStruct00.var_1_14 [L86] EXPR ((WrapperStruct00.var_1_20 > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((signed short int) ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) < ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))) ? ((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))))) && (WrapperStruct00.var_1_12 == ((float) ((0.85f - WrapperStruct00.var_1_13) + WrapperStruct00.var_1_14))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L86] EXPR (((WrapperStruct00.var_1_20 > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((signed short int) ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) < ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))) ? ((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))))) && (WrapperStruct00.var_1_12 == ((float) ((0.85f - WrapperStruct00.var_1_13) + WrapperStruct00.var_1_14)))) && (((- last_1_WrapperStruct00_var_1_15) >= (WrapperStruct00.var_1_4 / ((((-4) < 0 ) ? -(-4) : (-4))))) ? (WrapperStruct00.var_1_15 == ((unsigned char) WrapperStruct00.var_1_16)) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L86] EXPR (((WrapperStruct00.var_1_20 > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((signed short int) ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) < ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))) ? ((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))))) && (WrapperStruct00.var_1_12 == ((float) ((0.85f - WrapperStruct00.var_1_13) + WrapperStruct00.var_1_14)))) && (((- last_1_WrapperStruct00_var_1_15) >= (WrapperStruct00.var_1_4 / ((((-4) < 0 ) ? -(-4) : (-4))))) ? (WrapperStruct00.var_1_15 == ((unsigned char) WrapperStruct00.var_1_16)) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L86] EXPR ((((WrapperStruct00.var_1_20 > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((signed short int) ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) < ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))) ? ((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))))) && (WrapperStruct00.var_1_12 == ((float) ((0.85f - WrapperStruct00.var_1_13) + WrapperStruct00.var_1_14)))) && (((- last_1_WrapperStruct00_var_1_15) >= (WrapperStruct00.var_1_4 / ((((-4) < 0 ) ? -(-4) : (-4))))) ? (WrapperStruct00.var_1_15 == ((unsigned char) WrapperStruct00.var_1_16)) : 1)) && (((WrapperStruct00.var_1_15 + (WrapperStruct00.var_1_15 + WrapperStruct00.var_1_1)) != (WrapperStruct00.var_1_15 * (WrapperStruct00.var_1_1 / WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_17 == ((unsigned long int) (((((10u) < ((WrapperStruct00.var_1_1 + WrapperStruct00.var_1_15))) ? (10u) : ((WrapperStruct00.var_1_1 + WrapperStruct00.var_1_15)))) + WrapperStruct00.var_1_15))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L86] EXPR ((((WrapperStruct00.var_1_20 > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((signed short int) ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) < ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))) ? ((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))))) && (WrapperStruct00.var_1_12 == ((float) ((0.85f - WrapperStruct00.var_1_13) + WrapperStruct00.var_1_14)))) && (((- last_1_WrapperStruct00_var_1_15) >= (WrapperStruct00.var_1_4 / ((((-4) < 0 ) ? -(-4) : (-4))))) ? (WrapperStruct00.var_1_15 == ((unsigned char) WrapperStruct00.var_1_16)) : 1)) && (((WrapperStruct00.var_1_15 + (WrapperStruct00.var_1_15 + WrapperStruct00.var_1_1)) != (WrapperStruct00.var_1_15 * (WrapperStruct00.var_1_1 / WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_17 == ((unsigned long int) (((((10u) < ((WrapperStruct00.var_1_1 + WrapperStruct00.var_1_15))) ? (10u) : ((WrapperStruct00.var_1_1 + WrapperStruct00.var_1_15)))) + WrapperStruct00.var_1_15))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L86] EXPR (((((WrapperStruct00.var_1_20 > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((signed short int) ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) < ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))) ? ((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))))) && (WrapperStruct00.var_1_12 == ((float) ((0.85f - WrapperStruct00.var_1_13) + WrapperStruct00.var_1_14)))) && (((- last_1_WrapperStruct00_var_1_15) >= (WrapperStruct00.var_1_4 / ((((-4) < 0 ) ? -(-4) : (-4))))) ? (WrapperStruct00.var_1_15 == ((unsigned char) WrapperStruct00.var_1_16)) : 1)) && (((WrapperStruct00.var_1_15 + (WrapperStruct00.var_1_15 + WrapperStruct00.var_1_1)) != (WrapperStruct00.var_1_15 * (WrapperStruct00.var_1_1 / WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_17 == ((unsigned long int) (((((10u) < ((WrapperStruct00.var_1_1 + WrapperStruct00.var_1_15))) ? (10u) : ((WrapperStruct00.var_1_1 + WrapperStruct00.var_1_15)))) + WrapperStruct00.var_1_15))) : 1)) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_13)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L86] EXPR (((((WrapperStruct00.var_1_20 > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((signed short int) ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) < ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))) ? ((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))))) && (WrapperStruct00.var_1_12 == ((float) ((0.85f - WrapperStruct00.var_1_13) + WrapperStruct00.var_1_14)))) && (((- last_1_WrapperStruct00_var_1_15) >= (WrapperStruct00.var_1_4 / ((((-4) < 0 ) ? -(-4) : (-4))))) ? (WrapperStruct00.var_1_15 == ((unsigned char) WrapperStruct00.var_1_16)) : 1)) && (((WrapperStruct00.var_1_15 + (WrapperStruct00.var_1_15 + WrapperStruct00.var_1_1)) != (WrapperStruct00.var_1_15 * (WrapperStruct00.var_1_1 / WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_17 == ((unsigned long int) (((((10u) < ((WrapperStruct00.var_1_1 + WrapperStruct00.var_1_15))) ? (10u) : ((WrapperStruct00.var_1_1 + WrapperStruct00.var_1_15)))) + WrapperStruct00.var_1_15))) : 1)) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_13)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L86-L87] return (((((WrapperStruct00.var_1_20 > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((signed short int) ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) < ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))) ? ((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))))) && (WrapperStruct00.var_1_12 == ((float) ((0.85f - WrapperStruct00.var_1_13) + WrapperStruct00.var_1_14)))) && (((- last_1_WrapperStruct00_var_1_15) >= (WrapperStruct00.var_1_4 / ((((-4) < 0 ) ? -(-4) : (-4))))) ? (WrapperStruct00.var_1_15 == ((unsigned char) WrapperStruct00.var_1_16)) : 1)) && (((WrapperStruct00.var_1_15 + (WrapperStruct00.var_1_15 + WrapperStruct00.var_1_1)) != (WrapperStruct00.var_1_15 * (WrapperStruct00.var_1_1 / WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_17 == ((unsigned long int) (((((10u) < ((WrapperStruct00.var_1_1 + WrapperStruct00.var_1_15))) ? (10u) : ((WrapperStruct00.var_1_1 + WrapperStruct00.var_1_15)))) + WrapperStruct00.var_1_15))) : 1)) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_13)) ; [L96] RET, EXPR property() [L96] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 5, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 1029 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 563 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 63 IncrementalHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 466 mSDtfsCounter, 63 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=3, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 504 NumberOfCodeBlocks, 504 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 332 ConstructedInterpolants, 0 QuantifiedInterpolants, 338 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 576/576 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 11:46:19,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-26.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4f32f3e0457a6141f1106de27eaab44d0716424a3dba3667fc2cbc28838d3ee1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:46:22,104 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:46:22,180 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:46:22,186 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:46:22,187 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:46:22,231 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:46:22,231 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:46:22,231 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:46:22,232 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:46:22,232 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:46:22,233 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:46:22,233 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:46:22,237 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:46:22,238 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:46:22,239 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:46:22,240 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:46:22,240 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:46:22,241 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:46:22,241 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:46:22,243 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:46:22,244 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:46:22,244 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:46:22,247 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:46:22,248 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:46:22,248 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:46:22,248 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:46:22,248 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:46:22,248 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:46:22,249 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:46:22,249 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:46:22,249 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:46:22,249 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:46:22,249 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:46:22,250 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:46:22,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:46:22,252 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:46:22,252 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:46:22,252 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:46:22,253 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:46:22,253 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:46:22,253 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:46:22,254 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:46:22,254 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:46:22,254 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:46:22,254 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:46:22,254 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4f32f3e0457a6141f1106de27eaab44d0716424a3dba3667fc2cbc28838d3ee1 [2024-10-24 11:46:22,607 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:46:22,635 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:46:22,637 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:46:22,639 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:46:22,639 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:46:22,641 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-26.i [2024-10-24 11:46:24,254 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:46:24,476 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:46:24,477 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-26.i [2024-10-24 11:46:24,490 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52061ad87/f8dd40faa22d4cc583fbb3bcbd87a7de/FLAGf9620b3e1 [2024-10-24 11:46:24,511 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52061ad87/f8dd40faa22d4cc583fbb3bcbd87a7de [2024-10-24 11:46:24,513 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:46:24,515 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:46:24,517 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:46:24,517 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:46:24,524 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:46:24,525 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:46:24" (1/1) ... [2024-10-24 11:46:24,526 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@165e3dcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:46:24, skipping insertion in model container [2024-10-24 11:46:24,527 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:46:24" (1/1) ... [2024-10-24 11:46:24,558 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:46:24,772 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-s_file-26.i[916,929] [2024-10-24 11:46:24,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:46:24,870 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:46:24,885 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-s_file-26.i[916,929] [2024-10-24 11:46:24,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:46:24,974 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:46:24,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:46:24 WrapperNode [2024-10-24 11:46:24,975 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:46:24,976 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:46:24,976 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:46:24,976 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:46:24,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:46:24" (1/1) ... [2024-10-24 11:46:25,009 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:46:24" (1/1) ... [2024-10-24 11:46:25,050 INFO L138 Inliner]: procedures = 36, calls = 150, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 470 [2024-10-24 11:46:25,054 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:46:25,055 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:46:25,055 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:46:25,055 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:46:25,069 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:46:24" (1/1) ... [2024-10-24 11:46:25,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:46:24" (1/1) ... [2024-10-24 11:46:25,080 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:46:24" (1/1) ... [2024-10-24 11:46:25,122 INFO L175 MemorySlicer]: Split 129 memory accesses to 2 slices as follows [2, 127]. 98 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10]. The 11 writes are split as follows [0, 11]. [2024-10-24 11:46:25,123 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:46:24" (1/1) ... [2024-10-24 11:46:25,123 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:46:24" (1/1) ... [2024-10-24 11:46:25,171 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:46:24" (1/1) ... [2024-10-24 11:46:25,175 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:46:24" (1/1) ... [2024-10-24 11:46:25,178 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:46:24" (1/1) ... [2024-10-24 11:46:25,181 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:46:24" (1/1) ... [2024-10-24 11:46:25,190 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:46:25,193 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:46:25,194 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:46:25,194 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:46:25,195 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:46:24" (1/1) ... [2024-10-24 11:46:25,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:46:25,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:46:25,232 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:46:25,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:46:25,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:46:25,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 11:46:25,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 11:46:25,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-24 11:46:25,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-24 11:46:25,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:46:25,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 11:46:25,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-24 11:46:25,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-24 11:46:25,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-24 11:46:25,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-24 11:46:25,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 11:46:25,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 11:46:25,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-24 11:46:25,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-24 11:46:25,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-24 11:46:25,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-24 11:46:25,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-24 11:46:25,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-24 11:46:25,293 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:46:25,293 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:46:25,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:46:25,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:46:25,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-24 11:46:25,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-24 11:46:25,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-24 11:46:25,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-24 11:46:25,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 11:46:25,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 11:46:25,430 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:46:25,434 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:46:26,920 INFO L? ?]: Removed 160 outVars from TransFormulas that were not future-live. [2024-10-24 11:46:26,920 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:46:26,967 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:46:26,969 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:46:26,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:46:26 BoogieIcfgContainer [2024-10-24 11:46:26,970 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:46:26,973 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:46:26,973 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:46:26,977 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:46:26,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:46:24" (1/3) ... [2024-10-24 11:46:26,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57e68396 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:46:26, skipping insertion in model container [2024-10-24 11:46:26,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:46:24" (2/3) ... [2024-10-24 11:46:26,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57e68396 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:46:26, skipping insertion in model container [2024-10-24 11:46:26,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:46:26" (3/3) ... [2024-10-24 11:46:26,980 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-26.i [2024-10-24 11:46:26,997 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:46:26,998 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:46:27,066 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:46:27,075 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;@5078ab4f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:46:27,075 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:46:27,079 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 74 states have (on average 1.472972972972973) internal successors, (109), 75 states have internal predecessors, (109), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:46:27,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-24 11:46:27,090 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:46:27,090 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:46:27,091 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:46:27,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:46:27,098 INFO L85 PathProgramCache]: Analyzing trace with hash 674655894, now seen corresponding path program 1 times [2024-10-24 11:46:27,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:46:27,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1762944379] [2024-10-24 11:46:27,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:46:27,132 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:46:27,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:46:27,135 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:46:27,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 11:46:27,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:27,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:46:27,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:46:27,563 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-24 11:46:27,564 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:46:27,565 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:46:27,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1762944379] [2024-10-24 11:46:27,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1762944379] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:46:27,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:46:27,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:46:27,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723753500] [2024-10-24 11:46:27,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:46:27,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:46:27,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:46:27,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:46:27,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:46:27,598 INFO L87 Difference]: Start difference. First operand has 86 states, 74 states have (on average 1.472972972972973) internal successors, (109), 75 states have internal predecessors, (109), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:46:27,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:46:27,938 INFO L93 Difference]: Finished difference Result 169 states and 261 transitions. [2024-10-24 11:46:27,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:46:27,941 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2024-10-24 11:46:27,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:46:27,948 INFO L225 Difference]: With dead ends: 169 [2024-10-24 11:46:27,948 INFO L226 Difference]: Without dead ends: 84 [2024-10-24 11:46:27,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:46:27,954 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 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.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:46:27,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:46:27,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-24 11:46:27,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-24 11:46:27,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.4246575342465753) internal successors, (104), 73 states have internal predecessors, (104), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:46:27,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 122 transitions. [2024-10-24 11:46:27,998 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 122 transitions. Word has length 84 [2024-10-24 11:46:27,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:46:27,998 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 122 transitions. [2024-10-24 11:46:27,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:46:27,999 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 122 transitions. [2024-10-24 11:46:28,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-24 11:46:28,005 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:46:28,005 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:46:28,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 11:46:28,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:46:28,207 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:46:28,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:46:28,208 INFO L85 PathProgramCache]: Analyzing trace with hash -154189688, now seen corresponding path program 1 times [2024-10-24 11:46:28,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:46:28,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [282176921] [2024-10-24 11:46:28,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:46:28,209 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:46:28,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:46:28,213 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:46:28,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 11:46:28,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:28,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:46:28,543 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:46:28,600 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-10-24 11:46:28,601 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:46:28,601 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:46:28,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [282176921] [2024-10-24 11:46:28,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [282176921] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:46:28,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:46:28,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:46:28,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572245526] [2024-10-24 11:46:28,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:46:28,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:46:28,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:46:28,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:46:28,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:46:28,605 INFO L87 Difference]: Start difference. First operand 84 states and 122 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:46:28,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:46:28,876 INFO L93 Difference]: Finished difference Result 169 states and 246 transitions. [2024-10-24 11:46:28,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:46:28,876 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2024-10-24 11:46:28,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:46:28,878 INFO L225 Difference]: With dead ends: 169 [2024-10-24 11:46:28,878 INFO L226 Difference]: Without dead ends: 86 [2024-10-24 11:46:28,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:46:28,880 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:46:28,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 341 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:46:28,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-24 11:46:28,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-24 11:46:28,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 75 states have (on average 1.4133333333333333) internal successors, (106), 75 states have internal predecessors, (106), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:46:28,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 124 transitions. [2024-10-24 11:46:28,897 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 124 transitions. Word has length 84 [2024-10-24 11:46:28,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:46:28,898 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 124 transitions. [2024-10-24 11:46:28,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:46:28,899 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 124 transitions. [2024-10-24 11:46:28,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-24 11:46:28,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:46:28,902 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:46:28,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 11:46:29,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:46:29,103 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:46:29,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:46:29,103 INFO L85 PathProgramCache]: Analyzing trace with hash -2062647478, now seen corresponding path program 1 times [2024-10-24 11:46:29,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:46:29,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [500144401] [2024-10-24 11:46:29,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:46:29,104 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:46:29,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:46:29,110 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:46:29,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 11:46:29,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:29,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:46:29,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:46:29,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-24 11:46:29,574 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:46:29,575 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:46:29,575 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:46:29,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [500144401] [2024-10-24 11:46:29,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [500144401] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:46:29,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:46:29,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:46:29,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191066621] [2024-10-24 11:46:29,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:46:29,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:46:29,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:46:29,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:46:29,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:46:29,581 INFO L87 Difference]: Start difference. First operand 86 states and 124 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:46:29,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:46:29,977 INFO L93 Difference]: Finished difference Result 171 states and 247 transitions. [2024-10-24 11:46:29,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:46:29,977 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-10-24 11:46:29,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:46:29,979 INFO L225 Difference]: With dead ends: 171 [2024-10-24 11:46:29,979 INFO L226 Difference]: Without dead ends: 86 [2024-10-24 11:46:29,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:46:29,981 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:46:29,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 229 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:46:29,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-24 11:46:29,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-24 11:46:29,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 75 states have (on average 1.4) internal successors, (105), 75 states have internal predecessors, (105), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:46:29,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 123 transitions. [2024-10-24 11:46:29,997 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 123 transitions. Word has length 84 [2024-10-24 11:46:29,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:46:30,001 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 123 transitions. [2024-10-24 11:46:30,002 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:46:30,002 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 123 transitions. [2024-10-24 11:46:30,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-24 11:46:30,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:46:30,004 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:46:30,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 11:46:30,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:46:30,205 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:46:30,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:46:30,205 INFO L85 PathProgramCache]: Analyzing trace with hash 543376076, now seen corresponding path program 1 times [2024-10-24 11:46:30,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:46:30,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [986142899] [2024-10-24 11:46:30,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:46:30,207 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:46:30,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:46:30,208 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:46:30,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 11:46:30,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:30,527 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 11:46:30,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:46:30,589 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:46:30,589 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:46:30,589 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:46:30,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [986142899] [2024-10-24 11:46:30,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [986142899] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:46:30,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:46:30,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:46:30,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580181195] [2024-10-24 11:46:30,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:46:30,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:46:30,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:46:30,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:46:30,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:46:30,593 INFO L87 Difference]: Start difference. First operand 86 states and 123 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:46:31,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:46:31,183 INFO L93 Difference]: Finished difference Result 176 states and 252 transitions. [2024-10-24 11:46:31,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:46:31,184 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-10-24 11:46:31,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:46:31,186 INFO L225 Difference]: With dead ends: 176 [2024-10-24 11:46:31,186 INFO L226 Difference]: Without dead ends: 91 [2024-10-24 11:46:31,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:46:31,191 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 1 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:46:31,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 442 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 11:46:31,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-24 11:46:31,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2024-10-24 11:46:31,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 79 states have (on average 1.379746835443038) internal successors, (109), 79 states have internal predecessors, (109), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:46:31,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 127 transitions. [2024-10-24 11:46:31,204 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 127 transitions. Word has length 84 [2024-10-24 11:46:31,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:46:31,205 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 127 transitions. [2024-10-24 11:46:31,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:46:31,206 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 127 transitions. [2024-10-24 11:46:31,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-24 11:46:31,207 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:46:31,207 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:46:31,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-24 11:46:31,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:46:31,409 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:46:31,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:46:31,409 INFO L85 PathProgramCache]: Analyzing trace with hash 543435658, now seen corresponding path program 1 times [2024-10-24 11:46:31,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:46:31,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1160141727] [2024-10-24 11:46:31,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:46:31,410 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:46:31,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:46:31,414 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:46:31,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-24 11:46:31,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:31,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 11:46:31,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:46:31,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-10-24 11:46:31,933 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-10-24 11:46:31,935 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:46:31,936 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:46:31,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1160141727] [2024-10-24 11:46:31,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1160141727] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:46:31,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:46:31,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:46:31,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233386284] [2024-10-24 11:46:31,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:46:31,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:46:31,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:46:31,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:46:31,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:46:31,941 INFO L87 Difference]: Start difference. First operand 90 states and 127 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:46:32,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:46:32,765 INFO L93 Difference]: Finished difference Result 179 states and 253 transitions. [2024-10-24 11:46:32,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:46:32,765 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2024-10-24 11:46:32,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:46:32,766 INFO L225 Difference]: With dead ends: 179 [2024-10-24 11:46:32,766 INFO L226 Difference]: Without dead ends: 90 [2024-10-24 11:46:32,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:46:32,768 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 111 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 11:46:32,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 352 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 11:46:32,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-24 11:46:32,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2024-10-24 11:46:32,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 77 states have internal predecessors, (106), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:46:32,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 124 transitions. [2024-10-24 11:46:32,779 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 124 transitions. Word has length 84 [2024-10-24 11:46:32,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:46:32,780 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 124 transitions. [2024-10-24 11:46:32,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:46:32,780 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 124 transitions. [2024-10-24 11:46:32,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-24 11:46:32,781 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:46:32,781 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:46:32,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-24 11:46:32,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:46:32,986 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:46:32,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:46:32,986 INFO L85 PathProgramCache]: Analyzing trace with hash 622073858, now seen corresponding path program 1 times [2024-10-24 11:46:32,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:46:32,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [849626206] [2024-10-24 11:46:32,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:46:32,987 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:46:32,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:46:32,988 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:46:32,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-24 11:46:33,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:33,326 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 11:46:33,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:46:33,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 40 [2024-10-24 11:46:33,531 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 8 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-24 11:46:33,532 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:46:33,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 22 [2024-10-24 11:46:33,831 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-24 11:46:33,831 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:46:33,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [849626206] [2024-10-24 11:46:33,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [849626206] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:46:33,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:46:33,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-10-24 11:46:33,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317355223] [2024-10-24 11:46:33,832 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:46:33,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 11:46:33,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:46:33,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 11:46:33,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:46:33,834 INFO L87 Difference]: Start difference. First operand 88 states and 124 transitions. Second operand has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 12 states have internal predecessors, (63), 4 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-10-24 11:46:35,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:46:35,090 INFO L93 Difference]: Finished difference Result 188 states and 262 transitions. [2024-10-24 11:46:35,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 11:46:35,090 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 12 states have internal predecessors, (63), 4 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 86 [2024-10-24 11:46:35,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:46:35,091 INFO L225 Difference]: With dead ends: 188 [2024-10-24 11:46:35,092 INFO L226 Difference]: Without dead ends: 90 [2024-10-24 11:46:35,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2024-10-24 11:46:35,094 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 124 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:46:35,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 582 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 11:46:35,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-24 11:46:35,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2024-10-24 11:46:35,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 77 states have (on average 1.3506493506493507) internal successors, (104), 77 states have internal predecessors, (104), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:46:35,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 122 transitions. [2024-10-24 11:46:35,107 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 122 transitions. Word has length 86 [2024-10-24 11:46:35,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:46:35,107 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 122 transitions. [2024-10-24 11:46:35,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 12 states have internal predecessors, (63), 4 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-10-24 11:46:35,107 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 122 transitions. [2024-10-24 11:46:35,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-24 11:46:35,108 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:46:35,108 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:46:35,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-24 11:46:35,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:46:35,309 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:46:35,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:46:35,310 INFO L85 PathProgramCache]: Analyzing trace with hash 545173060, now seen corresponding path program 1 times [2024-10-24 11:46:35,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:46:35,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1779618662] [2024-10-24 11:46:35,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:46:35,311 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:46:35,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:46:35,314 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:46:35,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-24 11:46:35,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:35,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:46:35,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:46:35,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2024-10-24 11:46:35,774 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:46:35,774 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:46:35,775 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:46:35,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1779618662] [2024-10-24 11:46:35,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1779618662] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:46:35,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:46:35,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:46:35,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241027793] [2024-10-24 11:46:35,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:46:35,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:46:35,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:46:35,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:46:35,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:46:35,777 INFO L87 Difference]: Start difference. First operand 88 states and 122 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:46:36,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:46:36,170 INFO L93 Difference]: Finished difference Result 173 states and 241 transitions. [2024-10-24 11:46:36,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:46:36,172 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 86 [2024-10-24 11:46:36,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:46:36,174 INFO L225 Difference]: With dead ends: 173 [2024-10-24 11:46:36,174 INFO L226 Difference]: Without dead ends: 86 [2024-10-24 11:46:36,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:46:36,175 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:46:36,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 218 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:46:36,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-24 11:46:36,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-24 11:46:36,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 75 states have (on average 1.3466666666666667) internal successors, (101), 75 states have internal predecessors, (101), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:46:36,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 119 transitions. [2024-10-24 11:46:36,182 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 119 transitions. Word has length 86 [2024-10-24 11:46:36,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:46:36,182 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 119 transitions. [2024-10-24 11:46:36,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:46:36,183 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 119 transitions. [2024-10-24 11:46:36,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-24 11:46:36,186 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:46:36,187 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:46:36,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-10-24 11:46:36,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:46:36,388 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:46:36,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:46:36,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1992389923, now seen corresponding path program 1 times [2024-10-24 11:46:36,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:46:36,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1215567450] [2024-10-24 11:46:36,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:46:36,389 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:46:36,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:46:36,393 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:46:36,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-24 11:46:36,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:36,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:46:36,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:46:36,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-24 11:46:36,725 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:46:36,726 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:46:36,726 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:46:36,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1215567450] [2024-10-24 11:46:36,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1215567450] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:46:36,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:46:36,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:46:36,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555912481] [2024-10-24 11:46:36,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:46:36,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:46:36,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:46:36,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:46:36,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:46:36,728 INFO L87 Difference]: Start difference. First operand 86 states and 119 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:46:36,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:46:36,957 INFO L93 Difference]: Finished difference Result 171 states and 237 transitions. [2024-10-24 11:46:36,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:46:36,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2024-10-24 11:46:36,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:46:36,958 INFO L225 Difference]: With dead ends: 171 [2024-10-24 11:46:36,958 INFO L226 Difference]: Without dead ends: 86 [2024-10-24 11:46:36,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:46:36,960 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:46:36,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 215 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:46:36,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-24 11:46:36,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-24 11:46:36,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 75 states have (on average 1.3333333333333333) internal successors, (100), 75 states have internal predecessors, (100), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:46:36,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 118 transitions. [2024-10-24 11:46:36,971 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 118 transitions. Word has length 91 [2024-10-24 11:46:36,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:46:36,972 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 118 transitions. [2024-10-24 11:46:36,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:46:36,972 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 118 transitions. [2024-10-24 11:46:36,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-24 11:46:36,973 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:46:36,973 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:46:36,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-24 11:46:37,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:46:37,174 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:46:37,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:46:37,174 INFO L85 PathProgramCache]: Analyzing trace with hash -2126403429, now seen corresponding path program 1 times [2024-10-24 11:46:37,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:46:37,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1065298980] [2024-10-24 11:46:37,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:46:37,175 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:46:37,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:46:37,176 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:46:37,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-24 11:46:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:37,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:46:37,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:46:37,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-24 11:46:37,596 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:46:37,596 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:46:37,597 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:46:37,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1065298980] [2024-10-24 11:46:37,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1065298980] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:46:37,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:46:37,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:46:37,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531018865] [2024-10-24 11:46:37,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:46:37,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:46:37,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:46:37,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:46:37,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:46:37,599 INFO L87 Difference]: Start difference. First operand 86 states and 118 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:46:37,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:46:37,864 INFO L93 Difference]: Finished difference Result 171 states and 235 transitions. [2024-10-24 11:46:37,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:46:37,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2024-10-24 11:46:37,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:46:37,866 INFO L225 Difference]: With dead ends: 171 [2024-10-24 11:46:37,866 INFO L226 Difference]: Without dead ends: 86 [2024-10-24 11:46:37,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:46:37,867 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:46:37,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 213 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:46:37,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-24 11:46:37,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-24 11:46:37,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 75 states have (on average 1.32) internal successors, (99), 75 states have internal predecessors, (99), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:46:37,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 117 transitions. [2024-10-24 11:46:37,877 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 117 transitions. Word has length 91 [2024-10-24 11:46:37,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:46:37,881 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 117 transitions. [2024-10-24 11:46:37,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:46:37,882 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 117 transitions. [2024-10-24 11:46:37,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-24 11:46:37,882 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:46:37,883 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:46:37,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-24 11:46:38,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:46:38,083 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:46:38,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:46:38,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1907548711, now seen corresponding path program 1 times [2024-10-24 11:46:38,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:46:38,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1473593687] [2024-10-24 11:46:38,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:46:38,084 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:46:38,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:46:38,088 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:46:38,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-24 11:46:38,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:38,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:46:38,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:46:38,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-24 11:46:38,513 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:46:38,513 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:46:38,513 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:46:38,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1473593687] [2024-10-24 11:46:38,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1473593687] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:46:38,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:46:38,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:46:38,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505815102] [2024-10-24 11:46:38,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:46:38,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:46:38,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:46:38,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:46:38,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:46:38,515 INFO L87 Difference]: Start difference. First operand 86 states and 117 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:46:38,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:46:38,928 INFO L93 Difference]: Finished difference Result 171 states and 233 transitions. [2024-10-24 11:46:38,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:46:38,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2024-10-24 11:46:38,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:46:38,929 INFO L225 Difference]: With dead ends: 171 [2024-10-24 11:46:38,929 INFO L226 Difference]: Without dead ends: 86 [2024-10-24 11:46:38,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:46:38,930 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:46:38,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 211 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:46:38,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-24 11:46:38,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-24 11:46:38,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 75 states have (on average 1.3066666666666666) internal successors, (98), 75 states have internal predecessors, (98), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:46:38,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 116 transitions. [2024-10-24 11:46:38,937 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 116 transitions. Word has length 91 [2024-10-24 11:46:38,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:46:38,937 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 116 transitions. [2024-10-24 11:46:38,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:46:38,938 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 116 transitions. [2024-10-24 11:46:38,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-24 11:46:38,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:46:38,940 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:46:38,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-24 11:46:39,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:46:39,141 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:46:39,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:46:39,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1569770135, now seen corresponding path program 1 times [2024-10-24 11:46:39,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:46:39,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2081405971] [2024-10-24 11:46:39,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:46:39,142 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:46:39,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:46:39,143 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:46:39,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-24 11:46:39,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:39,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:46:39,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:46:39,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2024-10-24 11:46:39,520 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:46:39,521 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:46:39,521 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:46:39,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2081405971] [2024-10-24 11:46:39,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2081405971] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:46:39,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:46:39,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:46:39,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415262363] [2024-10-24 11:46:39,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:46:39,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:46:39,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:46:39,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:46:39,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:46:39,522 INFO L87 Difference]: Start difference. First operand 86 states and 116 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:46:40,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:46:40,052 INFO L93 Difference]: Finished difference Result 169 states and 228 transitions. [2024-10-24 11:46:40,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:46:40,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2024-10-24 11:46:40,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:46:40,055 INFO L225 Difference]: With dead ends: 169 [2024-10-24 11:46:40,055 INFO L226 Difference]: Without dead ends: 84 [2024-10-24 11:46:40,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:46:40,056 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:46:40,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 205 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 11:46:40,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-24 11:46:40,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-24 11:46:40,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.2876712328767124) internal successors, (94), 73 states have internal predecessors, (94), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:46:40,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 112 transitions. [2024-10-24 11:46:40,067 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 112 transitions. Word has length 91 [2024-10-24 11:46:40,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:46:40,068 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 112 transitions. [2024-10-24 11:46:40,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:46:40,068 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 112 transitions. [2024-10-24 11:46:40,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-24 11:46:40,073 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:46:40,073 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:46:40,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-10-24 11:46:40,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:46:40,274 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:46:40,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:46:40,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1458884140, now seen corresponding path program 1 times [2024-10-24 11:46:40,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:46:40,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1806927754] [2024-10-24 11:46:40,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:46:40,275 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:46:40,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:46:40,278 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:46:40,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-24 11:46:40,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:40,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:46:40,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:46:40,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-24 11:46:40,670 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:46:40,670 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:46:40,670 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:46:40,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1806927754] [2024-10-24 11:46:40,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1806927754] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:46:40,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:46:40,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:46:40,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551127130] [2024-10-24 11:46:40,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:46:40,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:46:40,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:46:40,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:46:40,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:46:40,672 INFO L87 Difference]: Start difference. First operand 84 states and 112 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:46:40,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:46:40,994 INFO L93 Difference]: Finished difference Result 167 states and 223 transitions. [2024-10-24 11:46:40,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:46:40,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2024-10-24 11:46:40,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:46:40,995 INFO L225 Difference]: With dead ends: 167 [2024-10-24 11:46:40,995 INFO L226 Difference]: Without dead ends: 84 [2024-10-24 11:46:40,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:46:40,996 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:46:40,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 202 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:46:40,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-24 11:46:41,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-24 11:46:41,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.273972602739726) internal successors, (93), 73 states have internal predecessors, (93), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:46:41,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 111 transitions. [2024-10-24 11:46:41,002 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 111 transitions. Word has length 96 [2024-10-24 11:46:41,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:46:41,002 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 111 transitions. [2024-10-24 11:46:41,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:46:41,002 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 111 transitions. [2024-10-24 11:46:41,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-24 11:46:41,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:46:41,003 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:46:41,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-10-24 11:46:41,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:46:41,204 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:46:41,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:46:41,204 INFO L85 PathProgramCache]: Analyzing trace with hash -535260566, now seen corresponding path program 1 times [2024-10-24 11:46:41,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:46:41,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [531043105] [2024-10-24 11:46:41,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:46:41,205 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:46:41,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:46:41,206 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:46:41,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-24 11:46:41,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:41,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:46:41,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:46:41,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-24 11:46:41,653 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:46:41,653 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:46:41,653 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:46:41,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [531043105] [2024-10-24 11:46:41,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [531043105] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:46:41,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:46:41,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:46:41,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21706891] [2024-10-24 11:46:41,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:46:41,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:46:41,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:46:41,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:46:41,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:46:41,655 INFO L87 Difference]: Start difference. First operand 84 states and 111 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:46:41,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:46:41,905 INFO L93 Difference]: Finished difference Result 167 states and 221 transitions. [2024-10-24 11:46:41,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:46:41,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2024-10-24 11:46:41,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:46:41,906 INFO L225 Difference]: With dead ends: 167 [2024-10-24 11:46:41,906 INFO L226 Difference]: Without dead ends: 84 [2024-10-24 11:46:41,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:46:41,907 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:46:41,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:46:41,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-24 11:46:41,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-24 11:46:41,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.2602739726027397) internal successors, (92), 73 states have internal predecessors, (92), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:46:41,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 110 transitions. [2024-10-24 11:46:41,915 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 110 transitions. Word has length 96 [2024-10-24 11:46:41,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:46:41,915 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 110 transitions. [2024-10-24 11:46:41,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:46:41,916 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 110 transitions. [2024-10-24 11:46:41,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-24 11:46:41,917 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:46:41,917 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:46:41,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-10-24 11:46:42,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:46:42,118 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:46:42,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:46:42,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1546377816, now seen corresponding path program 1 times [2024-10-24 11:46:42,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:46:42,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [129877281] [2024-10-24 11:46:42,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:46:42,119 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:46:42,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:46:42,120 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:46:42,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-24 11:46:42,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:42,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-10-24 11:46:42,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:46:42,813 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 19 treesize of output 1 [2024-10-24 11:46:42,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-10-24 11:46:42,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-10-24 11:46:42,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-10-24 11:46:43,400 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:46:43,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 53 [2024-10-24 11:46:43,765 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-24 11:46:43,765 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:46:43,765 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:46:43,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [129877281] [2024-10-24 11:46:43,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [129877281] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:46:43,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:46:43,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-24 11:46:43,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182800700] [2024-10-24 11:46:43,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:46:43,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 11:46:43,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:46:43,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 11:46:43,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-10-24 11:46:43,767 INFO L87 Difference]: Start difference. First operand 84 states and 110 transitions. Second operand has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 15 states have internal predecessors, (57), 2 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:46:46,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:46:46,620 INFO L93 Difference]: Finished difference Result 243 states and 314 transitions. [2024-10-24 11:46:46,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-24 11:46:46,621 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 15 states have internal predecessors, (57), 2 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 96 [2024-10-24 11:46:46,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:46:46,622 INFO L225 Difference]: With dead ends: 243 [2024-10-24 11:46:46,622 INFO L226 Difference]: Without dead ends: 160 [2024-10-24 11:46:46,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2024-10-24 11:46:46,623 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 146 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:46:46,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 522 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-24 11:46:46,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-10-24 11:46:46,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 91. [2024-10-24 11:46:46,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 79 states have (on average 1.240506329113924) internal successors, (98), 79 states have internal predecessors, (98), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:46:46,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 116 transitions. [2024-10-24 11:46:46,633 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 116 transitions. Word has length 96 [2024-10-24 11:46:46,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:46:46,633 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 116 transitions. [2024-10-24 11:46:46,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 15 states have internal predecessors, (57), 2 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:46:46,634 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 116 transitions. [2024-10-24 11:46:46,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-24 11:46:46,634 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:46:46,635 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:46:46,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-24 11:46:46,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:46:46,835 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:46:46,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:46:46,836 INFO L85 PathProgramCache]: Analyzing trace with hash 769143453, now seen corresponding path program 1 times [2024-10-24 11:46:46,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:46:46,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [332436612] [2024-10-24 11:46:46,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:46:46,836 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:46:46,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:46:46,838 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:46:46,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-24 11:46:47,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:47,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-24 11:46:47,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:46:47,218 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:46:47,218 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:46:47,219 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:46:47,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [332436612] [2024-10-24 11:46:47,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [332436612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:46:47,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:46:47,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:46:47,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904566354] [2024-10-24 11:46:47,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:46:47,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:46:47,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:46:47,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:46:47,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:46:47,220 INFO L87 Difference]: Start difference. First operand 91 states and 116 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:46:47,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:46:47,874 INFO L93 Difference]: Finished difference Result 181 states and 231 transitions. [2024-10-24 11:46:47,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:46:47,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2024-10-24 11:46:47,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:46:47,876 INFO L225 Difference]: With dead ends: 181 [2024-10-24 11:46:47,877 INFO L226 Difference]: Without dead ends: 91 [2024-10-24 11:46:47,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:46:47,878 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:46:47,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 11:46:47,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-24 11:46:47,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-24 11:46:47,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 79 states have internal predecessors, (97), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:46:47,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 115 transitions. [2024-10-24 11:46:47,885 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 115 transitions. Word has length 96 [2024-10-24 11:46:47,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:46:47,886 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 115 transitions. [2024-10-24 11:46:47,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:46:47,886 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 115 transitions. [2024-10-24 11:46:47,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-24 11:46:47,887 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:46:47,887 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:46:47,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-10-24 11:46:48,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:46:48,087 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:46:48,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:46:48,088 INFO L85 PathProgramCache]: Analyzing trace with hash 909692063, now seen corresponding path program 1 times [2024-10-24 11:46:48,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:46:48,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1265784259] [2024-10-24 11:46:48,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:46:48,089 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:46:48,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:46:48,091 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:46:48,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-24 11:47:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:11,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-24 11:47:11,992 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:47:11,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-24 11:47:12,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 38 [2024-10-24 11:47:12,603 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:47:12,604 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:47:12,604 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:47:12,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1265784259] [2024-10-24 11:47:12,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1265784259] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:47:12,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:47:12,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-24 11:47:12,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636131672] [2024-10-24 11:47:12,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:47:12,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 11:47:12,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:47:12,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 11:47:12,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:47:12,606 INFO L87 Difference]: Start difference. First operand 91 states and 115 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:47:15,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:47:15,117 INFO L93 Difference]: Finished difference Result 262 states and 333 transitions. [2024-10-24 11:47:15,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-24 11:47:15,118 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2024-10-24 11:47:15,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:47:15,119 INFO L225 Difference]: With dead ends: 262 [2024-10-24 11:47:15,119 INFO L226 Difference]: Without dead ends: 172 [2024-10-24 11:47:15,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2024-10-24 11:47:15,120 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 80 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:47:15,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 698 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 973 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-24 11:47:15,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-10-24 11:47:15,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 167. [2024-10-24 11:47:15,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 144 states have (on average 1.2291666666666667) internal successors, (177), 144 states have internal predecessors, (177), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 11:47:15,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 213 transitions. [2024-10-24 11:47:15,132 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 213 transitions. Word has length 96 [2024-10-24 11:47:15,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:47:15,133 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 213 transitions. [2024-10-24 11:47:15,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:47:15,133 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 213 transitions. [2024-10-24 11:47:15,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-24 11:47:15,134 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:47:15,134 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:47:15,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-10-24 11:47:15,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:47:15,335 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:47:15,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:47:15,335 INFO L85 PathProgramCache]: Analyzing trace with hash -291813686, now seen corresponding path program 1 times [2024-10-24 11:47:15,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:47:15,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2096857022] [2024-10-24 11:47:15,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:47:15,336 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:47:15,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:47:15,337 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:47:15,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-24 11:47:15,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:15,684 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-24 11:47:15,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:47:15,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 38 [2024-10-24 11:47:16,052 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:47:16,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 37 [2024-10-24 11:47:16,124 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:47:16,125 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:47:16,125 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:47:16,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2096857022] [2024-10-24 11:47:16,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2096857022] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:47:16,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:47:16,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 11:47:16,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724096399] [2024-10-24 11:47:16,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:47:16,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 11:47:16,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:47:16,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 11:47:16,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:47:16,127 INFO L87 Difference]: Start difference. First operand 167 states and 213 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:47:18,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:47:18,188 INFO L93 Difference]: Finished difference Result 338 states and 429 transitions. [2024-10-24 11:47:18,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-24 11:47:18,189 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2024-10-24 11:47:18,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:47:18,190 INFO L225 Difference]: With dead ends: 338 [2024-10-24 11:47:18,190 INFO L226 Difference]: Without dead ends: 172 [2024-10-24 11:47:18,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2024-10-24 11:47:18,191 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 84 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-24 11:47:18,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 607 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-24 11:47:18,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-10-24 11:47:18,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 167. [2024-10-24 11:47:18,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 144 states have (on average 1.2222222222222223) internal successors, (176), 144 states have internal predecessors, (176), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 11:47:18,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 212 transitions. [2024-10-24 11:47:18,203 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 212 transitions. Word has length 96 [2024-10-24 11:47:18,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:47:18,203 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 212 transitions. [2024-10-24 11:47:18,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:47:18,204 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 212 transitions. [2024-10-24 11:47:18,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-24 11:47:18,204 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:47:18,204 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:47:18,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-10-24 11:47:18,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:47:18,405 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:47:18,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:47:18,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1302930936, now seen corresponding path program 1 times [2024-10-24 11:47:18,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:47:18,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [605302217] [2024-10-24 11:47:18,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:47:18,406 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:47:18,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:47:18,407 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:47:18,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process