./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-42.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-42.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 a5b1459048f386d4d91aa4d1371a4e9edda9e34036124ce3aa9f0ad83bf94de0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 17:50:18,235 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 17:50:18,311 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 17:50:18,314 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 17:50:18,316 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 17:50:18,337 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 17:50:18,338 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 17:50:18,338 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 17:50:18,339 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 17:50:18,340 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 17:50:18,340 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 17:50:18,340 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 17:50:18,341 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 17:50:18,341 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 17:50:18,342 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 17:50:18,343 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 17:50:18,343 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 17:50:18,343 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 17:50:18,343 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 17:50:18,344 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 17:50:18,346 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 17:50:18,347 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 17:50:18,347 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 17:50:18,347 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 17:50:18,347 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 17:50:18,348 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 17:50:18,348 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 17:50:18,348 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 17:50:18,348 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 17:50:18,348 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 17:50:18,349 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 17:50:18,349 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 17:50:18,349 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:50:18,349 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 17:50:18,349 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 17:50:18,349 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 17:50:18,349 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 17:50:18,350 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 17:50:18,350 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 17:50:18,350 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 17:50:18,350 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 17:50:18,351 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 17:50:18,351 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 -> a5b1459048f386d4d91aa4d1371a4e9edda9e34036124ce3aa9f0ad83bf94de0 [2024-11-16 17:50:18,601 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 17:50:18,623 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 17:50:18,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 17:50:18,629 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 17:50:18,629 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 17:50:18,630 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-42.i [2024-11-16 17:50:19,962 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 17:50:20,163 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 17:50:20,164 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-42.i [2024-11-16 17:50:20,180 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c854ce0b/2ac0368f919d45da9a061ea9fa13c472/FLAGd92496eff [2024-11-16 17:50:20,200 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c854ce0b/2ac0368f919d45da9a061ea9fa13c472 [2024-11-16 17:50:20,204 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 17:50:20,205 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 17:50:20,206 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 17:50:20,208 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 17:50:20,213 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 17:50:20,213 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:50:20" (1/1) ... [2024-11-16 17:50:20,214 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6563e8bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:50:20, skipping insertion in model container [2024-11-16 17:50:20,214 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:50:20" (1/1) ... [2024-11-16 17:50:20,238 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 17:50:20,408 WARN L250 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_operatoramount_amount50_file-42.i[915,928] [2024-11-16 17:50:20,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:50:20,484 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 17:50:20,499 WARN L250 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_operatoramount_amount50_file-42.i[915,928] [2024-11-16 17:50:20,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:50:20,538 INFO L204 MainTranslator]: Completed translation [2024-11-16 17:50:20,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:50:20 WrapperNode [2024-11-16 17:50:20,539 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 17:50:20,540 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 17:50:20,540 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 17:50:20,540 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 17:50:20,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:50:20" (1/1) ... [2024-11-16 17:50:20,553 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:50:20" (1/1) ... [2024-11-16 17:50:20,585 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2024-11-16 17:50:20,586 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 17:50:20,586 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 17:50:20,587 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 17:50:20,587 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 17:50:20,597 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:50:20" (1/1) ... [2024-11-16 17:50:20,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:50:20" (1/1) ... [2024-11-16 17:50:20,600 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:50:20" (1/1) ... [2024-11-16 17:50:20,617 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 17:50:20,618 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:50:20" (1/1) ... [2024-11-16 17:50:20,618 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:50:20" (1/1) ... [2024-11-16 17:50:20,629 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:50:20" (1/1) ... [2024-11-16 17:50:20,630 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:50:20" (1/1) ... [2024-11-16 17:50:20,635 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:50:20" (1/1) ... [2024-11-16 17:50:20,637 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:50:20" (1/1) ... [2024-11-16 17:50:20,641 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 17:50:20,646 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 17:50:20,646 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 17:50:20,646 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 17:50:20,647 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:50:20" (1/1) ... [2024-11-16 17:50:20,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:50:20,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:50:20,678 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-11-16 17:50:20,693 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-11-16 17:50:20,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 17:50:20,730 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 17:50:20,730 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 17:50:20,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 17:50:20,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 17:50:20,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 17:50:20,800 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 17:50:20,802 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 17:50:21,170 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-16 17:50:21,171 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 17:50:21,186 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 17:50:21,187 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 17:50:21,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:50:21 BoogieIcfgContainer [2024-11-16 17:50:21,187 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 17:50:21,189 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 17:50:21,189 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 17:50:21,192 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 17:50:21,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 05:50:20" (1/3) ... [2024-11-16 17:50:21,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7747c51f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:50:21, skipping insertion in model container [2024-11-16 17:50:21,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:50:20" (2/3) ... [2024-11-16 17:50:21,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7747c51f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:50:21, skipping insertion in model container [2024-11-16 17:50:21,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:50:21" (3/3) ... [2024-11-16 17:50:21,196 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-42.i [2024-11-16 17:50:21,209 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 17:50:21,210 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 17:50:21,274 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 17:50:21,282 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;@1d40d23e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 17:50:21,283 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 17:50:21,287 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 42 states have internal predecessors, (57), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-16 17:50:21,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-16 17:50:21,297 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:50:21,298 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 17:50:21,299 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:50:21,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:50:21,307 INFO L85 PathProgramCache]: Analyzing trace with hash 908835192, now seen corresponding path program 1 times [2024-11-16 17:50:21,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:50:21,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190551084] [2024-11-16 17:50:21,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:50:21,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:50:21,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:21,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:50:21,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:21,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:50:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:21,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:50:21,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:21,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:50:21,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:21,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:50:21,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:21,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:50:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:21,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:50:21,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:21,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:50:21,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:21,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:50:21,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:21,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 17:50:21,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:21,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 17:50:21,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:21,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 17:50:21,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:21,661 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 17:50:21,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:50:21,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190551084] [2024-11-16 17:50:21,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190551084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:50:21,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:50:21,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 17:50:21,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790599541] [2024-11-16 17:50:21,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:50:21,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 17:50:21,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:50:21,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 17:50:21,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 17:50:21,698 INFO L87 Difference]: Start difference. First operand has 56 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 42 states have internal predecessors, (57), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 17:50:21,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:50:21,722 INFO L93 Difference]: Finished difference Result 104 states and 167 transitions. [2024-11-16 17:50:21,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 17:50:21,724 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 89 [2024-11-16 17:50:21,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:50:21,732 INFO L225 Difference]: With dead ends: 104 [2024-11-16 17:50:21,733 INFO L226 Difference]: Without dead ends: 51 [2024-11-16 17:50:21,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 17:50:21,742 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 17:50:21,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 17:50:21,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-16 17:50:21,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-16 17:50:21,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-16 17:50:21,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2024-11-16 17:50:21,780 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 89 [2024-11-16 17:50:21,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:50:21,781 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions. [2024-11-16 17:50:21,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 17:50:21,781 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions. [2024-11-16 17:50:21,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-16 17:50:21,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:50:21,785 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 17:50:21,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 17:50:21,786 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:50:21,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:50:21,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1113837414, now seen corresponding path program 1 times [2024-11-16 17:50:21,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:50:21,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320082586] [2024-11-16 17:50:21,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:50:21,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:50:21,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:22,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:50:22,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:22,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:50:22,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:22,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:50:22,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:22,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:50:22,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:22,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:50:22,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:22,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:50:22,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:22,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:50:22,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:22,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:50:22,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:22,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:50:22,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:22,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 17:50:22,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:22,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 17:50:22,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:22,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 17:50:22,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:22,250 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 17:50:22,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:50:22,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320082586] [2024-11-16 17:50:22,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320082586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:50:22,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:50:22,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 17:50:22,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014581109] [2024-11-16 17:50:22,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:50:22,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 17:50:22,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:50:22,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 17:50:22,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 17:50:22,255 INFO L87 Difference]: Start difference. First operand 51 states and 73 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 17:50:22,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:50:22,373 INFO L93 Difference]: Finished difference Result 149 states and 215 transitions. [2024-11-16 17:50:22,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 17:50:22,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 89 [2024-11-16 17:50:22,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:50:22,375 INFO L225 Difference]: With dead ends: 149 [2024-11-16 17:50:22,375 INFO L226 Difference]: Without dead ends: 101 [2024-11-16 17:50:22,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 17:50:22,377 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 73 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 17:50:22,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 201 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 17:50:22,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-16 17:50:22,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 78. [2024-11-16 17:50:22,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-16 17:50:22,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 111 transitions. [2024-11-16 17:50:22,390 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 111 transitions. Word has length 89 [2024-11-16 17:50:22,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:50:22,391 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 111 transitions. [2024-11-16 17:50:22,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 17:50:22,391 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 111 transitions. [2024-11-16 17:50:22,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-16 17:50:22,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:50:22,393 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 17:50:22,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 17:50:22,394 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:50:22,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:50:22,394 INFO L85 PathProgramCache]: Analyzing trace with hash -646646993, now seen corresponding path program 1 times [2024-11-16 17:50:22,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:50:22,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949527758] [2024-11-16 17:50:22,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:50:22,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:50:22,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:22,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:50:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:22,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:50:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:22,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:50:22,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:22,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:50:22,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:22,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:50:22,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:22,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:50:22,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:22,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:50:22,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:22,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:50:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:22,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:50:22,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:22,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 17:50:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:22,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 17:50:22,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:22,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 17:50:22,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:22,754 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 17:50:22,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:50:22,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949527758] [2024-11-16 17:50:22,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949527758] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:50:22,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:50:22,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 17:50:22,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876090722] [2024-11-16 17:50:22,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:50:22,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 17:50:22,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:50:22,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 17:50:22,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 17:50:22,757 INFO L87 Difference]: Start difference. First operand 78 states and 111 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 17:50:23,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:50:23,017 INFO L93 Difference]: Finished difference Result 220 states and 320 transitions. [2024-11-16 17:50:23,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 17:50:23,018 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 90 [2024-11-16 17:50:23,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:50:23,021 INFO L225 Difference]: With dead ends: 220 [2024-11-16 17:50:23,022 INFO L226 Difference]: Without dead ends: 172 [2024-11-16 17:50:23,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-16 17:50:23,023 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 104 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 17:50:23,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 304 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 17:50:23,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-16 17:50:23,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 123. [2024-11-16 17:50:23,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 83 states have (on average 1.2771084337349397) internal successors, (106), 83 states have internal predecessors, (106), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 17:50:23,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 178 transitions. [2024-11-16 17:50:23,046 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 178 transitions. Word has length 90 [2024-11-16 17:50:23,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:50:23,046 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 178 transitions. [2024-11-16 17:50:23,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 17:50:23,046 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 178 transitions. [2024-11-16 17:50:23,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-16 17:50:23,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:50:23,047 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 17:50:23,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 17:50:23,048 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:50:23,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:50:23,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1157181170, now seen corresponding path program 1 times [2024-11-16 17:50:23,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:50:23,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519015670] [2024-11-16 17:50:23,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:50:23,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:50:23,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:23,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:50:23,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:23,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:50:23,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:23,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:50:23,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:23,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:50:23,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:23,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:50:23,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:23,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:50:23,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:23,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:50:23,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:23,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:50:23,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:23,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:50:23,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:23,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 17:50:23,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:23,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 17:50:23,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:23,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 17:50:23,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:23,170 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 17:50:23,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:50:23,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519015670] [2024-11-16 17:50:23,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519015670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:50:23,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:50:23,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 17:50:23,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494768936] [2024-11-16 17:50:23,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:50:23,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 17:50:23,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:50:23,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 17:50:23,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 17:50:23,177 INFO L87 Difference]: Start difference. First operand 123 states and 178 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 17:50:23,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:50:23,215 INFO L93 Difference]: Finished difference Result 216 states and 315 transitions. [2024-11-16 17:50:23,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 17:50:23,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 90 [2024-11-16 17:50:23,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:50:23,221 INFO L225 Difference]: With dead ends: 216 [2024-11-16 17:50:23,221 INFO L226 Difference]: Without dead ends: 123 [2024-11-16 17:50:23,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 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-11-16 17:50:23,223 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 17:50:23,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 17:50:23,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-16 17:50:23,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-16 17:50:23,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 83 states have (on average 1.2530120481927711) internal successors, (104), 83 states have internal predecessors, (104), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 17:50:23,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 176 transitions. [2024-11-16 17:50:23,250 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 176 transitions. Word has length 90 [2024-11-16 17:50:23,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:50:23,250 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 176 transitions. [2024-11-16 17:50:23,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 17:50:23,251 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 176 transitions. [2024-11-16 17:50:23,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-16 17:50:23,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:50:23,252 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 17:50:23,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 17:50:23,252 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:50:23,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:50:23,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1353694675, now seen corresponding path program 1 times [2024-11-16 17:50:23,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:50:23,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498596673] [2024-11-16 17:50:23,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:50:23,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:50:23,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:23,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:50:23,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:23,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:50:23,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:23,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:50:23,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:23,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:50:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:23,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:50:23,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:23,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:50:23,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:23,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:50:23,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:23,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:50:23,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:23,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:50:23,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:23,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 17:50:23,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:23,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 17:50:23,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:23,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 17:50:23,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:23,765 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 51 proven. 9 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-16 17:50:23,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:50:23,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498596673] [2024-11-16 17:50:23,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498596673] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 17:50:23,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469752212] [2024-11-16 17:50:23,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:50:23,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 17:50:23,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:50:23,770 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-11-16 17:50:23,771 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-11-16 17:50:23,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:23,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-16 17:50:23,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:50:24,098 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 149 proven. 9 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-16 17:50:24,099 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 17:50:24,413 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 51 proven. 12 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2024-11-16 17:50:24,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469752212] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 17:50:24,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 17:50:24,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2024-11-16 17:50:24,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872710347] [2024-11-16 17:50:24,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 17:50:24,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-16 17:50:24,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:50:24,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-16 17:50:24,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-16 17:50:24,416 INFO L87 Difference]: Start difference. First operand 123 states and 176 transitions. Second operand has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 15 states have internal predecessors, (64), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 17:50:25,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:50:25,055 INFO L93 Difference]: Finished difference Result 393 states and 522 transitions. [2024-11-16 17:50:25,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-16 17:50:25,055 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 15 states have internal predecessors, (64), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 90 [2024-11-16 17:50:25,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:50:25,057 INFO L225 Difference]: With dead ends: 393 [2024-11-16 17:50:25,058 INFO L226 Difference]: Without dead ends: 345 [2024-11-16 17:50:25,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 198 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=482, Invalid=1410, Unknown=0, NotChecked=0, Total=1892 [2024-11-16 17:50:25,060 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 230 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 17:50:25,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 410 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 17:50:25,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-11-16 17:50:25,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 209. [2024-11-16 17:50:25,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 148 states have (on average 1.2297297297297298) internal successors, (182), 148 states have internal predecessors, (182), 48 states have call successors, (48), 12 states have call predecessors, (48), 12 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-16 17:50:25,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 278 transitions. [2024-11-16 17:50:25,105 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 278 transitions. Word has length 90 [2024-11-16 17:50:25,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:50:25,106 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 278 transitions. [2024-11-16 17:50:25,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 15 states have internal predecessors, (64), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 17:50:25,106 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 278 transitions. [2024-11-16 17:50:25,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-16 17:50:25,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:50:25,107 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 17:50:25,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 17:50:25,308 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-11-16 17:50:25,308 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:50:25,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:50:25,309 INFO L85 PathProgramCache]: Analyzing trace with hash 153857134, now seen corresponding path program 1 times [2024-11-16 17:50:25,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:50:25,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092895261] [2024-11-16 17:50:25,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:50:25,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:50:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 17:50:25,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [835805258] [2024-11-16 17:50:25,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:50:25,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 17:50:25,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:50:25,348 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 17:50:25,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 17:50:25,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:25,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-16 17:50:25,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:50:25,834 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 87 proven. 27 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-11-16 17:50:25,834 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 17:50:26,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:50:26,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092895261] [2024-11-16 17:50:26,212 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 17:50:26,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835805258] [2024-11-16 17:50:26,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835805258] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 17:50:26,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-16 17:50:26,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2024-11-16 17:50:26,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240318175] [2024-11-16 17:50:26,213 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-16 17:50:26,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 17:50:26,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:50:26,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 17:50:26,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=137, Unknown=3, NotChecked=0, Total=182 [2024-11-16 17:50:26,214 INFO L87 Difference]: Start difference. First operand 209 states and 278 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 17:50:26,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:50:26,686 INFO L93 Difference]: Finished difference Result 640 states and 829 transitions. [2024-11-16 17:50:26,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-16 17:50:26,687 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 90 [2024-11-16 17:50:26,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:50:26,689 INFO L225 Difference]: With dead ends: 640 [2024-11-16 17:50:26,689 INFO L226 Difference]: Without dead ends: 532 [2024-11-16 17:50:26,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=432, Unknown=3, NotChecked=0, Total=600 [2024-11-16 17:50:26,691 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 131 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 17:50:26,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 509 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 17:50:26,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2024-11-16 17:50:26,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 434. [2024-11-16 17:50:26,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 318 states have (on average 1.2327044025157232) internal successors, (392), 320 states have internal predecessors, (392), 88 states have call successors, (88), 27 states have call predecessors, (88), 27 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-16 17:50:26,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 568 transitions. [2024-11-16 17:50:26,728 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 568 transitions. Word has length 90 [2024-11-16 17:50:26,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:50:26,728 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 568 transitions. [2024-11-16 17:50:26,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 17:50:26,729 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 568 transitions. [2024-11-16 17:50:26,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-16 17:50:26,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:50:26,733 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 17:50:26,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-16 17:50:26,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-16 17:50:26,934 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:50:26,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:50:26,935 INFO L85 PathProgramCache]: Analyzing trace with hash -351701491, now seen corresponding path program 1 times [2024-11-16 17:50:26,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:50:26,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064047747] [2024-11-16 17:50:26,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:50:26,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:50:26,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 17:50:26,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1068112764] [2024-11-16 17:50:26,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:50:26,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 17:50:26,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:50:26,982 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 17:50:26,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 17:50:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:27,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-16 17:50:27,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:50:27,723 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 87 proven. 27 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-11-16 17:50:27,724 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 17:50:27,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:50:27,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064047747] [2024-11-16 17:50:27,997 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 17:50:27,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068112764] [2024-11-16 17:50:27,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068112764] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 17:50:27,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-16 17:50:27,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2024-11-16 17:50:27,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219110643] [2024-11-16 17:50:27,997 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-16 17:50:27,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 17:50:27,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:50:27,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 17:50:27,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=158, Unknown=1, NotChecked=0, Total=210 [2024-11-16 17:50:27,999 INFO L87 Difference]: Start difference. First operand 434 states and 568 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 17:50:28,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:50:28,616 INFO L93 Difference]: Finished difference Result 855 states and 1126 transitions. [2024-11-16 17:50:28,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-16 17:50:28,617 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 90 [2024-11-16 17:50:28,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:50:28,621 INFO L225 Difference]: With dead ends: 855 [2024-11-16 17:50:28,621 INFO L226 Difference]: Without dead ends: 690 [2024-11-16 17:50:28,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=466, Unknown=1, NotChecked=0, Total=650 [2024-11-16 17:50:28,623 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 133 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 35 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 17:50:28,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 507 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 404 Invalid, 6 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 17:50:28,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2024-11-16 17:50:28,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 547. [2024-11-16 17:50:28,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 399 states have (on average 1.2255639097744362) internal successors, (489), 401 states have internal predecessors, (489), 112 states have call successors, (112), 35 states have call predecessors, (112), 35 states have return successors, (112), 110 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-16 17:50:28,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 713 transitions. [2024-11-16 17:50:28,666 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 713 transitions. Word has length 90 [2024-11-16 17:50:28,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:50:28,666 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 713 transitions. [2024-11-16 17:50:28,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 17:50:28,667 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 713 transitions. [2024-11-16 17:50:28,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-16 17:50:28,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:50:28,668 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 17:50:28,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-16 17:50:28,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 17:50:28,872 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:50:28,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:50:28,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1208932582, now seen corresponding path program 1 times [2024-11-16 17:50:28,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:50:28,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466222152] [2024-11-16 17:50:28,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:50:28,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:50:28,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 17:50:28,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2012991498] [2024-11-16 17:50:28,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:50:28,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 17:50:28,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:50:28,934 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 17:50:28,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-16 17:50:29,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 17:50:29,006 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 17:50:29,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 17:50:29,085 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 17:50:29,085 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 17:50:29,086 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 17:50:29,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-16 17:50:29,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 17:50:29,292 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 17:50:29,341 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 17:50:29,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 05:50:29 BoogieIcfgContainer [2024-11-16 17:50:29,343 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 17:50:29,344 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 17:50:29,344 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 17:50:29,344 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 17:50:29,344 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:50:21" (3/4) ... [2024-11-16 17:50:29,346 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 17:50:29,347 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 17:50:29,348 INFO L158 Benchmark]: Toolchain (without parser) took 9142.65ms. Allocated memory was 184.5MB in the beginning and 318.8MB in the end (delta: 134.2MB). Free memory was 116.2MB in the beginning and 106.6MB in the end (delta: 9.6MB). Peak memory consumption was 145.2MB. Max. memory is 16.1GB. [2024-11-16 17:50:29,348 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 117.4MB. Free memory is still 78.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 17:50:29,348 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.17ms. Allocated memory is still 184.5MB. Free memory was 115.9MB in the beginning and 100.2MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 17:50:29,348 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.92ms. Allocated memory is still 184.5MB. Free memory was 100.2MB in the beginning and 96.6MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 17:50:29,348 INFO L158 Benchmark]: Boogie Preprocessor took 55.02ms. Allocated memory is still 184.5MB. Free memory was 96.6MB in the beginning and 91.3MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 17:50:29,349 INFO L158 Benchmark]: IcfgBuilder took 541.64ms. Allocated memory is still 184.5MB. Free memory was 91.3MB in the beginning and 141.8MB in the end (delta: -50.5MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2024-11-16 17:50:29,349 INFO L158 Benchmark]: TraceAbstraction took 8154.90ms. Allocated memory was 184.5MB in the beginning and 318.8MB in the end (delta: 134.2MB). Free memory was 140.9MB in the beginning and 107.6MB in the end (delta: 33.2MB). Peak memory consumption was 169.4MB. Max. memory is 16.1GB. [2024-11-16 17:50:29,349 INFO L158 Benchmark]: Witness Printer took 3.34ms. Allocated memory is still 318.8MB. Free memory was 107.6MB in the beginning and 106.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 17:50:29,350 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.14ms. Allocated memory is still 117.4MB. Free memory is still 78.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 333.17ms. Allocated memory is still 184.5MB. Free memory was 115.9MB in the beginning and 100.2MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.92ms. Allocated memory is still 184.5MB. Free memory was 100.2MB in the beginning and 96.6MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.02ms. Allocated memory is still 184.5MB. Free memory was 96.6MB in the beginning and 91.3MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 541.64ms. Allocated memory is still 184.5MB. Free memory was 91.3MB in the beginning and 141.8MB in the end (delta: -50.5MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. * TraceAbstraction took 8154.90ms. Allocated memory was 184.5MB in the beginning and 318.8MB in the end (delta: 134.2MB). Free memory was 140.9MB in the beginning and 107.6MB in the end (delta: 33.2MB). Peak memory consumption was 169.4MB. Max. memory is 16.1GB. * Witness Printer took 3.34ms. Allocated memory is still 318.8MB. Free memory was 107.6MB in the beginning and 106.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 123, overapproximation of someUnaryDOUBLEoperation at line 30. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] signed char var_1_5 = -8; [L24] unsigned char var_1_6 = 10; [L25] unsigned char var_1_7 = 128; [L26] unsigned char var_1_8 = 1; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 0; [L29] signed short int var_1_13 = 200; [L30] float var_1_14 = -0.8; [L31] float var_1_15 = 127.25; [L32] float var_1_16 = 3.5; [L33] unsigned short int var_1_17 = 16; [L34] unsigned char var_1_19 = 1; [L35] unsigned char var_1_20 = 0; [L36] signed short int last_1_var_1_1 = 16; [L37] unsigned char last_1_var_1_6 = 10; [L38] unsigned char last_1_var_1_8 = 1; [L39] signed short int last_1_var_1_13 = 200; VAL [isInitial=0, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1] [L127] isInitial = 1 [L128] FCALL initially() [L129] COND TRUE 1 [L130] CALL updateLastVariables() [L117] last_1_var_1_1 = var_1_1 [L118] last_1_var_1_6 = var_1_6 [L119] last_1_var_1_8 = var_1_8 [L120] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1] [L130] RET updateLastVariables() [L131] CALL updateVariables() [L96] var_1_5 = __VERIFIER_nondet_char() [L97] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L97] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L98] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L98] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L99] var_1_7 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_7 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L100] RET assume_abort_if_not(var_1_7 >= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L101] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L101] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L102] var_1_11 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L103] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L104] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L104] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L105] var_1_12 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L106] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L107] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L107] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L108] var_1_15 = __VERIFIER_nondet_float() [L109] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L109] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L110] var_1_16 = __VERIFIER_nondet_float() [L111] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L111] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L112] var_1_20 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L113] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L114] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L114] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L131] RET updateVariables() [L132] CALL step() [L43] signed long int stepLocal_6 = last_1_var_1_1; [L44] unsigned char stepLocal_5 = ((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_5=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L45] COND TRUE stepLocal_5 || last_1_var_1_8 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L46] COND FALSE !(stepLocal_6 <= last_1_var_1_6) [L49] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L54] COND FALSE !(var_1_14 <= var_1_15) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L57] COND TRUE var_1_5 >= -2 [L58] var_1_6 = (var_1_7 - 100) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=1] [L60] unsigned char stepLocal_4 = var_1_6; [L61] signed long int stepLocal_3 = var_1_6 / var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_3=0, stepLocal_4=154, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=1] [L62] COND TRUE last_1_var_1_13 >= stepLocal_3 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_4=154, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=1] [L63] COND TRUE stepLocal_4 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5))) [L64] var_1_13 = var_1_7 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=1] [L71] unsigned char stepLocal_7 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_7=154, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=1] [L72] COND FALSE !(stepLocal_7 > var_1_6) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=1] [L75] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=1] [L76] COND TRUE \read(var_1_19) [L77] var_1_1 = ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=1] [L83] unsigned char stepLocal_2 = var_1_19 && var_1_19; [L84] unsigned char stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, stepLocal_1=254, stepLocal_2=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=1] [L85] COND FALSE !((49.5f <= var_1_14) && stepLocal_2) [L92] var_1_8 = var_1_12 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, stepLocal_1=254, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=0] [L132] RET step() [L133] CALL, EXPR property() [L123-L124] return ((((((var_1_19 ? (var_1_1 == ((signed short int) ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))))) : ((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) >= var_1_6) ? (var_1_1 == ((signed short int) var_1_5)) : 1)) && ((var_1_5 >= -2) ? (var_1_6 == ((unsigned char) (var_1_7 - 100))) : 1)) && (((49.5f <= var_1_14) && (var_1_19 && var_1_19)) ? ((var_1_13 < var_1_7) ? (var_1_8 == ((unsigned char) (var_1_19 || var_1_11))) : (var_1_8 == ((unsigned char) var_1_11))) : (var_1_8 == ((unsigned char) var_1_12)))) && ((last_1_var_1_13 >= (var_1_6 / var_1_7)) ? ((var_1_6 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5)))) ? (var_1_13 == ((signed short int) var_1_7)) : (var_1_13 == ((signed short int) last_1_var_1_13))) : (var_1_13 == ((signed short int) var_1_6)))) && (((((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5) || last_1_var_1_8) ? ((last_1_var_1_1 <= last_1_var_1_6) ? (var_1_14 == ((float) (var_1_15 + var_1_16))) : (var_1_14 == ((float) var_1_16))) : (var_1_14 == ((float) var_1_16)))) && ((var_1_6 > var_1_6) ? (var_1_17 == ((unsigned short int) ((((25) > ((var_1_13 + var_1_6))) ? (25) : ((var_1_13 + var_1_6)))))) : 1)) && ((var_1_14 <= var_1_15) ? (var_1_19 == ((unsigned char) (var_1_12 || var_1_20))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=0] [L133] RET, EXPR property() [L133] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.0s, OverallIterations: 8, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 685 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 671 mSDsluCounter, 2134 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1535 mSDsCounter, 229 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1162 IncrementalHoareTripleChecker+Invalid, 1397 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 229 mSolverCounterUnsat, 599 mSDtfsCounter, 1162 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 709 GetRequests, 608 SyntacticMatches, 2 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=547occurred in iteration=7, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 449 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 1080 NumberOfCodeBlocks, 1080 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 799 ConstructedInterpolants, 1 QuantifiedInterpolants, 3359 SizeOfPredicates, 16 NumberOfNonLiveVariables, 699 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 9 InterpolantComputations, 4 PerfectInterpolantSequences, 2292/2376 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-11-16 17:50:29,376 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/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-42.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 a5b1459048f386d4d91aa4d1371a4e9edda9e34036124ce3aa9f0ad83bf94de0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 17:50:31,340 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 17:50:31,408 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 17:50:31,412 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 17:50:31,413 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 17:50:31,441 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 17:50:31,443 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 17:50:31,443 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 17:50:31,444 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 17:50:31,444 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 17:50:31,444 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 17:50:31,445 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 17:50:31,445 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 17:50:31,445 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 17:50:31,446 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 17:50:31,447 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 17:50:31,447 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 17:50:31,448 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 17:50:31,448 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 17:50:31,451 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 17:50:31,451 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 17:50:31,451 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 17:50:31,451 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 17:50:31,452 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 17:50:31,452 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 17:50:31,452 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 17:50:31,452 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 17:50:31,452 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 17:50:31,452 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 17:50:31,452 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 17:50:31,453 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 17:50:31,453 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 17:50:31,453 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 17:50:31,453 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 17:50:31,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:50:31,453 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 17:50:31,453 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 17:50:31,454 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 17:50:31,454 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 17:50:31,454 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 17:50:31,454 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 17:50:31,457 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 17:50:31,457 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 17:50:31,457 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 17:50:31,457 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 -> a5b1459048f386d4d91aa4d1371a4e9edda9e34036124ce3aa9f0ad83bf94de0 [2024-11-16 17:50:31,715 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 17:50:31,738 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 17:50:31,741 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 17:50:31,742 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 17:50:31,742 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 17:50:31,744 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-42.i [2024-11-16 17:50:33,248 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 17:50:33,448 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 17:50:33,448 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-42.i [2024-11-16 17:50:33,461 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7b5b6cd5/70a4e956cc074b628b1d6f3dc7c5523e/FLAG4dd6f382f [2024-11-16 17:50:33,475 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7b5b6cd5/70a4e956cc074b628b1d6f3dc7c5523e [2024-11-16 17:50:33,477 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 17:50:33,479 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 17:50:33,479 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 17:50:33,479 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 17:50:33,487 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 17:50:33,487 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:50:33" (1/1) ... [2024-11-16 17:50:33,488 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@347a5c7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:50:33, skipping insertion in model container [2024-11-16 17:50:33,488 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:50:33" (1/1) ... [2024-11-16 17:50:33,509 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 17:50:33,683 WARN L250 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_operatoramount_amount50_file-42.i[915,928] [2024-11-16 17:50:33,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:50:33,769 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 17:50:33,782 WARN L250 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_operatoramount_amount50_file-42.i[915,928] [2024-11-16 17:50:33,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:50:33,845 INFO L204 MainTranslator]: Completed translation [2024-11-16 17:50:33,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:50:33 WrapperNode [2024-11-16 17:50:33,846 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 17:50:33,847 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 17:50:33,847 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 17:50:33,847 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 17:50:33,854 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:50:33" (1/1) ... [2024-11-16 17:50:33,870 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:50:33" (1/1) ... [2024-11-16 17:50:33,906 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2024-11-16 17:50:33,910 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 17:50:33,911 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 17:50:33,911 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 17:50:33,911 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 17:50:33,924 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:50:33" (1/1) ... [2024-11-16 17:50:33,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:50:33" (1/1) ... [2024-11-16 17:50:33,927 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:50:33" (1/1) ... [2024-11-16 17:50:33,949 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 17:50:33,950 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:50:33" (1/1) ... [2024-11-16 17:50:33,950 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:50:33" (1/1) ... [2024-11-16 17:50:33,962 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:50:33" (1/1) ... [2024-11-16 17:50:33,963 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:50:33" (1/1) ... [2024-11-16 17:50:33,968 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:50:33" (1/1) ... [2024-11-16 17:50:33,969 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:50:33" (1/1) ... [2024-11-16 17:50:33,976 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 17:50:33,981 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 17:50:33,981 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 17:50:33,981 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 17:50:33,982 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:50:33" (1/1) ... [2024-11-16 17:50:33,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:50:34,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:50:34,023 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-11-16 17:50:34,032 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-11-16 17:50:34,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 17:50:34,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 17:50:34,072 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 17:50:34,072 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 17:50:34,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 17:50:34,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 17:50:34,147 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 17:50:34,150 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 17:50:34,595 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-16 17:50:34,595 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 17:50:34,604 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 17:50:34,604 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 17:50:34,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:50:34 BoogieIcfgContainer [2024-11-16 17:50:34,605 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 17:50:34,607 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 17:50:34,607 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 17:50:34,609 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 17:50:34,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 05:50:33" (1/3) ... [2024-11-16 17:50:34,610 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5322a2b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:50:34, skipping insertion in model container [2024-11-16 17:50:34,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:50:33" (2/3) ... [2024-11-16 17:50:34,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5322a2b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:50:34, skipping insertion in model container [2024-11-16 17:50:34,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:50:34" (3/3) ... [2024-11-16 17:50:34,613 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-42.i [2024-11-16 17:50:34,627 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 17:50:34,628 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 17:50:34,676 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 17:50:34,682 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;@5378bc10, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 17:50:34,682 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 17:50:34,686 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 42 states have internal predecessors, (57), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-16 17:50:34,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-16 17:50:34,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:50:34,694 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 17:50:34,695 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:50:34,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:50:34,699 INFO L85 PathProgramCache]: Analyzing trace with hash 908835192, now seen corresponding path program 1 times [2024-11-16 17:50:34,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:50:34,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [134400392] [2024-11-16 17:50:34,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:50:34,710 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-11-16 17:50:34,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:50:34,713 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-11-16 17:50:34,714 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-11-16 17:50:34,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:34,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 17:50:34,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:50:34,905 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2024-11-16 17:50:34,905 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 17:50:34,906 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 17:50:34,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [134400392] [2024-11-16 17:50:34,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [134400392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:50:34,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:50:34,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 17:50:34,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137551904] [2024-11-16 17:50:34,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:50:34,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 17:50:34,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 17:50:34,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 17:50:34,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 17:50:34,937 INFO L87 Difference]: Start difference. First operand has 56 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 42 states have internal predecessors, (57), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 17:50:34,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:50:34,954 INFO L93 Difference]: Finished difference Result 104 states and 167 transitions. [2024-11-16 17:50:34,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 17:50:34,956 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 89 [2024-11-16 17:50:34,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:50:34,962 INFO L225 Difference]: With dead ends: 104 [2024-11-16 17:50:34,962 INFO L226 Difference]: Without dead ends: 51 [2024-11-16 17:50:34,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 88 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-11-16 17:50:34,967 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 17:50:34,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 17:50:34,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-16 17:50:34,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-16 17:50:34,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-16 17:50:34,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2024-11-16 17:50:34,995 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 89 [2024-11-16 17:50:34,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:50:34,996 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions. [2024-11-16 17:50:34,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 17:50:34,996 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions. [2024-11-16 17:50:34,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-16 17:50:34,998 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:50:34,998 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 17:50:35,005 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-11-16 17:50:35,199 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-11-16 17:50:35,199 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:50:35,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:50:35,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1113837414, now seen corresponding path program 1 times [2024-11-16 17:50:35,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:50:35,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1136947477] [2024-11-16 17:50:35,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:50:35,201 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-11-16 17:50:35,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:50:35,225 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-11-16 17:50:35,227 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-11-16 17:50:35,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:35,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 17:50:35,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:50:35,702 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 17:50:35,702 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 17:50:35,703 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 17:50:35,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1136947477] [2024-11-16 17:50:35,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1136947477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:50:35,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:50:35,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 17:50:35,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595283476] [2024-11-16 17:50:35,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:50:35,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 17:50:35,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 17:50:35,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 17:50:35,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 17:50:35,711 INFO L87 Difference]: Start difference. First operand 51 states and 73 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 17:50:35,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:50:35,958 INFO L93 Difference]: Finished difference Result 149 states and 215 transitions. [2024-11-16 17:50:35,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 17:50:35,963 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 89 [2024-11-16 17:50:35,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:50:35,965 INFO L225 Difference]: With dead ends: 149 [2024-11-16 17:50:35,965 INFO L226 Difference]: Without dead ends: 101 [2024-11-16 17:50:35,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 17:50:35,966 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 70 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 17:50:35,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 201 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 17:50:35,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-16 17:50:35,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 78. [2024-11-16 17:50:35,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-16 17:50:35,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 111 transitions. [2024-11-16 17:50:35,983 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 111 transitions. Word has length 89 [2024-11-16 17:50:35,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:50:35,983 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 111 transitions. [2024-11-16 17:50:35,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 17:50:35,984 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 111 transitions. [2024-11-16 17:50:35,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-16 17:50:35,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:50:35,986 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 17:50:35,999 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-11-16 17:50:36,189 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-11-16 17:50:36,190 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:50:36,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:50:36,191 INFO L85 PathProgramCache]: Analyzing trace with hash -646646993, now seen corresponding path program 1 times [2024-11-16 17:50:36,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:50:36,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1873703858] [2024-11-16 17:50:36,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:50:36,194 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-11-16 17:50:36,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:50:36,199 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-11-16 17:50:36,201 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-11-16 17:50:36,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:36,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 17:50:36,322 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:50:36,707 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 17:50:36,711 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 17:50:36,711 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 17:50:36,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1873703858] [2024-11-16 17:50:36,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1873703858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:50:36,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:50:36,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 17:50:36,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490237125] [2024-11-16 17:50:36,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:50:36,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 17:50:36,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 17:50:36,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 17:50:36,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 17:50:36,717 INFO L87 Difference]: Start difference. First operand 78 states and 111 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 17:50:37,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:50:37,325 INFO L93 Difference]: Finished difference Result 220 states and 320 transitions. [2024-11-16 17:50:37,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 17:50:37,330 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 90 [2024-11-16 17:50:37,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:50:37,333 INFO L225 Difference]: With dead ends: 220 [2024-11-16 17:50:37,333 INFO L226 Difference]: Without dead ends: 172 [2024-11-16 17:50:37,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-16 17:50:37,335 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 101 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 17:50:37,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 304 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 17:50:37,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-16 17:50:37,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 123. [2024-11-16 17:50:37,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 83 states have (on average 1.2771084337349397) internal successors, (106), 83 states have internal predecessors, (106), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 17:50:37,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 178 transitions. [2024-11-16 17:50:37,357 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 178 transitions. Word has length 90 [2024-11-16 17:50:37,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:50:37,358 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 178 transitions. [2024-11-16 17:50:37,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 17:50:37,361 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 178 transitions. [2024-11-16 17:50:37,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-16 17:50:37,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:50:37,364 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 17:50:37,381 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-11-16 17:50:37,568 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-11-16 17:50:37,569 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:50:37,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:50:37,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1157181170, now seen corresponding path program 1 times [2024-11-16 17:50:37,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:50:37,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [146359911] [2024-11-16 17:50:37,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:50:37,571 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-11-16 17:50:37,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:50:37,573 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-11-16 17:50:37,574 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-11-16 17:50:37,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:37,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 17:50:37,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:50:37,797 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 17:50:37,797 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 17:50:37,797 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 17:50:37,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [146359911] [2024-11-16 17:50:37,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [146359911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:50:37,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:50:37,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 17:50:37,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928344331] [2024-11-16 17:50:37,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:50:37,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 17:50:37,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 17:50:37,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 17:50:37,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 17:50:37,799 INFO L87 Difference]: Start difference. First operand 123 states and 178 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 17:50:37,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:50:37,913 INFO L93 Difference]: Finished difference Result 216 states and 315 transitions. [2024-11-16 17:50:37,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 17:50:37,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 90 [2024-11-16 17:50:37,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:50:37,925 INFO L225 Difference]: With dead ends: 216 [2024-11-16 17:50:37,926 INFO L226 Difference]: Without dead ends: 123 [2024-11-16 17:50:37,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 88 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-11-16 17:50:37,927 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 17:50:37,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 17:50:37,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-16 17:50:37,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-16 17:50:37,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 83 states have (on average 1.2530120481927711) internal successors, (104), 83 states have internal predecessors, (104), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 17:50:37,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 176 transitions. [2024-11-16 17:50:37,951 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 176 transitions. Word has length 90 [2024-11-16 17:50:37,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:50:37,951 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 176 transitions. [2024-11-16 17:50:37,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 17:50:37,953 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 176 transitions. [2024-11-16 17:50:37,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-16 17:50:37,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:50:37,955 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 17:50:37,972 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-11-16 17:50:38,156 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-11-16 17:50:38,156 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:50:38,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:50:38,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1353694675, now seen corresponding path program 1 times [2024-11-16 17:50:38,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:50:38,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [888081170] [2024-11-16 17:50:38,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:50:38,157 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-11-16 17:50:38,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:50:38,161 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-11-16 17:50:38,163 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-11-16 17:50:38,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:38,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 17:50:38,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:50:38,446 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 149 proven. 9 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-16 17:50:38,447 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 17:50:38,674 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 51 proven. 12 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2024-11-16 17:50:38,674 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 17:50:38,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [888081170] [2024-11-16 17:50:38,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [888081170] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 17:50:38,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 17:50:38,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2024-11-16 17:50:38,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445845647] [2024-11-16 17:50:38,675 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 17:50:38,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 17:50:38,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 17:50:38,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 17:50:38,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-16 17:50:38,676 INFO L87 Difference]: Start difference. First operand 123 states and 176 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-16 17:50:39,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:50:39,851 INFO L93 Difference]: Finished difference Result 284 states and 375 transitions. [2024-11-16 17:50:39,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-16 17:50:39,852 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 90 [2024-11-16 17:50:39,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:50:39,854 INFO L225 Difference]: With dead ends: 284 [2024-11-16 17:50:39,857 INFO L226 Difference]: Without dead ends: 236 [2024-11-16 17:50:39,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=315, Invalid=741, Unknown=0, NotChecked=0, Total=1056 [2024-11-16 17:50:39,862 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 158 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 17:50:39,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 391 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 17:50:39,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-16 17:50:39,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 209. [2024-11-16 17:50:39,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 148 states have (on average 1.2297297297297298) internal successors, (182), 148 states have internal predecessors, (182), 48 states have call successors, (48), 12 states have call predecessors, (48), 12 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-16 17:50:39,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 278 transitions. [2024-11-16 17:50:39,909 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 278 transitions. Word has length 90 [2024-11-16 17:50:39,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:50:39,909 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 278 transitions. [2024-11-16 17:50:39,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-16 17:50:39,910 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 278 transitions. [2024-11-16 17:50:39,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-16 17:50:39,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:50:39,911 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 17:50:39,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-16 17:50:40,111 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-11-16 17:50:40,111 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:50:40,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:50:40,112 INFO L85 PathProgramCache]: Analyzing trace with hash 153857134, now seen corresponding path program 1 times [2024-11-16 17:50:40,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:50:40,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [492921368] [2024-11-16 17:50:40,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:50:40,112 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-11-16 17:50:40,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:50:40,114 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-11-16 17:50:40,115 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-11-16 17:50:40,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:40,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 17:50:40,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:50:40,935 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 87 proven. 27 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-11-16 17:50:40,936 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 17:50:41,221 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 17:50:41,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [492921368] [2024-11-16 17:50:41,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [492921368] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 17:50:41,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [793627799] [2024-11-16 17:50:41,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:50:41,222 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-16 17:50:41,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-16 17:50:41,227 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-16 17:50:41,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-16 17:50:41,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:41,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 17:50:41,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:50:41,926 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 17:50:41,926 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 17:50:41,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [793627799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:50:41,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 17:50:41,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2024-11-16 17:50:41,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198904542] [2024-11-16 17:50:41,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:50:41,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 17:50:41,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 17:50:41,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 17:50:41,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-16 17:50:41,928 INFO L87 Difference]: Start difference. First operand 209 states and 278 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 17:50:43,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:50:43,328 INFO L93 Difference]: Finished difference Result 608 states and 801 transitions. [2024-11-16 17:50:43,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 17:50:43,336 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 90 [2024-11-16 17:50:43,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:50:43,339 INFO L225 Difference]: With dead ends: 608 [2024-11-16 17:50:43,339 INFO L226 Difference]: Without dead ends: 500 [2024-11-16 17:50:43,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-16 17:50:43,340 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 125 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-16 17:50:43,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 353 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-16 17:50:43,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2024-11-16 17:50:43,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 418. [2024-11-16 17:50:43,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 306 states have (on average 1.2418300653594772) internal successors, (380), 308 states have internal predecessors, (380), 88 states have call successors, (88), 23 states have call predecessors, (88), 23 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-16 17:50:43,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 556 transitions. [2024-11-16 17:50:43,378 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 556 transitions. Word has length 90 [2024-11-16 17:50:43,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:50:43,379 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 556 transitions. [2024-11-16 17:50:43,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 17:50:43,379 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 556 transitions. [2024-11-16 17:50:43,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-16 17:50:43,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:50:43,380 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 17:50:43,388 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-11-16 17:50:43,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2024-11-16 17:50:43,781 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,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-16 17:50:43,782 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:50:43,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:50:43,782 INFO L85 PathProgramCache]: Analyzing trace with hash -351701491, now seen corresponding path program 1 times [2024-11-16 17:50:43,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:50:43,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [600280877] [2024-11-16 17:50:43,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:50:43,783 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-11-16 17:50:43,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:50:43,788 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-11-16 17:50:43,791 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-11-16 17:50:43,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:43,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 17:50:43,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:50:44,376 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 87 proven. 27 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-11-16 17:50:44,376 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 17:50:44,663 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 17:50:44,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [600280877] [2024-11-16 17:50:44,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [600280877] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 17:50:44,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1461195982] [2024-11-16 17:50:44,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:50:44,664 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-16 17:50:44,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-16 17:50:44,666 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-16 17:50:44,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-11-16 17:50:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:45,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 17:50:45,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:50:45,559 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 17:50:45,560 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 17:50:45,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1461195982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:50:45,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 17:50:45,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-11-16 17:50:45,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32771382] [2024-11-16 17:50:45,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:50:45,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 17:50:45,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 17:50:45,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 17:50:45,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-16 17:50:45,562 INFO L87 Difference]: Start difference. First operand 418 states and 556 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 17:50:46,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:50:46,768 INFO L93 Difference]: Finished difference Result 735 states and 977 transitions. [2024-11-16 17:50:46,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 17:50:46,770 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 90 [2024-11-16 17:50:46,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:50:46,785 INFO L225 Difference]: With dead ends: 735 [2024-11-16 17:50:46,785 INFO L226 Difference]: Without dead ends: 570 [2024-11-16 17:50:46,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-16 17:50:46,786 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 70 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-16 17:50:46,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 292 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-16 17:50:46,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2024-11-16 17:50:46,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 523. [2024-11-16 17:50:46,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 381 states have (on average 1.236220472440945) internal successors, (471), 383 states have internal predecessors, (471), 112 states have call successors, (112), 29 states have call predecessors, (112), 29 states have return successors, (112), 110 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-16 17:50:46,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 695 transitions. [2024-11-16 17:50:46,819 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 695 transitions. Word has length 90 [2024-11-16 17:50:46,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:50:46,819 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 695 transitions. [2024-11-16 17:50:46,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 17:50:46,820 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 695 transitions. [2024-11-16 17:50:46,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-16 17:50:46,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:50:46,821 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 17:50:46,836 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 (9)] Forceful destruction successful, exit code 0 [2024-11-16 17:50:47,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2024-11-16 17:50:47,221 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,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-16 17:50:47,222 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:50:47,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:50:47,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1208932582, now seen corresponding path program 1 times [2024-11-16 17:50:47,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:50:47,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [495895067] [2024-11-16 17:50:47,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:50:47,223 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-11-16 17:50:47,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:50:47,224 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-11-16 17:50:47,226 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-11-16 17:50:47,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:50:47,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-16 17:50:47,356 INFO L278 TraceCheckSpWp]: Computing forward predicates...