./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f 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 ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-4.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 29b733e97215d9729c0bee0ddf8d5a148e778c069ba15b669920716d39a28aa2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 10:40:07,621 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 10:40:07,685 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 10:40:07,693 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 10:40:07,694 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 10:40:07,708 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 10:40:07,710 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 10:40:07,711 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 10:40:07,711 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 10:40:07,712 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 10:40:07,713 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 10:40:07,713 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 10:40:07,713 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 10:40:07,714 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 10:40:07,714 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 10:40:07,715 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 10:40:07,715 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 10:40:07,716 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 10:40:07,716 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 10:40:07,716 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 10:40:07,716 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 10:40:07,719 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 10:40:07,719 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 10:40:07,719 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 10:40:07,719 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 10:40:07,720 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 10:40:07,720 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 10:40:07,720 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 10:40:07,720 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 10:40:07,720 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 10:40:07,720 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 10:40:07,720 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 10:40:07,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:40:07,721 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 10:40:07,721 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 10:40:07,721 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 10:40:07,721 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 10:40:07,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 10:40:07,721 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 10:40:07,722 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 10:40:07,722 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 10:40:07,723 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 10:40:07,723 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 -> 29b733e97215d9729c0bee0ddf8d5a148e778c069ba15b669920716d39a28aa2 [2024-11-22 10:40:07,920 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 10:40:07,944 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 10:40:07,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 10:40:07,948 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 10:40:07,948 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 10:40:07,949 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-4.i [2024-11-22 10:40:09,278 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 10:40:09,443 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 10:40:09,444 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-4.i [2024-11-22 10:40:09,450 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2704bdf85/a38b320207d2450a83bb1bf9cf0a17e7/FLAGc6555deb8 [2024-11-22 10:40:09,463 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2704bdf85/a38b320207d2450a83bb1bf9cf0a17e7 [2024-11-22 10:40:09,465 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 10:40:09,467 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 10:40:09,468 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 10:40:09,469 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 10:40:09,473 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 10:40:09,474 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:40:09" (1/1) ... [2024-11-22 10:40:09,476 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39c4b80a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:09, skipping insertion in model container [2024-11-22 10:40:09,476 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:40:09" (1/1) ... [2024-11-22 10:40:09,497 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 10:40:09,637 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-4.i[914,927] [2024-11-22 10:40:09,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:40:09,685 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 10:40:09,693 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-4.i[914,927] [2024-11-22 10:40:09,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:40:09,729 INFO L204 MainTranslator]: Completed translation [2024-11-22 10:40:09,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:09 WrapperNode [2024-11-22 10:40:09,730 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 10:40:09,731 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 10:40:09,731 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 10:40:09,731 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 10:40:09,736 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:09" (1/1) ... [2024-11-22 10:40:09,743 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:09" (1/1) ... [2024-11-22 10:40:09,767 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 104 [2024-11-22 10:40:09,768 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 10:40:09,768 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 10:40:09,769 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 10:40:09,769 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 10:40:09,779 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:09" (1/1) ... [2024-11-22 10:40:09,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:09" (1/1) ... [2024-11-22 10:40:09,782 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:09" (1/1) ... [2024-11-22 10:40:09,798 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-22 10:40:09,800 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:09" (1/1) ... [2024-11-22 10:40:09,800 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:09" (1/1) ... [2024-11-22 10:40:09,804 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:09" (1/1) ... [2024-11-22 10:40:09,810 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:09" (1/1) ... [2024-11-22 10:40:09,816 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:09" (1/1) ... [2024-11-22 10:40:09,817 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:09" (1/1) ... [2024-11-22 10:40:09,819 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 10:40:09,820 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 10:40:09,820 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 10:40:09,820 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 10:40:09,821 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:09" (1/1) ... [2024-11-22 10:40:09,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:40:09,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:40:09,857 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 10:40:09,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 10:40:09,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 10:40:09,903 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 10:40:09,903 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 10:40:09,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 10:40:09,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 10:40:09,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 10:40:09,965 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 10:40:09,969 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 10:40:10,170 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-22 10:40:10,170 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 10:40:10,186 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 10:40:10,186 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 10:40:10,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:40:10 BoogieIcfgContainer [2024-11-22 10:40:10,187 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 10:40:10,189 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 10:40:10,190 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 10:40:10,193 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 10:40:10,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:40:09" (1/3) ... [2024-11-22 10:40:10,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34ce60fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:40:10, skipping insertion in model container [2024-11-22 10:40:10,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:09" (2/3) ... [2024-11-22 10:40:10,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34ce60fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:40:10, skipping insertion in model container [2024-11-22 10:40:10,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:40:10" (3/3) ... [2024-11-22 10:40:10,196 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-4.i [2024-11-22 10:40:10,212 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 10:40:10,212 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 10:40:10,270 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 10:40:10,275 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;@5ab0ca92, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 10:40:10,275 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 10:40:10,279 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-22 10:40:10,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-22 10:40:10,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:40:10,289 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:40:10,290 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:40:10,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:40:10,296 INFO L85 PathProgramCache]: Analyzing trace with hash -395988458, now seen corresponding path program 1 times [2024-11-22 10:40:10,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:40:10,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721643289] [2024-11-22 10:40:10,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:40:10,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:40:10,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:40:10,633 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-11-22 10:40:10,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:40:10,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721643289] [2024-11-22 10:40:10,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721643289] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 10:40:10,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62533936] [2024-11-22 10:40:10,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:40:10,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:40:10,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:40:10,638 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 10:40:10,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 10:40:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:40:10,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 10:40:10,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:40:10,782 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-11-22 10:40:10,782 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 10:40:10,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62533936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:40:10,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 10:40:10,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 10:40:10,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969785977] [2024-11-22 10:40:10,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:40:10,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 10:40:10,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:40:10,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 10:40:10,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 10:40:10,812 INFO L87 Difference]: Start difference. First operand has 50 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-22 10:40:10,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:40:10,830 INFO L93 Difference]: Finished difference Result 97 states and 158 transitions. [2024-11-22 10:40:10,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 10:40:10,832 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 96 [2024-11-22 10:40:10,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:40:10,837 INFO L225 Difference]: With dead ends: 97 [2024-11-22 10:40:10,837 INFO L226 Difference]: Without dead ends: 46 [2024-11-22 10:40:10,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 10:40:10,842 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 10:40:10,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:40:10,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-22 10:40:10,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-22 10:40:10,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-22 10:40:10,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 66 transitions. [2024-11-22 10:40:10,875 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 66 transitions. Word has length 96 [2024-11-22 10:40:10,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:40:10,876 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 66 transitions. [2024-11-22 10:40:10,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-22 10:40:10,876 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 66 transitions. [2024-11-22 10:40:10,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-22 10:40:10,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:40:10,879 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:40:10,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 10:40:11,080 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,SelfDestructingSolverStorable0 [2024-11-22 10:40:11,080 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:40:11,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:40:11,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1172445864, now seen corresponding path program 1 times [2024-11-22 10:40:11,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:40:11,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798220930] [2024-11-22 10:40:11,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:40:11,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:40:11,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:40:13,722 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-22 10:40:13,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:40:13,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798220930] [2024-11-22 10:40:13,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798220930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:40:13,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:40:13,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 10:40:13,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379015603] [2024-11-22 10:40:13,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:40:13,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 10:40:13,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:40:13,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 10:40:13,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-22 10:40:13,727 INFO L87 Difference]: Start difference. First operand 46 states and 66 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 10:40:14,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:40:14,146 INFO L93 Difference]: Finished difference Result 86 states and 111 transitions. [2024-11-22 10:40:14,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 10:40:14,147 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 96 [2024-11-22 10:40:14,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:40:14,149 INFO L225 Difference]: With dead ends: 86 [2024-11-22 10:40:14,149 INFO L226 Difference]: Without dead ends: 84 [2024-11-22 10:40:14,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-11-22 10:40:14,151 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 80 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 10:40:14,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 305 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 10:40:14,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-22 10:40:14,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 53. [2024-11-22 10:40:14,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-22 10:40:14,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 75 transitions. [2024-11-22 10:40:14,162 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 75 transitions. Word has length 96 [2024-11-22 10:40:14,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:40:14,167 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 75 transitions. [2024-11-22 10:40:14,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 10:40:14,168 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 75 transitions. [2024-11-22 10:40:14,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-22 10:40:14,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:40:14,169 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:40:14,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 10:40:14,169 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:40:14,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:40:14,170 INFO L85 PathProgramCache]: Analyzing trace with hash 2073323580, now seen corresponding path program 1 times [2024-11-22 10:40:14,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:40:14,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638842410] [2024-11-22 10:40:14,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:40:14,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:40:14,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:40:18,803 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-22 10:40:18,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:40:18,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638842410] [2024-11-22 10:40:18,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638842410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:40:18,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:40:18,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-22 10:40:18,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520765030] [2024-11-22 10:40:18,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:40:18,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 10:40:18,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:40:18,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 10:40:18,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-22 10:40:18,807 INFO L87 Difference]: Start difference. First operand 53 states and 75 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 10:40:19,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:40:19,762 INFO L93 Difference]: Finished difference Result 82 states and 108 transitions. [2024-11-22 10:40:19,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 10:40:19,763 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 97 [2024-11-22 10:40:19,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:40:19,765 INFO L225 Difference]: With dead ends: 82 [2024-11-22 10:40:19,767 INFO L226 Difference]: Without dead ends: 80 [2024-11-22 10:40:19,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-11-22 10:40:19,769 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 74 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 10:40:19,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 281 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 10:40:19,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-22 10:40:19,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 54. [2024-11-22 10:40:19,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 states have internal predecessors, (47), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-22 10:40:19,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 77 transitions. [2024-11-22 10:40:19,790 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 77 transitions. Word has length 97 [2024-11-22 10:40:19,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:40:19,791 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 77 transitions. [2024-11-22 10:40:19,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 10:40:19,791 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 77 transitions. [2024-11-22 10:40:19,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-22 10:40:19,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:40:19,795 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:40:19,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 10:40:19,796 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:40:19,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:40:19,796 INFO L85 PathProgramCache]: Analyzing trace with hash 2075170622, now seen corresponding path program 1 times [2024-11-22 10:40:19,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:40:19,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545075738] [2024-11-22 10:40:19,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:40:19,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:40:19,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:40:21,506 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-22 10:40:21,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:40:21,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545075738] [2024-11-22 10:40:21,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545075738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:40:21,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:40:21,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-22 10:40:21,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920997803] [2024-11-22 10:40:21,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:40:21,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 10:40:21,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:40:21,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 10:40:21,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-22 10:40:21,509 INFO L87 Difference]: Start difference. First operand 54 states and 77 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 10:40:22,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:40:22,183 INFO L93 Difference]: Finished difference Result 78 states and 104 transitions. [2024-11-22 10:40:22,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 10:40:22,184 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 97 [2024-11-22 10:40:22,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:40:22,185 INFO L225 Difference]: With dead ends: 78 [2024-11-22 10:40:22,186 INFO L226 Difference]: Without dead ends: 76 [2024-11-22 10:40:22,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-22 10:40:22,187 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 68 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 10:40:22,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 299 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 10:40:22,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-22 10:40:22,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 54. [2024-11-22 10:40:22,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 states have internal predecessors, (47), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-22 10:40:22,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 77 transitions. [2024-11-22 10:40:22,200 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 77 transitions. Word has length 97 [2024-11-22 10:40:22,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:40:22,201 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 77 transitions. [2024-11-22 10:40:22,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 10:40:22,201 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 77 transitions. [2024-11-22 10:40:22,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-22 10:40:22,202 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:40:22,202 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:40:22,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 10:40:22,202 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:40:22,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:40:22,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1927659678, now seen corresponding path program 1 times [2024-11-22 10:40:22,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:40:22,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053664219] [2024-11-22 10:40:22,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:40:22,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:40:22,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:40:25,142 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-22 10:40:25,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:40:25,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053664219] [2024-11-22 10:40:25,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053664219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:40:25,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:40:25,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 10:40:25,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147161779] [2024-11-22 10:40:25,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:40:25,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 10:40:25,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:40:25,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 10:40:25,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-22 10:40:25,145 INFO L87 Difference]: Start difference. First operand 54 states and 77 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 10:40:25,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:40:25,503 INFO L93 Difference]: Finished difference Result 125 states and 176 transitions. [2024-11-22 10:40:25,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 10:40:25,504 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 97 [2024-11-22 10:40:25,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:40:25,505 INFO L225 Difference]: With dead ends: 125 [2024-11-22 10:40:25,505 INFO L226 Difference]: Without dead ends: 74 [2024-11-22 10:40:25,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-22 10:40:25,506 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 37 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 10:40:25,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 302 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 10:40:25,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-22 10:40:25,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 57. [2024-11-22 10:40:25,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-22 10:40:25,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 81 transitions. [2024-11-22 10:40:25,511 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 81 transitions. Word has length 97 [2024-11-22 10:40:25,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:40:25,511 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 81 transitions. [2024-11-22 10:40:25,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 10:40:25,511 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 81 transitions. [2024-11-22 10:40:25,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-22 10:40:25,512 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:40:25,512 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:40:25,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 10:40:25,513 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:40:25,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:40:25,513 INFO L85 PathProgramCache]: Analyzing trace with hash -592300256, now seen corresponding path program 1 times [2024-11-22 10:40:25,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:40:25,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763827474] [2024-11-22 10:40:25,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:40:25,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:40:25,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:40:28,514 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-22 10:40:28,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:40:28,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763827474] [2024-11-22 10:40:28,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763827474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:40:28,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:40:28,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 10:40:28,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823091673] [2024-11-22 10:40:28,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:40:28,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 10:40:28,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:40:28,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 10:40:28,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-22 10:40:28,519 INFO L87 Difference]: Start difference. First operand 57 states and 81 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 10:40:28,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:40:28,900 INFO L93 Difference]: Finished difference Result 133 states and 187 transitions. [2024-11-22 10:40:28,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 10:40:28,901 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 97 [2024-11-22 10:40:28,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:40:28,902 INFO L225 Difference]: With dead ends: 133 [2024-11-22 10:40:28,902 INFO L226 Difference]: Without dead ends: 79 [2024-11-22 10:40:28,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-22 10:40:28,904 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 19 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 10:40:28,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 304 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 10:40:28,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-22 10:40:28,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 60. [2024-11-22 10:40:28,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-22 10:40:28,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 86 transitions. [2024-11-22 10:40:28,913 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 86 transitions. Word has length 97 [2024-11-22 10:40:28,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:40:28,914 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 86 transitions. [2024-11-22 10:40:28,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 10:40:28,914 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 86 transitions. [2024-11-22 10:40:28,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-22 10:40:28,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:40:28,915 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:40:28,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 10:40:28,915 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:40:28,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:40:28,916 INFO L85 PathProgramCache]: Analyzing trace with hash -614530047, now seen corresponding path program 1 times [2024-11-22 10:40:28,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:40:28,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864311334] [2024-11-22 10:40:28,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:40:28,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:40:28,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:40:31,844 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-22 10:40:31,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:40:31,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864311334] [2024-11-22 10:40:31,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864311334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:40:31,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:40:31,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-22 10:40:31,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183317711] [2024-11-22 10:40:31,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:40:31,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 10:40:31,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:40:31,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 10:40:31,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-22 10:40:31,847 INFO L87 Difference]: Start difference. First operand 60 states and 86 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 10:40:32,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:40:32,216 INFO L93 Difference]: Finished difference Result 100 states and 129 transitions. [2024-11-22 10:40:32,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 10:40:32,217 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 97 [2024-11-22 10:40:32,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:40:32,220 INFO L225 Difference]: With dead ends: 100 [2024-11-22 10:40:32,220 INFO L226 Difference]: Without dead ends: 98 [2024-11-22 10:40:32,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-22 10:40:32,220 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 48 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 10:40:32,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 427 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 10:40:32,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-22 10:40:32,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 62. [2024-11-22 10:40:32,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 45 states have internal predecessors, (59), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-22 10:40:32,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 89 transitions. [2024-11-22 10:40:32,225 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 89 transitions. Word has length 97 [2024-11-22 10:40:32,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:40:32,225 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 89 transitions. [2024-11-22 10:40:32,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 10:40:32,226 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 89 transitions. [2024-11-22 10:40:32,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-22 10:40:32,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:40:32,227 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:40:32,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 10:40:32,227 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:40:32,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:40:32,228 INFO L85 PathProgramCache]: Analyzing trace with hash -83752103, now seen corresponding path program 1 times [2024-11-22 10:40:32,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:40:32,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209086366] [2024-11-22 10:40:32,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:40:32,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:40:32,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:40:34,301 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-22 10:40:34,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:40:34,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209086366] [2024-11-22 10:40:34,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209086366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:40:34,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:40:34,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-22 10:40:34,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732864060] [2024-11-22 10:40:34,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:40:34,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 10:40:34,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:40:34,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 10:40:34,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-22 10:40:34,303 INFO L87 Difference]: Start difference. First operand 62 states and 89 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 10:40:34,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:40:34,572 INFO L93 Difference]: Finished difference Result 158 states and 220 transitions. [2024-11-22 10:40:34,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 10:40:34,574 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 98 [2024-11-22 10:40:34,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:40:34,575 INFO L225 Difference]: With dead ends: 158 [2024-11-22 10:40:34,575 INFO L226 Difference]: Without dead ends: 99 [2024-11-22 10:40:34,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-22 10:40:34,577 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 39 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 10:40:34,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 566 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 10:40:34,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-22 10:40:34,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 81. [2024-11-22 10:40:34,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 61 states have internal predecessors, (76), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-22 10:40:34,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 112 transitions. [2024-11-22 10:40:34,584 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 112 transitions. Word has length 98 [2024-11-22 10:40:34,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:40:34,585 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 112 transitions. [2024-11-22 10:40:34,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 10:40:34,585 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 112 transitions. [2024-11-22 10:40:34,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-22 10:40:34,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:40:34,586 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:40:34,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 10:40:34,586 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:40:34,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:40:34,587 INFO L85 PathProgramCache]: Analyzing trace with hash -2106122573, now seen corresponding path program 1 times [2024-11-22 10:40:34,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:40:34,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174598996] [2024-11-22 10:40:34,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:40:34,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:40:34,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:40:38,189 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-22 10:40:38,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:40:38,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174598996] [2024-11-22 10:40:38,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174598996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:40:38,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:40:38,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-22 10:40:38,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341582252] [2024-11-22 10:40:38,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:40:38,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 10:40:38,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:40:38,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 10:40:38,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-22 10:40:38,192 INFO L87 Difference]: Start difference. First operand 81 states and 112 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 10:40:38,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:40:38,952 INFO L93 Difference]: Finished difference Result 118 states and 150 transitions. [2024-11-22 10:40:38,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 10:40:38,953 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 98 [2024-11-22 10:40:38,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:40:38,955 INFO L225 Difference]: With dead ends: 118 [2024-11-22 10:40:38,955 INFO L226 Difference]: Without dead ends: 116 [2024-11-22 10:40:38,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2024-11-22 10:40:38,956 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 73 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 10:40:38,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 298 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 10:40:38,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-22 10:40:38,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 82. [2024-11-22 10:40:38,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 61 states have (on average 1.278688524590164) internal successors, (78), 62 states have internal predecessors, (78), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-22 10:40:38,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 114 transitions. [2024-11-22 10:40:38,969 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 114 transitions. Word has length 98 [2024-11-22 10:40:38,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:40:38,969 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 114 transitions. [2024-11-22 10:40:38,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 10:40:38,969 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 114 transitions. [2024-11-22 10:40:38,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-22 10:40:38,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:40:38,970 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:40:38,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 10:40:38,970 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:40:38,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:40:38,970 INFO L85 PathProgramCache]: Analyzing trace with hash -2104275531, now seen corresponding path program 1 times [2024-11-22 10:40:38,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:40:38,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608626667] [2024-11-22 10:40:38,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:40:38,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:40:38,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:40:42,151 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-22 10:40:42,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:40:42,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608626667] [2024-11-22 10:40:42,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608626667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:40:42,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:40:42,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-22 10:40:42,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560684709] [2024-11-22 10:40:42,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:40:42,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 10:40:42,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:40:42,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 10:40:42,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-22 10:40:42,152 INFO L87 Difference]: Start difference. First operand 82 states and 114 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 10:40:42,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:40:42,683 INFO L93 Difference]: Finished difference Result 113 states and 145 transitions. [2024-11-22 10:40:42,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 10:40:42,684 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 98 [2024-11-22 10:40:42,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:40:42,684 INFO L225 Difference]: With dead ends: 113 [2024-11-22 10:40:42,684 INFO L226 Difference]: Without dead ends: 111 [2024-11-22 10:40:42,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-11-22 10:40:42,685 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 67 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 10:40:42,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 318 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 10:40:42,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-22 10:40:42,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 79. [2024-11-22 10:40:42,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 59 states have internal predecessors, (73), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-22 10:40:42,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 109 transitions. [2024-11-22 10:40:42,696 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 109 transitions. Word has length 98 [2024-11-22 10:40:42,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:40:42,698 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 109 transitions. [2024-11-22 10:40:42,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 10:40:42,699 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 109 transitions. [2024-11-22 10:40:42,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-22 10:40:42,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:40:42,700 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:40:42,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 10:40:42,700 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:40:42,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:40:42,701 INFO L85 PathProgramCache]: Analyzing trace with hash 2043180821, now seen corresponding path program 1 times [2024-11-22 10:40:42,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:40:42,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240485629] [2024-11-22 10:40:42,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:40:42,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:40:42,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:40:45,099 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-22 10:40:45,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:40:45,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240485629] [2024-11-22 10:40:45,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240485629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:40:45,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:40:45,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-22 10:40:45,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459516317] [2024-11-22 10:40:45,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:40:45,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 10:40:45,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:40:45,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 10:40:45,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-22 10:40:45,100 INFO L87 Difference]: Start difference. First operand 79 states and 109 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 10:40:45,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:40:45,327 INFO L93 Difference]: Finished difference Result 176 states and 238 transitions. [2024-11-22 10:40:45,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 10:40:45,328 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 98 [2024-11-22 10:40:45,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:40:45,328 INFO L225 Difference]: With dead ends: 176 [2024-11-22 10:40:45,329 INFO L226 Difference]: Without dead ends: 100 [2024-11-22 10:40:45,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-11-22 10:40:45,329 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 54 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 10:40:45,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 234 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 10:40:45,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-22 10:40:45,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 79. [2024-11-22 10:40:45,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 59 states have internal predecessors, (73), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-22 10:40:45,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 109 transitions. [2024-11-22 10:40:45,336 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 109 transitions. Word has length 98 [2024-11-22 10:40:45,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:40:45,337 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 109 transitions. [2024-11-22 10:40:45,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 10:40:45,337 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 109 transitions. [2024-11-22 10:40:45,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-22 10:40:45,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:40:45,338 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:40:45,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 10:40:45,338 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:40:45,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:40:45,339 INFO L85 PathProgramCache]: Analyzing trace with hash -476779113, now seen corresponding path program 1 times [2024-11-22 10:40:45,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:40:45,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253788704] [2024-11-22 10:40:45,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:40:45,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:40:45,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:40:47,945 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-22 10:40:47,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:40:47,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253788704] [2024-11-22 10:40:47,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253788704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:40:47,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:40:47,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-22 10:40:47,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161051907] [2024-11-22 10:40:47,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:40:47,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 10:40:47,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:40:47,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 10:40:47,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-22 10:40:47,946 INFO L87 Difference]: Start difference. First operand 79 states and 109 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 10:40:48,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:40:48,434 INFO L93 Difference]: Finished difference Result 166 states and 228 transitions. [2024-11-22 10:40:48,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 10:40:48,434 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 98 [2024-11-22 10:40:48,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:40:48,435 INFO L225 Difference]: With dead ends: 166 [2024-11-22 10:40:48,435 INFO L226 Difference]: Without dead ends: 0 [2024-11-22 10:40:48,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-22 10:40:48,437 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 17 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 10:40:48,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 469 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 10:40:48,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-22 10:40:48,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-22 10:40:48,438 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-11-22 10:40:48,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-22 10:40:48,439 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 98 [2024-11-22 10:40:48,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:40:48,439 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-22 10:40:48,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 10:40:48,439 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-22 10:40:48,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-22 10:40:48,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 10:40:48,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 10:40:48,447 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:40:48,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-22 10:40:48,928 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 10:40:48,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 10:40:48 BoogieIcfgContainer [2024-11-22 10:40:48,945 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 10:40:48,945 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 10:40:48,945 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 10:40:48,945 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 10:40:48,946 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:40:10" (3/4) ... [2024-11-22 10:40:48,948 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-22 10:40:48,951 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-22 10:40:48,954 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-22 10:40:48,955 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-22 10:40:48,955 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-22 10:40:48,955 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-22 10:40:49,041 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-22 10:40:49,041 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-22 10:40:49,041 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 10:40:49,042 INFO L158 Benchmark]: Toolchain (without parser) took 39575.97ms. Allocated memory was 172.0MB in the beginning and 1.0GB in the end (delta: 868.2MB). Free memory was 125.4MB in the beginning and 650.1MB in the end (delta: -524.7MB). Peak memory consumption was 345.2MB. Max. memory is 16.1GB. [2024-11-22 10:40:49,042 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 172.0MB. Free memory is still 134.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 10:40:49,043 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.60ms. Allocated memory is still 172.0MB. Free memory was 125.0MB in the beginning and 110.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-22 10:40:49,043 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.29ms. Allocated memory is still 172.0MB. Free memory was 110.3MB in the beginning and 107.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 10:40:49,043 INFO L158 Benchmark]: Boogie Preprocessor took 50.96ms. Allocated memory is still 172.0MB. Free memory was 107.1MB in the beginning and 103.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 10:40:49,043 INFO L158 Benchmark]: RCFGBuilder took 366.66ms. Allocated memory is still 172.0MB. Free memory was 103.5MB in the beginning and 85.6MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-22 10:40:49,044 INFO L158 Benchmark]: TraceAbstraction took 38755.68ms. Allocated memory was 172.0MB in the beginning and 1.0GB in the end (delta: 868.2MB). Free memory was 85.1MB in the beginning and 655.4MB in the end (delta: -570.2MB). Peak memory consumption was 301.1MB. Max. memory is 16.1GB. [2024-11-22 10:40:49,044 INFO L158 Benchmark]: Witness Printer took 96.46ms. Allocated memory is still 1.0GB. Free memory was 655.4MB in the beginning and 650.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 10:40:49,045 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.11ms. Allocated memory is still 172.0MB. Free memory is still 134.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 261.60ms. Allocated memory is still 172.0MB. Free memory was 125.0MB in the beginning and 110.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.29ms. Allocated memory is still 172.0MB. Free memory was 110.3MB in the beginning and 107.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.96ms. Allocated memory is still 172.0MB. Free memory was 107.1MB in the beginning and 103.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 366.66ms. Allocated memory is still 172.0MB. Free memory was 103.5MB in the beginning and 85.6MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 38755.68ms. Allocated memory was 172.0MB in the beginning and 1.0GB in the end (delta: 868.2MB). Free memory was 85.1MB in the beginning and 655.4MB in the end (delta: -570.2MB). Peak memory consumption was 301.1MB. Max. memory is 16.1GB. * Witness Printer took 96.46ms. Allocated memory is still 1.0GB. Free memory was 655.4MB in the beginning and 650.1MB in the end (delta: 5.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, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 38.2s, OverallIterations: 12, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 576 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 576 mSDsluCounter, 3873 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3108 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1810 IncrementalHoareTripleChecker+Invalid, 1863 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 765 mSDtfsCounter, 1810 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 264 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=9, InterpolantAutomatonStates: 113, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 256 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 31.5s InterpolantComputationTime, 1263 NumberOfCodeBlocks, 1263 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1250 ConstructedInterpolants, 0 QuantifiedInterpolants, 10440 SizeOfPredicates, 0 NumberOfNonLiveVariables, 224 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 5432/5460 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: 96]: Loop Invariant Derived loop invariant: ((((((last_1_var_1_9 / var_1_3) < last_1_var_1_9) || (var_1_5 < var_1_6)) || (var_1_6 == var_1_1)) && ((((last_1_var_1_9 / var_1_3) < last_1_var_1_9) || (var_1_6 < (var_1_5 + 1))) || (var_1_1 == var_1_5))) || (0 <= ((int) var_1_3 + last_1_var_1_9))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_3 == \old(var_1_3))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (last_1_var_1_9 == \old(last_1_var_1_9))) RESULT: Ultimate proved your program to be correct! [2024-11-22 10:40:49,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE