./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-2.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 cb5120da282da0939ac8a01aef351f705e3e5f743c1237b3353ccb3b22ece68c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:06:01,596 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:06:01,641 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 04:06:01,646 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:06:01,647 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:06:01,676 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:06:01,677 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:06:01,677 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:06:01,678 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:06:01,679 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:06:01,679 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:06:01,679 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:06:01,680 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:06:01,680 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:06:01,680 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:06:01,681 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:06:01,681 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:06:01,683 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:06:01,683 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 04:06:01,683 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:06:01,684 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:06:01,684 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:06:01,687 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:06:01,687 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:06:01,688 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:06:01,688 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:06:01,688 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:06:01,688 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:06:01,688 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:06:01,688 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:06:01,689 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:06:01,689 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:06:01,689 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:06:01,689 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:06:01,689 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:06:01,689 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:06:01,689 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 04:06:01,690 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 04:06:01,690 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:06:01,690 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:06:01,691 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:06:01,691 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:06:01,692 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 -> cb5120da282da0939ac8a01aef351f705e3e5f743c1237b3353ccb3b22ece68c [2024-10-13 04:06:01,884 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:06:01,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:06:01,906 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:06:01,907 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:06:01,908 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:06:01,908 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-2.i [2024-10-13 04:06:03,148 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:06:03,321 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:06:03,321 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-2.i [2024-10-13 04:06:03,328 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/faa3cc98b/dd6a6f76e6da4e5ea6ca63784519a786/FLAGc6c8df102 [2024-10-13 04:06:03,340 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/faa3cc98b/dd6a6f76e6da4e5ea6ca63784519a786 [2024-10-13 04:06:03,342 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:06:03,343 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:06:03,344 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:06:03,344 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:06:03,349 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:06:03,349 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:06:03" (1/1) ... [2024-10-13 04:06:03,352 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16eea99f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:06:03, skipping insertion in model container [2024-10-13 04:06:03,352 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:06:03" (1/1) ... [2024-10-13 04:06:03,374 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:06:03,538 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-2.i[914,927] [2024-10-13 04:06:03,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:06:03,569 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:06:03,577 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-2.i[914,927] [2024-10-13 04:06:03,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:06:03,604 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:06:03,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:06:03 WrapperNode [2024-10-13 04:06:03,604 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:06:03,605 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:06:03,605 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:06:03,605 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:06:03,611 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:06:03" (1/1) ... [2024-10-13 04:06:03,621 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:06:03" (1/1) ... [2024-10-13 04:06:03,642 INFO L138 Inliner]: procedures = 26, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 88 [2024-10-13 04:06:03,643 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:06:03,643 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:06:03,643 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:06:03,644 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:06:03,652 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:06:03" (1/1) ... [2024-10-13 04:06:03,652 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:06:03" (1/1) ... [2024-10-13 04:06:03,658 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:06:03" (1/1) ... [2024-10-13 04:06:03,670 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-10-13 04:06:03,671 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:06:03" (1/1) ... [2024-10-13 04:06:03,671 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:06:03" (1/1) ... [2024-10-13 04:06:03,676 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:06:03" (1/1) ... [2024-10-13 04:06:03,684 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:06:03" (1/1) ... [2024-10-13 04:06:03,686 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:06:03" (1/1) ... [2024-10-13 04:06:03,686 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:06:03" (1/1) ... [2024-10-13 04:06:03,694 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:06:03,695 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:06:03,695 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:06:03,695 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:06:03,696 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:06:03" (1/1) ... [2024-10-13 04:06:03,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:06:03,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:06:03,724 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 04:06:03,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 04:06:03,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:06:03,768 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:06:03,768 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:06:03,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 04:06:03,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:06:03,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:06:03,827 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:06:03,829 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:06:04,024 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-10-13 04:06:04,024 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:06:04,051 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:06:04,051 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:06:04,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:06:04 BoogieIcfgContainer [2024-10-13 04:06:04,051 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:06:04,053 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:06:04,053 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:06:04,056 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:06:04,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:06:03" (1/3) ... [2024-10-13 04:06:04,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1378f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:06:04, skipping insertion in model container [2024-10-13 04:06:04,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:06:03" (2/3) ... [2024-10-13 04:06:04,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1378f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:06:04, skipping insertion in model container [2024-10-13 04:06:04,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:06:04" (3/3) ... [2024-10-13 04:06:04,058 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-2.i [2024-10-13 04:06:04,071 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:06:04,071 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:06:04,119 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:06:04,124 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;@4bb70087, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:06:04,125 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:06:04,128 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-13 04:06:04,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-13 04:06:04,140 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:06:04,140 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:06:04,141 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:06:04,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:06:04,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1065248636, now seen corresponding path program 1 times [2024-10-13 04:06:04,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:06:04,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17348598] [2024-10-13 04:06:04,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:06:04,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:06:04,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:04,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:06:04,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:04,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:06:04,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:04,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:06:04,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:04,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:06:04,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:04,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:06:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:04,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:06:04,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:04,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:06:04,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:04,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:06:04,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:04,400 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-13 04:06:04,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:06:04,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17348598] [2024-10-13 04:06:04,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17348598] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:06:04,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:06:04,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:06:04,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192708223] [2024-10-13 04:06:04,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:06:04,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:06:04,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:06:04,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:06:04,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:06:04,430 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-13 04:06:04,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:06:04,470 INFO L93 Difference]: Finished difference Result 65 states and 105 transitions. [2024-10-13 04:06:04,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:06:04,473 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 54 [2024-10-13 04:06:04,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:06:04,479 INFO L225 Difference]: With dead ends: 65 [2024-10-13 04:06:04,479 INFO L226 Difference]: Without dead ends: 31 [2024-10-13 04:06:04,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:06:04,487 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:06:04,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:06:04,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-13 04:06:04,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-13 04:06:04,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-13 04:06:04,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2024-10-13 04:06:04,573 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 44 transitions. Word has length 54 [2024-10-13 04:06:04,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:06:04,576 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 44 transitions. [2024-10-13 04:06:04,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-13 04:06:04,580 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 44 transitions. [2024-10-13 04:06:04,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-13 04:06:04,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:06:04,581 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:06:04,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 04:06:04,582 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:06:04,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:06:04,582 INFO L85 PathProgramCache]: Analyzing trace with hash 202647684, now seen corresponding path program 1 times [2024-10-13 04:06:04,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:06:04,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510645657] [2024-10-13 04:06:04,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:06:04,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:06:04,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:05,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:06:05,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:05,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:06:05,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:05,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:06:05,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:05,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:06:05,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:05,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:06:05,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:05,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:06:05,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:05,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:06:05,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:05,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:06:05,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:05,097 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-13 04:06:05,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:06:05,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510645657] [2024-10-13 04:06:05,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510645657] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:06:05,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:06:05,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 04:06:05,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207009361] [2024-10-13 04:06:05,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:06:05,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 04:06:05,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:06:05,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 04:06:05,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 04:06:05,103 INFO L87 Difference]: Start difference. First operand 31 states and 44 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-13 04:06:05,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:06:05,273 INFO L93 Difference]: Finished difference Result 101 states and 143 transitions. [2024-10-13 04:06:05,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 04:06:05,275 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 54 [2024-10-13 04:06:05,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:06:05,276 INFO L225 Difference]: With dead ends: 101 [2024-10-13 04:06:05,276 INFO L226 Difference]: Without dead ends: 71 [2024-10-13 04:06:05,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 04:06:05,278 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 66 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:06:05,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 177 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 04:06:05,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-13 04:06:05,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 59. [2024-10-13 04:06:05,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 04:06:05,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 85 transitions. [2024-10-13 04:06:05,301 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 85 transitions. Word has length 54 [2024-10-13 04:06:05,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:06:05,302 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 85 transitions. [2024-10-13 04:06:05,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-13 04:06:05,302 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 85 transitions. [2024-10-13 04:06:05,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-13 04:06:05,304 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:06:05,304 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:06:05,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 04:06:05,304 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:06:05,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:06:05,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1011994310, now seen corresponding path program 1 times [2024-10-13 04:06:05,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:06:05,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403907819] [2024-10-13 04:06:05,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:06:05,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:06:05,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:06,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:06:06,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:06,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:06:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:06,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:06:06,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:06,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:06:06,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:06,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:06:06,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:06,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:06:06,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:06,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:06:06,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:06,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:06:06,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:06,854 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-13 04:06:06,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:06:06,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403907819] [2024-10-13 04:06:06,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403907819] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:06:06,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:06:06,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 04:06:06,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341097432] [2024-10-13 04:06:06,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:06:06,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 04:06:06,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:06:06,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 04:06:06,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-13 04:06:06,856 INFO L87 Difference]: Start difference. First operand 59 states and 85 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-13 04:06:10,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 04:06:11,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:06:11,271 INFO L93 Difference]: Finished difference Result 89 states and 123 transitions. [2024-10-13 04:06:11,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 04:06:11,271 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 54 [2024-10-13 04:06:11,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:06:11,273 INFO L225 Difference]: With dead ends: 89 [2024-10-13 04:06:11,273 INFO L226 Difference]: Without dead ends: 87 [2024-10-13 04:06:11,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-13 04:06:11,274 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 50 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-13 04:06:11,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 146 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-10-13 04:06:11,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-13 04:06:11,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 65. [2024-10-13 04:06:11,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 04:06:11,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 93 transitions. [2024-10-13 04:06:11,288 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 93 transitions. Word has length 54 [2024-10-13 04:06:11,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:06:11,288 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 93 transitions. [2024-10-13 04:06:11,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-13 04:06:11,288 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 93 transitions. [2024-10-13 04:06:11,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-13 04:06:11,289 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:06:11,289 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:06:11,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 04:06:11,290 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:06:11,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:06:11,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1034637514, now seen corresponding path program 1 times [2024-10-13 04:06:11,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:06:11,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570500592] [2024-10-13 04:06:11,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:06:11,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:06:11,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:11,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:06:11,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:11,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:06:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:11,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:06:11,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:11,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:06:11,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:11,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:06:11,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:11,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:06:11,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:11,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:06:11,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:11,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:06:11,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:11,843 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-13 04:06:11,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:06:11,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570500592] [2024-10-13 04:06:11,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570500592] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:06:11,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:06:11,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 04:06:11,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743630478] [2024-10-13 04:06:11,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:06:11,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 04:06:11,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:06:11,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 04:06:11,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-13 04:06:11,846 INFO L87 Difference]: Start difference. First operand 65 states and 93 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-13 04:06:12,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:06:12,348 INFO L93 Difference]: Finished difference Result 199 states and 277 transitions. [2024-10-13 04:06:12,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 04:06:12,349 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 55 [2024-10-13 04:06:12,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:06:12,351 INFO L225 Difference]: With dead ends: 199 [2024-10-13 04:06:12,351 INFO L226 Difference]: Without dead ends: 163 [2024-10-13 04:06:12,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2024-10-13 04:06:12,352 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 81 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 04:06:12,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 173 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 04:06:12,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-13 04:06:12,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 126. [2024-10-13 04:06:12,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 89 states have (on average 1.303370786516854) internal successors, (116), 89 states have internal predecessors, (116), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 04:06:12,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 180 transitions. [2024-10-13 04:06:12,391 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 180 transitions. Word has length 55 [2024-10-13 04:06:12,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:06:12,391 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 180 transitions. [2024-10-13 04:06:12,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-13 04:06:12,392 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 180 transitions. [2024-10-13 04:06:12,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-13 04:06:12,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:06:12,393 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:06:12,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 04:06:12,393 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:06:12,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:06:12,394 INFO L85 PathProgramCache]: Analyzing trace with hash -977379212, now seen corresponding path program 1 times [2024-10-13 04:06:12,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:06:12,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912728374] [2024-10-13 04:06:12,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:06:12,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:06:12,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:12,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:06:12,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:12,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:06:12,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:12,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:06:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:12,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:06:12,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:12,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:06:12,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:12,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:06:12,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:12,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:06:12,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:12,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:06:12,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:12,453 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-13 04:06:12,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:06:12,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912728374] [2024-10-13 04:06:12,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912728374] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:06:12,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:06:12,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 04:06:12,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017757874] [2024-10-13 04:06:12,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:06:12,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 04:06:12,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:06:12,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 04:06:12,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 04:06:12,454 INFO L87 Difference]: Start difference. First operand 126 states and 180 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-13 04:06:12,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:06:12,605 INFO L93 Difference]: Finished difference Result 275 states and 388 transitions. [2024-10-13 04:06:12,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 04:06:12,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 55 [2024-10-13 04:06:12,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:06:12,608 INFO L225 Difference]: With dead ends: 275 [2024-10-13 04:06:12,609 INFO L226 Difference]: Without dead ends: 150 [2024-10-13 04:06:12,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 04:06:12,612 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 27 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:06:12,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 92 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 04:06:12,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-13 04:06:12,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 143. [2024-10-13 04:06:12,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 98 states have (on average 1.2551020408163265) internal successors, (123), 99 states have internal predecessors, (123), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-13 04:06:12,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 199 transitions. [2024-10-13 04:06:12,641 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 199 transitions. Word has length 55 [2024-10-13 04:06:12,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:06:12,642 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 199 transitions. [2024-10-13 04:06:12,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-13 04:06:12,642 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 199 transitions. [2024-10-13 04:06:12,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-13 04:06:12,643 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:06:12,643 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:06:12,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 04:06:12,644 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:06:12,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:06:12,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1714695884, now seen corresponding path program 1 times [2024-10-13 04:06:12,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:06:12,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60212400] [2024-10-13 04:06:12,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:06:12,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:06:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:17,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:06:17,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:17,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:06:17,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:17,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:06:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:17,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:06:17,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:17,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:06:17,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:17,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:06:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:17,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:06:17,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:17,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:06:17,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:17,559 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-13 04:06:17,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:06:17,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60212400] [2024-10-13 04:06:17,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60212400] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:06:17,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:06:17,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 04:06:17,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445773638] [2024-10-13 04:06:17,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:06:17,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 04:06:17,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:06:17,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 04:06:17,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 04:06:17,565 INFO L87 Difference]: Start difference. First operand 143 states and 199 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-13 04:06:22,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 04:06:22,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:06:22,380 INFO L93 Difference]: Finished difference Result 226 states and 310 transitions. [2024-10-13 04:06:22,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 04:06:22,381 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 55 [2024-10-13 04:06:22,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:06:22,383 INFO L225 Difference]: With dead ends: 226 [2024-10-13 04:06:22,383 INFO L226 Difference]: Without dead ends: 172 [2024-10-13 04:06:22,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 04:06:22,384 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 48 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-10-13 04:06:22,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 94 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2024-10-13 04:06:22,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-10-13 04:06:22,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 145. [2024-10-13 04:06:22,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 100 states have (on average 1.25) internal successors, (125), 101 states have internal predecessors, (125), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-13 04:06:22,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 201 transitions. [2024-10-13 04:06:22,399 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 201 transitions. Word has length 55 [2024-10-13 04:06:22,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:06:22,399 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 201 transitions. [2024-10-13 04:06:22,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-13 04:06:22,399 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 201 transitions. [2024-10-13 04:06:22,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-13 04:06:22,400 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:06:22,400 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:06:22,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 04:06:22,400 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:06:22,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:06:22,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1293242978, now seen corresponding path program 1 times [2024-10-13 04:06:22,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:06:22,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111633708] [2024-10-13 04:06:22,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:06:22,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:06:22,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:22,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:06:22,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:22,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:06:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:22,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:06:22,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:22,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:06:22,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:22,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:06:22,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:22,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:06:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:22,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:06:22,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:22,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:06:22,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:22,548 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-13 04:06:22,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:06:22,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111633708] [2024-10-13 04:06:22,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111633708] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:06:22,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:06:22,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 04:06:22,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440634831] [2024-10-13 04:06:22,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:06:22,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 04:06:22,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:06:22,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 04:06:22,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 04:06:22,551 INFO L87 Difference]: Start difference. First operand 145 states and 201 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-13 04:06:22,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:06:22,706 INFO L93 Difference]: Finished difference Result 254 states and 347 transitions. [2024-10-13 04:06:22,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 04:06:22,707 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 55 [2024-10-13 04:06:22,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:06:22,709 INFO L225 Difference]: With dead ends: 254 [2024-10-13 04:06:22,709 INFO L226 Difference]: Without dead ends: 165 [2024-10-13 04:06:22,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-13 04:06:22,710 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 52 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:06:22,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 170 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 04:06:22,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-13 04:06:22,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 151. [2024-10-13 04:06:22,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 106 states have (on average 1.2358490566037736) internal successors, (131), 107 states have internal predecessors, (131), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-13 04:06:22,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 207 transitions. [2024-10-13 04:06:22,729 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 207 transitions. Word has length 55 [2024-10-13 04:06:22,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:06:22,730 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 207 transitions. [2024-10-13 04:06:22,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-13 04:06:22,730 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 207 transitions. [2024-10-13 04:06:22,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-13 04:06:22,731 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:06:22,731 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:06:22,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 04:06:22,731 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:06:22,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:06:22,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1436018864, now seen corresponding path program 1 times [2024-10-13 04:06:22,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:06:22,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898027289] [2024-10-13 04:06:22,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:06:22,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:06:22,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:22,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:06:22,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:22,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:06:22,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:22,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:06:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:22,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:06:22,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:22,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:06:22,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:22,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:06:22,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:22,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:06:22,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:22,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:06:22,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:22,849 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-13 04:06:22,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:06:22,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898027289] [2024-10-13 04:06:22,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898027289] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:06:22,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:06:22,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 04:06:22,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659725672] [2024-10-13 04:06:22,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:06:22,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 04:06:22,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:06:22,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 04:06:22,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:06:22,852 INFO L87 Difference]: Start difference. First operand 151 states and 207 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-13 04:06:22,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:06:22,936 INFO L93 Difference]: Finished difference Result 254 states and 345 transitions. [2024-10-13 04:06:22,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 04:06:22,938 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 56 [2024-10-13 04:06:22,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:06:22,939 INFO L225 Difference]: With dead ends: 254 [2024-10-13 04:06:22,939 INFO L226 Difference]: Without dead ends: 165 [2024-10-13 04:06:22,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 04:06:22,940 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 41 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:06:22,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 133 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 04:06:22,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-13 04:06:22,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 153. [2024-10-13 04:06:22,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 108 states have (on average 1.2314814814814814) internal successors, (133), 109 states have internal predecessors, (133), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-13 04:06:22,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 209 transitions. [2024-10-13 04:06:22,971 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 209 transitions. Word has length 56 [2024-10-13 04:06:22,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:06:22,972 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 209 transitions. [2024-10-13 04:06:22,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-13 04:06:22,972 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 209 transitions. [2024-10-13 04:06:22,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-13 04:06:22,973 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:06:22,973 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:06:22,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 04:06:22,973 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:06:22,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:06:22,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1436078446, now seen corresponding path program 1 times [2024-10-13 04:06:22,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:06:22,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719968842] [2024-10-13 04:06:22,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:06:22,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:06:22,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:24,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:06:24,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:24,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:06:24,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:24,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:06:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:24,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:06:24,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:24,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:06:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:24,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:06:24,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:24,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:06:24,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:24,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:06:24,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:24,597 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-13 04:06:24,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:06:24,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719968842] [2024-10-13 04:06:24,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719968842] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:06:24,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:06:24,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 04:06:24,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015886007] [2024-10-13 04:06:24,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:06:24,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 04:06:24,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:06:24,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 04:06:24,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-10-13 04:06:24,600 INFO L87 Difference]: Start difference. First operand 153 states and 209 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-13 04:06:25,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:06:25,099 INFO L93 Difference]: Finished difference Result 182 states and 239 transitions. [2024-10-13 04:06:25,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 04:06:25,100 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 56 [2024-10-13 04:06:25,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:06:25,102 INFO L225 Difference]: With dead ends: 182 [2024-10-13 04:06:25,102 INFO L226 Difference]: Without dead ends: 180 [2024-10-13 04:06:25,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2024-10-13 04:06:25,102 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 95 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 04:06:25,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 185 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 04:06:25,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-13 04:06:25,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 160. [2024-10-13 04:06:25,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 115 states have (on average 1.2260869565217392) internal successors, (141), 116 states have internal predecessors, (141), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-13 04:06:25,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 217 transitions. [2024-10-13 04:06:25,129 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 217 transitions. Word has length 56 [2024-10-13 04:06:25,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:06:25,129 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 217 transitions. [2024-10-13 04:06:25,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-13 04:06:25,129 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 217 transitions. [2024-10-13 04:06:25,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-13 04:06:25,130 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:06:25,130 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:06:25,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 04:06:25,130 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:06:25,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:06:25,131 INFO L85 PathProgramCache]: Analyzing trace with hash 908570524, now seen corresponding path program 1 times [2024-10-13 04:06:25,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:06:25,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912908710] [2024-10-13 04:06:25,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:06:25,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:06:25,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:26,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:06:26,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:26,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:06:26,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:26,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:06:26,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:26,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:06:26,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:26,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:06:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:26,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:06:26,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:26,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:06:26,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:26,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:06:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:26,176 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-13 04:06:26,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:06:26,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912908710] [2024-10-13 04:06:26,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912908710] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:06:26,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:06:26,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-13 04:06:26,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839765862] [2024-10-13 04:06:26,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:06:26,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 04:06:26,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:06:26,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 04:06:26,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-13 04:06:26,177 INFO L87 Difference]: Start difference. First operand 160 states and 217 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-13 04:06:26,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:06:26,641 INFO L93 Difference]: Finished difference Result 206 states and 275 transitions. [2024-10-13 04:06:26,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 04:06:26,641 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 57 [2024-10-13 04:06:26,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:06:26,643 INFO L225 Difference]: With dead ends: 206 [2024-10-13 04:06:26,643 INFO L226 Difference]: Without dead ends: 204 [2024-10-13 04:06:26,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2024-10-13 04:06:26,643 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 120 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 04:06:26,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 153 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 04:06:26,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-10-13 04:06:26,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 192. [2024-10-13 04:06:26,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 138 states have (on average 1.2246376811594204) internal successors, (169), 139 states have internal predecessors, (169), 46 states have call successors, (46), 7 states have call predecessors, (46), 7 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-13 04:06:26,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 261 transitions. [2024-10-13 04:06:26,656 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 261 transitions. Word has length 57 [2024-10-13 04:06:26,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:06:26,656 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 261 transitions. [2024-10-13 04:06:26,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-13 04:06:26,656 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 261 transitions. [2024-10-13 04:06:26,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-13 04:06:26,657 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:06:26,657 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:06:26,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 04:06:26,658 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:06:26,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:06:26,658 INFO L85 PathProgramCache]: Analyzing trace with hash 423379049, now seen corresponding path program 1 times [2024-10-13 04:06:26,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:06:26,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358622673] [2024-10-13 04:06:26,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:06:26,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:06:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:26,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:06:26,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:26,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:06:26,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:26,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:06:26,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:26,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:06:26,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:26,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:06:26,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:26,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:06:26,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:26,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:06:26,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:26,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:06:26,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:26,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-13 04:06:26,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:26,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-13 04:06:26,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:26,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-13 04:06:26,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:26,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 04:06:26,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:26,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 04:06:26,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:26,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 04:06:26,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:26,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-13 04:06:26,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:26,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 04:06:26,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:26,735 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 04:06:26,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:06:26,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358622673] [2024-10-13 04:06:26,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358622673] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 04:06:26,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392233338] [2024-10-13 04:06:26,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:06:26,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:06:26,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:06:26,737 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 04:06:26,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 04:06:26,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:26,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 04:06:26,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:06:26,878 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 276 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2024-10-13 04:06:26,878 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:06:26,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392233338] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:06:26,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 04:06:26,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2024-10-13 04:06:26,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127552129] [2024-10-13 04:06:26,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:06:26,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 04:06:26,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:06:26,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 04:06:26,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:06:26,880 INFO L87 Difference]: Start difference. First operand 192 states and 261 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-13 04:06:26,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:06:26,903 INFO L93 Difference]: Finished difference Result 219 states and 291 transitions. [2024-10-13 04:06:26,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 04:06:26,904 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 107 [2024-10-13 04:06:26,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:06:26,907 INFO L225 Difference]: With dead ends: 219 [2024-10-13 04:06:26,907 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 04:06:26,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:06:26,908 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 7 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:06:26,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 64 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:06:26,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 04:06:26,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 04:06:26,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 04:06:26,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 04:06:26,908 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 107 [2024-10-13 04:06:26,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:06:26,908 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 04:06:26,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-13 04:06:26,909 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 04:06:26,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 04:06:26,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 04:06:26,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 04:06:27,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-13 04:06:27,119 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:06:27,122 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 04:06:30,671 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 04:06:30,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 04:06:30 BoogieIcfgContainer [2024-10-13 04:06:30,687 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 04:06:30,687 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 04:06:30,687 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 04:06:30,687 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 04:06:30,691 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:06:04" (3/4) ... [2024-10-13 04:06:30,693 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 04:06:30,695 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-13 04:06:30,699 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-10-13 04:06:30,699 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-13 04:06:30,699 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 04:06:30,700 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 04:06:30,775 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 04:06:30,775 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 04:06:30,775 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 04:06:30,776 INFO L158 Benchmark]: Toolchain (without parser) took 27432.70ms. Allocated memory was 136.3MB in the beginning and 253.8MB in the end (delta: 117.4MB). Free memory was 67.5MB in the beginning and 188.9MB in the end (delta: -121.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:06:30,776 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 136.3MB. Free memory is still 88.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:06:30,776 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.18ms. Allocated memory was 136.3MB in the beginning and 205.5MB in the end (delta: 69.2MB). Free memory was 67.2MB in the beginning and 173.9MB in the end (delta: -106.7MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. [2024-10-13 04:06:30,776 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.60ms. Allocated memory is still 205.5MB. Free memory was 173.9MB in the beginning and 171.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 04:06:30,776 INFO L158 Benchmark]: Boogie Preprocessor took 51.31ms. Allocated memory is still 205.5MB. Free memory was 171.8MB in the beginning and 167.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 04:06:30,777 INFO L158 Benchmark]: RCFGBuilder took 356.32ms. Allocated memory is still 205.5MB. Free memory was 167.6MB in the beginning and 147.7MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 04:06:30,777 INFO L158 Benchmark]: TraceAbstraction took 26633.64ms. Allocated memory was 205.5MB in the beginning and 253.8MB in the end (delta: 48.2MB). Free memory was 146.7MB in the beginning and 194.1MB in the end (delta: -47.5MB). Peak memory consumption was 122.1MB. Max. memory is 16.1GB. [2024-10-13 04:06:30,777 INFO L158 Benchmark]: Witness Printer took 88.07ms. Allocated memory is still 253.8MB. Free memory was 193.1MB in the beginning and 188.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 04:06:30,778 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 136.3MB. Free memory is still 88.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 260.18ms. Allocated memory was 136.3MB in the beginning and 205.5MB in the end (delta: 69.2MB). Free memory was 67.2MB in the beginning and 173.9MB in the end (delta: -106.7MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.60ms. Allocated memory is still 205.5MB. Free memory was 173.9MB in the beginning and 171.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.31ms. Allocated memory is still 205.5MB. Free memory was 171.8MB in the beginning and 167.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 356.32ms. Allocated memory is still 205.5MB. Free memory was 167.6MB in the beginning and 147.7MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 26633.64ms. Allocated memory was 205.5MB in the beginning and 253.8MB in the end (delta: 48.2MB). Free memory was 146.7MB in the beginning and 194.1MB in the end (delta: -47.5MB). Peak memory consumption was 122.1MB. Max. memory is 16.1GB. * Witness Printer took 88.07ms. Allocated memory is still 253.8MB. Free memory was 193.1MB in the beginning and 188.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.0s, OverallIterations: 11, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 587 SdHoareTripleChecker+Valid, 10.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 587 mSDsluCounter, 1428 SdHoareTripleChecker+Invalid, 10.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 955 mSDsCounter, 198 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1014 IncrementalHoareTripleChecker+Invalid, 1214 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 198 mSolverCounterUnsat, 473 mSDtfsCounter, 1014 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 419 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=192occurred in iteration=10, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 163 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 10.5s InterpolantComputationTime, 765 NumberOfCodeBlocks, 765 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 753 ConstructedInterpolants, 0 QuantifiedInterpolants, 4102 SizeOfPredicates, 0 NumberOfNonLiveVariables, 251 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 2119/2120 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: (((((((var_1_12 == var_1_5) && (1 <= k_loop)) && (var_1_11 == var_1_7)) && (var_1_11 <= 65535)) && (var_1_9 == 0)) || (((((var_1_12 == var_1_5) && (last_1_var_1_10 == 1)) && (1 <= k_loop)) && (var_1_10 == 1)) && (var_1_7 == var_1_11))) || ((((((last_1_var_1_10 == 1) && (var_1_10 == 1)) && (var_1_1 == 10)) && (0 <= k_loop)) && (var_1_8 == 128)) && (128 == last_1_var_1_8))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (((((((last_1_var_1_10 == 1) && (var_1_10 == 1)) && ((118 + var_1_1) <= last_1_var_1_8)) && (last_1_var_1_8 <= 128)) && ((118 + var_1_1) <= var_1_8)) && (var_1_8 <= 128)) && (10 <= var_1_1)) Ensures: (((((((last_1_var_1_10 == 1) && (var_1_10 == 1)) && ((118 + var_1_1) <= last_1_var_1_8)) && (last_1_var_1_8 <= 128)) && ((118 + var_1_1) <= var_1_8)) && (var_1_8 <= 128)) && (10 <= var_1_1)) RESULT: Ultimate proved your program to be correct! [2024-10-13 04:06:30,817 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 Writing output log to file Ultimate.log Result: TRUE