./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-59.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 838365b849078ce23c8f5047cd4aafa49e92ec0b6863e12a604d1c5b7130a939 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 08:55:17,363 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 08:55:17,426 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 08:55:17,432 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 08:55:17,432 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 08:55:17,474 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 08:55:17,475 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 08:55:17,475 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 08:55:17,475 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 08:55:17,476 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 08:55:17,476 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 08:55:17,476 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 08:55:17,476 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 08:55:17,477 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 08:55:17,477 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 08:55:17,478 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 08:55:17,478 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 08:55:17,480 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 08:55:17,480 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 08:55:17,480 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 08:55:17,480 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 08:55:17,481 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 08:55:17,481 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 08:55:17,481 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 08:55:17,481 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 08:55:17,481 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 08:55:17,481 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 08:55:17,482 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 08:55:17,482 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 08:55:17,482 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 08:55:17,482 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 08:55:17,482 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 08:55:17,482 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:55:17,483 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 08:55:17,483 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 08:55:17,483 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 08:55:17,483 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 08:55:17,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 08:55:17,483 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 08:55:17,483 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 08:55:17,484 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 08:55:17,486 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 08:55:17,486 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 -> 838365b849078ce23c8f5047cd4aafa49e92ec0b6863e12a604d1c5b7130a939 [2024-11-10 08:55:17,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 08:55:17,736 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 08:55:17,739 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 08:55:17,740 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 08:55:17,741 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 08:55:17,742 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-59.i [2024-11-10 08:55:19,177 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 08:55:19,361 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 08:55:19,361 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-59.i [2024-11-10 08:55:19,369 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa4e1febb/3d9105d3c7c947fd8b438f69425b10e1/FLAGc11055bc9 [2024-11-10 08:55:19,381 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa4e1febb/3d9105d3c7c947fd8b438f69425b10e1 [2024-11-10 08:55:19,388 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 08:55:19,389 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 08:55:19,390 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 08:55:19,390 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 08:55:19,399 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 08:55:19,400 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:55:19" (1/1) ... [2024-11-10 08:55:19,401 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e2c5f5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:19, skipping insertion in model container [2024-11-10 08:55:19,401 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:55:19" (1/1) ... [2024-11-10 08:55:19,422 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 08:55:19,589 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-59.i[915,928] [2024-11-10 08:55:19,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:55:19,673 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 08:55:19,683 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-59.i[915,928] [2024-11-10 08:55:19,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:55:19,746 INFO L204 MainTranslator]: Completed translation [2024-11-10 08:55:19,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:19 WrapperNode [2024-11-10 08:55:19,747 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 08:55:19,748 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 08:55:19,748 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 08:55:19,748 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 08:55:19,754 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:19" (1/1) ... [2024-11-10 08:55:19,768 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:19" (1/1) ... [2024-11-10 08:55:19,811 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 128 [2024-11-10 08:55:19,812 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 08:55:19,813 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 08:55:19,813 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 08:55:19,813 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 08:55:19,822 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:19" (1/1) ... [2024-11-10 08:55:19,823 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:19" (1/1) ... [2024-11-10 08:55:19,826 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:19" (1/1) ... [2024-11-10 08:55:19,873 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-10 08:55:19,874 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:19" (1/1) ... [2024-11-10 08:55:19,874 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:19" (1/1) ... [2024-11-10 08:55:19,883 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:19" (1/1) ... [2024-11-10 08:55:19,890 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:19" (1/1) ... [2024-11-10 08:55:19,893 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:19" (1/1) ... [2024-11-10 08:55:19,894 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:19" (1/1) ... [2024-11-10 08:55:19,901 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 08:55:19,906 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 08:55:19,906 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 08:55:19,906 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 08:55:19,907 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:19" (1/1) ... [2024-11-10 08:55:19,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:55:19,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:55:19,961 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-10 08:55:19,964 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-10 08:55:20,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 08:55:20,025 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 08:55:20,029 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 08:55:20,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 08:55:20,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 08:55:20,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 08:55:20,138 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 08:55:20,140 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 08:55:20,499 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-10 08:55:20,500 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 08:55:20,513 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 08:55:20,514 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 08:55:20,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:55:20 BoogieIcfgContainer [2024-11-10 08:55:20,514 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 08:55:20,519 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 08:55:20,520 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 08:55:20,523 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 08:55:20,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:55:19" (1/3) ... [2024-11-10 08:55:20,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38215380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:55:20, skipping insertion in model container [2024-11-10 08:55:20,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:19" (2/3) ... [2024-11-10 08:55:20,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38215380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:55:20, skipping insertion in model container [2024-11-10 08:55:20,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:55:20" (3/3) ... [2024-11-10 08:55:20,527 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-59.i [2024-11-10 08:55:20,540 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 08:55:20,540 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 08:55:20,584 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 08:55:20,589 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;@3f211ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 08:55:20,589 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 08:55:20,592 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 40 states have (on average 1.375) internal successors, (55), 41 states have internal predecessors, (55), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 08:55:20,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-10 08:55:20,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:55:20,600 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:55:20,600 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:55:20,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:55:20,604 INFO L85 PathProgramCache]: Analyzing trace with hash 743751383, now seen corresponding path program 1 times [2024-11-10 08:55:20,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:55:20,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246849541] [2024-11-10 08:55:20,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:55:20,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:55:20,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:20,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:55:20,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:20,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:55:20,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:20,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 08:55:20,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:20,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:55:20,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:20,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 08:55:20,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:20,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:55:20,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:20,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 08:55:20,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:20,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:55:20,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:20,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:55:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:20,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 08:55:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:20,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 08:55:20,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:20,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 08:55:20,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:20,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 08:55:20,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:20,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 08:55:20,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:20,934 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 08:55:20,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:55:20,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246849541] [2024-11-10 08:55:20,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246849541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:55:20,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:55:20,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 08:55:20,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463898311] [2024-11-10 08:55:20,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:55:20,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 08:55:20,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:55:20,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 08:55:20,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:55:20,988 INFO L87 Difference]: Start difference. First operand has 57 states, 40 states have (on average 1.375) internal successors, (55), 41 states have internal predecessors, (55), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 08:55:21,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:55:21,013 INFO L93 Difference]: Finished difference Result 106 states and 173 transitions. [2024-11-10 08:55:21,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 08:55:21,016 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 97 [2024-11-10 08:55:21,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:55:21,023 INFO L225 Difference]: With dead ends: 106 [2024-11-10 08:55:21,039 INFO L226 Difference]: Without dead ends: 52 [2024-11-10 08:55:21,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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-10 08:55:21,049 INFO L432 NwaCegarLoop]: 75 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, 75 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-10 08:55:21,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:55:21,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-10 08:55:21,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-10 08:55:21,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 08:55:21,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2024-11-10 08:55:21,079 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 75 transitions. Word has length 97 [2024-11-10 08:55:21,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:55:21,080 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 75 transitions. [2024-11-10 08:55:21,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 08:55:21,080 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 75 transitions. [2024-11-10 08:55:21,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-10 08:55:21,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:55:21,083 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:55:21,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 08:55:21,083 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:55:21,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:55:21,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1859539963, now seen corresponding path program 1 times [2024-11-10 08:55:21,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:55:21,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783902861] [2024-11-10 08:55:21,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:55:21,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:55:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:21,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:55:21,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:21,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:55:21,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:21,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 08:55:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:21,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:55:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:21,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 08:55:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:21,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:55:21,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:21,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 08:55:21,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:21,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:55:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:21,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:55:21,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:21,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 08:55:21,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:21,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 08:55:21,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:21,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 08:55:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:21,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 08:55:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:21,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 08:55:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:21,483 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 08:55:21,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:55:21,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783902861] [2024-11-10 08:55:21,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783902861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:55:21,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:55:21,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 08:55:21,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670898225] [2024-11-10 08:55:21,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:55:21,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 08:55:21,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:55:21,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 08:55:21,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 08:55:21,487 INFO L87 Difference]: Start difference. First operand 52 states and 75 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 08:55:21,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:55:21,598 INFO L93 Difference]: Finished difference Result 152 states and 221 transitions. [2024-11-10 08:55:21,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 08:55:21,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 97 [2024-11-10 08:55:21,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:55:21,601 INFO L225 Difference]: With dead ends: 152 [2024-11-10 08:55:21,601 INFO L226 Difference]: Without dead ends: 103 [2024-11-10 08:55:21,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 08:55:21,603 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 54 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:55:21,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 209 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 08:55:21,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-10 08:55:21,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 82. [2024-11-10 08:55:21,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 51 states have internal predecessors, (62), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 08:55:21,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 118 transitions. [2024-11-10 08:55:21,633 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 118 transitions. Word has length 97 [2024-11-10 08:55:21,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:55:21,636 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 118 transitions. [2024-11-10 08:55:21,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 08:55:21,636 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 118 transitions. [2024-11-10 08:55:21,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 08:55:21,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:55:21,638 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:55:21,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 08:55:21,638 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:55:21,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:55:21,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1659627081, now seen corresponding path program 1 times [2024-11-10 08:55:21,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:55:21,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504420932] [2024-11-10 08:55:21,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:55:21,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:55:21,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:22,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:55:22,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:22,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:55:22,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:22,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 08:55:22,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:22,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:55:22,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:22,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 08:55:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:22,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:55:22,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:22,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 08:55:22,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:22,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:55:22,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:22,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:55:22,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:22,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 08:55:22,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:22,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 08:55:22,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:22,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 08:55:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:22,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 08:55:22,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:22,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 08:55:22,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:22,347 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 08:55:22,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:55:22,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504420932] [2024-11-10 08:55:22,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504420932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:55:22,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:55:22,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 08:55:22,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971047611] [2024-11-10 08:55:22,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:55:22,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 08:55:22,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:55:22,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 08:55:22,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 08:55:22,353 INFO L87 Difference]: Start difference. First operand 82 states and 118 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 08:55:22,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:55:22,625 INFO L93 Difference]: Finished difference Result 192 states and 276 transitions. [2024-11-10 08:55:22,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 08:55:22,627 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 98 [2024-11-10 08:55:22,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:55:22,629 INFO L225 Difference]: With dead ends: 192 [2024-11-10 08:55:22,631 INFO L226 Difference]: Without dead ends: 143 [2024-11-10 08:55:22,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-10 08:55:22,633 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 127 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 08:55:22,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 368 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 08:55:22,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-10 08:55:22,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 128. [2024-11-10 08:55:22,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 82 states have internal predecessors, (102), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-10 08:55:22,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 186 transitions. [2024-11-10 08:55:22,657 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 186 transitions. Word has length 98 [2024-11-10 08:55:22,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:55:22,657 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 186 transitions. [2024-11-10 08:55:22,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 08:55:22,658 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 186 transitions. [2024-11-10 08:55:22,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-10 08:55:22,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:55:22,659 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:55:22,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 08:55:22,660 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:55:22,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:55:22,660 INFO L85 PathProgramCache]: Analyzing trace with hash -165108322, now seen corresponding path program 1 times [2024-11-10 08:55:22,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:55:22,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187156633] [2024-11-10 08:55:22,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:55:22,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:55:22,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:23,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:55:23,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:23,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:55:23,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:23,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 08:55:23,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:23,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:55:23,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:23,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 08:55:23,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:23,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:55:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:23,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 08:55:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:23,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:55:23,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:23,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:55:23,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:23,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 08:55:23,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:23,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 08:55:23,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:23,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 08:55:23,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:23,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 08:55:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:23,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 08:55:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:23,098 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 36 proven. 3 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-10 08:55:23,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:55:23,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187156633] [2024-11-10 08:55:23,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187156633] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 08:55:23,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143868965] [2024-11-10 08:55:23,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:55:23,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:55:23,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:55:23,104 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-10 08:55:23,115 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-10 08:55:23,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:23,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 08:55:23,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:55:23,306 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-10 08:55:23,307 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 08:55:23,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143868965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:55:23,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 08:55:23,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 10 [2024-11-10 08:55:23,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543899600] [2024-11-10 08:55:23,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:55:23,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 08:55:23,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:55:23,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 08:55:23,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-10 08:55:23,309 INFO L87 Difference]: Start difference. First operand 128 states and 186 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 08:55:23,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:55:23,603 INFO L93 Difference]: Finished difference Result 368 states and 506 transitions. [2024-11-10 08:55:23,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-10 08:55:23,604 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 99 [2024-11-10 08:55:23,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:55:23,606 INFO L225 Difference]: With dead ends: 368 [2024-11-10 08:55:23,606 INFO L226 Difference]: Without dead ends: 273 [2024-11-10 08:55:23,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2024-11-10 08:55:23,607 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 216 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 08:55:23,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 172 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 08:55:23,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-11-10 08:55:23,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 166. [2024-11-10 08:55:23,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 114 states have (on average 1.219298245614035) internal successors, (139), 114 states have internal predecessors, (139), 42 states have call successors, (42), 9 states have call predecessors, (42), 9 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-10 08:55:23,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 223 transitions. [2024-11-10 08:55:23,630 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 223 transitions. Word has length 99 [2024-11-10 08:55:23,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:55:23,631 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 223 transitions. [2024-11-10 08:55:23,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 08:55:23,631 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 223 transitions. [2024-11-10 08:55:23,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-10 08:55:23,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:55:23,632 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:55:23,647 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-10 08:55:23,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:55:23,834 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:55:23,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:55:23,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1577702013, now seen corresponding path program 1 times [2024-11-10 08:55:23,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:55:23,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575613497] [2024-11-10 08:55:23,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:55:23,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:55:23,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 08:55:23,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1532555133] [2024-11-10 08:55:23,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:55:23,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:55:23,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:55:23,894 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 08:55:23,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 08:55:24,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:24,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-10 08:55:24,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:55:24,799 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 133 proven. 81 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-11-10 08:55:24,799 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 08:55:31,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:55:31,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575613497] [2024-11-10 08:55:31,887 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 08:55:31,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532555133] [2024-11-10 08:55:31,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532555133] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 08:55:31,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-10 08:55:31,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2024-11-10 08:55:31,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111947309] [2024-11-10 08:55:31,890 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-10 08:55:31,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 08:55:31,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:55:31,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 08:55:31,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2024-11-10 08:55:31,892 INFO L87 Difference]: Start difference. First operand 166 states and 223 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (14), 4 states have call predecessors, (14), 5 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-10 08:55:32,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:55:32,563 INFO L93 Difference]: Finished difference Result 326 states and 422 transitions. [2024-11-10 08:55:32,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-10 08:55:32,567 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (14), 4 states have call predecessors, (14), 5 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 99 [2024-11-10 08:55:32,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:55:32,569 INFO L225 Difference]: With dead ends: 326 [2024-11-10 08:55:32,569 INFO L226 Difference]: Without dead ends: 201 [2024-11-10 08:55:32,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=176, Invalid=424, Unknown=0, NotChecked=0, Total=600 [2024-11-10 08:55:32,571 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 61 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 08:55:32,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 393 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 08:55:32,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-10 08:55:32,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 190. [2024-11-10 08:55:32,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 132 states have (on average 1.1818181818181819) internal successors, (156), 132 states have internal predecessors, (156), 42 states have call successors, (42), 15 states have call predecessors, (42), 15 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-10 08:55:32,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 240 transitions. [2024-11-10 08:55:32,624 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 240 transitions. Word has length 99 [2024-11-10 08:55:32,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:55:32,625 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 240 transitions. [2024-11-10 08:55:32,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (14), 4 states have call predecessors, (14), 5 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-10 08:55:32,625 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 240 transitions. [2024-11-10 08:55:32,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-10 08:55:32,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:55:32,626 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:55:32,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 08:55:32,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:55:32,827 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:55:32,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:55:32,828 INFO L85 PathProgramCache]: Analyzing trace with hash 128294685, now seen corresponding path program 1 times [2024-11-10 08:55:32,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:55:32,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624417865] [2024-11-10 08:55:32,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:55:32,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:55:32,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 08:55:32,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [137083696] [2024-11-10 08:55:32,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:55:32,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:55:32,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:55:32,949 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 08:55:32,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 08:55:33,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:33,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-10 08:55:33,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:55:34,628 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 169 proven. 105 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-10 08:55:34,628 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 08:55:40,885 WARN L286 SmtUtils]: Spent 5.28s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 08:55:47,502 WARN L286 SmtUtils]: Spent 5.53s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-10 08:56:12,574 WARN L286 SmtUtils]: Spent 7.56s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-10 08:56:30,616 WARN L286 SmtUtils]: Spent 12.08s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 08:56:38,186 WARN L286 SmtUtils]: Spent 5.46s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)