./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-56.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-56.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 9db1cd65bc75e5074bada94c2cde698267c3661942827a0dbfb399cf3fcd8571 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 10:36:55,184 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 10:36:55,252 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 10:36:55,258 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 10:36:55,261 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 10:36:55,288 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 10:36:55,289 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 10:36:55,290 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 10:36:55,290 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 10:36:55,290 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 10:36:55,291 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 10:36:55,291 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 10:36:55,292 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 10:36:55,292 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 10:36:55,292 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 10:36:55,293 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 10:36:55,293 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 10:36:55,293 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 10:36:55,294 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 10:36:55,294 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 10:36:55,294 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 10:36:55,295 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 10:36:55,295 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 10:36:55,298 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 10:36:55,298 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 10:36:55,299 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 10:36:55,299 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 10:36:55,299 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 10:36:55,299 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 10:36:55,300 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 10:36:55,300 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 10:36:55,300 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 10:36:55,300 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:36:55,300 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 10:36:55,301 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 10:36:55,301 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 10:36:55,301 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 10:36:55,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 10:36:55,301 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 10:36:55,302 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 10:36:55,302 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 10:36:55,303 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 10:36:55,303 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 -> 9db1cd65bc75e5074bada94c2cde698267c3661942827a0dbfb399cf3fcd8571 [2024-10-24 10:36:55,566 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 10:36:55,589 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 10:36:55,593 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 10:36:55,594 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 10:36:55,594 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 10:36:55,595 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-56.i [2024-10-24 10:36:57,047 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 10:36:57,249 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 10:36:57,249 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-56.i [2024-10-24 10:36:57,259 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c15d027cd/b660bc14c5994c178814363110436d71/FLAGddfb93417 [2024-10-24 10:36:57,272 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c15d027cd/b660bc14c5994c178814363110436d71 [2024-10-24 10:36:57,275 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 10:36:57,276 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 10:36:57,277 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 10:36:57,277 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 10:36:57,282 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 10:36:57,283 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:36:57" (1/1) ... [2024-10-24 10:36:57,284 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7144afe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:36:57, skipping insertion in model container [2024-10-24 10:36:57,284 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:36:57" (1/1) ... [2024-10-24 10:36:57,311 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 10:36:57,507 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-56.i[915,928] [2024-10-24 10:36:57,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:36:57,565 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 10:36:57,577 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-56.i[915,928] [2024-10-24 10:36:57,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:36:57,630 INFO L204 MainTranslator]: Completed translation [2024-10-24 10:36:57,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:36:57 WrapperNode [2024-10-24 10:36:57,631 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 10:36:57,632 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 10:36:57,632 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 10:36:57,632 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 10:36:57,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:36:57" (1/1) ... [2024-10-24 10:36:57,678 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:36:57" (1/1) ... [2024-10-24 10:36:57,738 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 101 [2024-10-24 10:36:57,741 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 10:36:57,742 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 10:36:57,742 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 10:36:57,742 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 10:36:57,753 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:36:57" (1/1) ... [2024-10-24 10:36:57,754 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:36:57" (1/1) ... [2024-10-24 10:36:57,756 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:36:57" (1/1) ... [2024-10-24 10:36:57,773 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 10:36:57,774 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:36:57" (1/1) ... [2024-10-24 10:36:57,774 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:36:57" (1/1) ... [2024-10-24 10:36:57,779 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:36:57" (1/1) ... [2024-10-24 10:36:57,782 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:36:57" (1/1) ... [2024-10-24 10:36:57,785 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:36:57" (1/1) ... [2024-10-24 10:36:57,787 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:36:57" (1/1) ... [2024-10-24 10:36:57,790 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 10:36:57,791 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 10:36:57,791 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 10:36:57,791 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 10:36:57,792 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:36:57" (1/1) ... [2024-10-24 10:36:57,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:36:57,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:36:57,834 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 10:36:57,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 10:36:57,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 10:36:57,885 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 10:36:57,885 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 10:36:57,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 10:36:57,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 10:36:57,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 10:36:57,966 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 10:36:57,970 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 10:36:58,242 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-24 10:36:58,242 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 10:36:58,285 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 10:36:58,285 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 10:36:58,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:36:58 BoogieIcfgContainer [2024-10-24 10:36:58,286 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 10:36:58,288 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 10:36:58,288 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 10:36:58,293 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 10:36:58,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:36:57" (1/3) ... [2024-10-24 10:36:58,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7050feeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:36:58, skipping insertion in model container [2024-10-24 10:36:58,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:36:57" (2/3) ... [2024-10-24 10:36:58,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7050feeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:36:58, skipping insertion in model container [2024-10-24 10:36:58,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:36:58" (3/3) ... [2024-10-24 10:36:58,297 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-56.i [2024-10-24 10:36:58,313 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 10:36:58,313 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 10:36:58,377 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 10:36:58,383 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;@514b32d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 10:36:58,383 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 10:36:58,387 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 28 states have internal predecessors, (39), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-24 10:36:58,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-24 10:36:58,396 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:36:58,396 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:36:58,397 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:36:58,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:36:58,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1733609520, now seen corresponding path program 1 times [2024-10-24 10:36:58,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:36:58,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046060079] [2024-10-24 10:36:58,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:36:58,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:36:58,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:36:58,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:36:58,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:36:58,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:36:58,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:36:58,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:36:58,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:36:58,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:36:58,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:36:58,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:36:58,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:36:58,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:36:58,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:36:58,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:36:58,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:36:58,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:36:58,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:36:58,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:36:58,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:36:58,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:36:58,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:36:58,759 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-24 10:36:58,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:36:58,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046060079] [2024-10-24 10:36:58,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046060079] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:36:58,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:36:58,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 10:36:58,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168235844] [2024-10-24 10:36:58,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:36:58,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 10:36:58,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:36:58,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 10:36:58,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:36:58,803 INFO L87 Difference]: Start difference. First operand has 40 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 28 states have internal predecessors, (39), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 10:36:58,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:36:58,856 INFO L93 Difference]: Finished difference Result 77 states and 126 transitions. [2024-10-24 10:36:58,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 10:36:58,859 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 68 [2024-10-24 10:36:58,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:36:58,865 INFO L225 Difference]: With dead ends: 77 [2024-10-24 10:36:58,866 INFO L226 Difference]: Without dead ends: 38 [2024-10-24 10:36:58,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:36:58,874 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:36:58,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:36:58,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-24 10:36:58,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-24 10:36:58,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-24 10:36:58,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 54 transitions. [2024-10-24 10:36:58,917 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 54 transitions. Word has length 68 [2024-10-24 10:36:58,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:36:58,918 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 54 transitions. [2024-10-24 10:36:58,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 10:36:58,919 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 54 transitions. [2024-10-24 10:36:58,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-24 10:36:58,922 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:36:58,922 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:36:58,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 10:36:58,923 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:36:58,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:36:58,924 INFO L85 PathProgramCache]: Analyzing trace with hash -98182800, now seen corresponding path program 1 times [2024-10-24 10:36:58,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:36:58,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374189117] [2024-10-24 10:36:58,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:36:58,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:36:59,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:36:59,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:36:59,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:36:59,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:36:59,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:36:59,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:36:59,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:36:59,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:36:59,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:36:59,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:36:59,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:36:59,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:36:59,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:36:59,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:36:59,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:36:59,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:36:59,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:36:59,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:36:59,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:36:59,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:36:59,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:36:59,591 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-24 10:36:59,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:36:59,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374189117] [2024-10-24 10:36:59,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374189117] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:36:59,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:36:59,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 10:36:59,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712141410] [2024-10-24 10:36:59,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:36:59,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 10:36:59,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:36:59,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 10:36:59,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 10:36:59,597 INFO L87 Difference]: Start difference. First operand 38 states and 54 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 10:36:59,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:36:59,766 INFO L93 Difference]: Finished difference Result 111 states and 159 transitions. [2024-10-24 10:36:59,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 10:36:59,767 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 68 [2024-10-24 10:36:59,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:36:59,769 INFO L225 Difference]: With dead ends: 111 [2024-10-24 10:36:59,769 INFO L226 Difference]: Without dead ends: 74 [2024-10-24 10:36:59,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 10:36:59,772 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 31 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:36:59,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 152 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:36:59,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-24 10:36:59,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 68. [2024-10-24 10:36:59,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 45 states have internal predecessors, (57), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 10:36:59,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 97 transitions. [2024-10-24 10:36:59,793 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 97 transitions. Word has length 68 [2024-10-24 10:36:59,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:36:59,795 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 97 transitions. [2024-10-24 10:36:59,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 10:36:59,795 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 97 transitions. [2024-10-24 10:36:59,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-24 10:36:59,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:36:59,797 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:36:59,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 10:36:59,797 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:36:59,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:36:59,798 INFO L85 PathProgramCache]: Analyzing trace with hash -491209810, now seen corresponding path program 1 times [2024-10-24 10:36:59,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:36:59,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504710496] [2024-10-24 10:36:59,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:36:59,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:36:59,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:01,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:37:01,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:01,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:37:01,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:01,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:37:01,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:01,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:37:01,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:01,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:37:01,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:01,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:37:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:01,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:37:01,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:01,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:37:01,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:01,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:37:02,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:02,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:37:02,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:02,006 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-24 10:37:02,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:37:02,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504710496] [2024-10-24 10:37:02,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504710496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:37:02,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:37:02,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 10:37:02,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246763228] [2024-10-24 10:37:02,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:37:02,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 10:37:02,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:37:02,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 10:37:02,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 10:37:02,011 INFO L87 Difference]: Start difference. First operand 68 states and 97 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 10:37:03,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:37:03,096 INFO L93 Difference]: Finished difference Result 101 states and 141 transitions. [2024-10-24 10:37:03,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 10:37:03,097 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 68 [2024-10-24 10:37:03,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:37:03,098 INFO L225 Difference]: With dead ends: 101 [2024-10-24 10:37:03,098 INFO L226 Difference]: Without dead ends: 99 [2024-10-24 10:37:03,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-24 10:37:03,100 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 36 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 10:37:03,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 205 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 10:37:03,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-24 10:37:03,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 84. [2024-10-24 10:37:03,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 61 states have internal predecessors, (80), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 10:37:03,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 120 transitions. [2024-10-24 10:37:03,112 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 120 transitions. Word has length 68 [2024-10-24 10:37:03,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:37:03,112 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 120 transitions. [2024-10-24 10:37:03,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 10:37:03,113 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 120 transitions. [2024-10-24 10:37:03,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-24 10:37:03,114 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:37:03,114 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:37:03,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 10:37:03,115 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:37:03,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:37:03,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1316926523, now seen corresponding path program 1 times [2024-10-24 10:37:03,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:37:03,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398436104] [2024-10-24 10:37:03,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:37:03,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:37:03,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:04,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:37:04,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:04,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:37:04,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:04,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:37:04,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:04,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:37:04,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:04,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:37:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:04,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:37:04,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:04,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:37:04,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:04,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:37:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:04,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:37:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:04,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:37:04,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:04,741 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-24 10:37:04,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:37:04,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398436104] [2024-10-24 10:37:04,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398436104] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:37:04,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:37:04,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 10:37:04,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037264670] [2024-10-24 10:37:04,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:37:04,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 10:37:04,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:37:04,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 10:37:04,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-24 10:37:04,747 INFO L87 Difference]: Start difference. First operand 84 states and 120 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 10:37:05,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:37:05,713 INFO L93 Difference]: Finished difference Result 114 states and 159 transitions. [2024-10-24 10:37:05,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 10:37:05,714 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 69 [2024-10-24 10:37:05,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:37:05,718 INFO L225 Difference]: With dead ends: 114 [2024-10-24 10:37:05,719 INFO L226 Difference]: Without dead ends: 112 [2024-10-24 10:37:05,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-24 10:37:05,724 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 25 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 10:37:05,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 210 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 10:37:05,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-24 10:37:05,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 85. [2024-10-24 10:37:05,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 62 states have internal predecessors, (82), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 10:37:05,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 122 transitions. [2024-10-24 10:37:05,743 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 122 transitions. Word has length 69 [2024-10-24 10:37:05,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:37:05,744 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 122 transitions. [2024-10-24 10:37:05,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 10:37:05,744 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 122 transitions. [2024-10-24 10:37:05,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-24 10:37:05,747 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:37:05,747 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:37:05,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 10:37:05,748 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:37:05,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:37:05,748 INFO L85 PathProgramCache]: Analyzing trace with hash -2126273149, now seen corresponding path program 1 times [2024-10-24 10:37:05,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:37:05,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466449879] [2024-10-24 10:37:05,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:37:05,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:37:05,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:08,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:37:08,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:08,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:37:08,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:08,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:37:08,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:08,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:37:08,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:08,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:37:08,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:08,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:37:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:08,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:37:08,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:08,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:37:08,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:08,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:37:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:08,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:37:08,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:08,086 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-24 10:37:08,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:37:08,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466449879] [2024-10-24 10:37:08,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466449879] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:37:08,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:37:08,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 10:37:08,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124329525] [2024-10-24 10:37:08,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:37:08,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 10:37:08,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:37:08,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 10:37:08,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 10:37:08,091 INFO L87 Difference]: Start difference. First operand 85 states and 122 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 10:37:08,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:37:08,770 INFO L93 Difference]: Finished difference Result 112 states and 157 transitions. [2024-10-24 10:37:08,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 10:37:08,771 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 69 [2024-10-24 10:37:08,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:37:08,772 INFO L225 Difference]: With dead ends: 112 [2024-10-24 10:37:08,772 INFO L226 Difference]: Without dead ends: 110 [2024-10-24 10:37:08,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-24 10:37:08,774 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 29 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 10:37:08,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 180 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 10:37:08,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-24 10:37:08,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 80. [2024-10-24 10:37:08,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 57 states have internal predecessors, (75), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 10:37:08,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 115 transitions. [2024-10-24 10:37:08,783 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 115 transitions. Word has length 69 [2024-10-24 10:37:08,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:37:08,783 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 115 transitions. [2024-10-24 10:37:08,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 10:37:08,784 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 115 transitions. [2024-10-24 10:37:08,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-24 10:37:08,786 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:37:08,786 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:37:08,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 10:37:08,786 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:37:08,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:37:08,787 INFO L85 PathProgramCache]: Analyzing trace with hash 289329637, now seen corresponding path program 1 times [2024-10-24 10:37:08,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:37:08,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253059116] [2024-10-24 10:37:08,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:37:08,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:37:08,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:12,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:37:12,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:12,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:37:12,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:12,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:37:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:12,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:37:12,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:12,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:37:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:12,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:37:12,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:12,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:37:12,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:12,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:37:12,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:12,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:37:12,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:12,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:37:12,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:12,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 10:37:12,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:12,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 10:37:12,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:12,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 10:37:12,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:12,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 10:37:12,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:12,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 10:37:12,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:12,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 10:37:12,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:12,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 10:37:12,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:12,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 10:37:12,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:12,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 10:37:12,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:12,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 10:37:12,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:12,269 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 777 trivial. 0 not checked. [2024-10-24 10:37:12,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:37:12,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253059116] [2024-10-24 10:37:12,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253059116] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:37:12,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:37:12,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 10:37:12,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253571934] [2024-10-24 10:37:12,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:37:12,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 10:37:12,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:37:12,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 10:37:12,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-24 10:37:12,272 INFO L87 Difference]: Start difference. First operand 80 states and 115 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 10:37:13,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:37:13,427 INFO L93 Difference]: Finished difference Result 111 states and 154 transitions. [2024-10-24 10:37:13,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 10:37:13,427 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 135 [2024-10-24 10:37:13,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:37:13,429 INFO L225 Difference]: With dead ends: 111 [2024-10-24 10:37:13,429 INFO L226 Difference]: Without dead ends: 109 [2024-10-24 10:37:13,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-24 10:37:13,430 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 43 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 10:37:13,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 212 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 10:37:13,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-24 10:37:13,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 87. [2024-10-24 10:37:13,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 64 states have (on average 1.34375) internal successors, (86), 64 states have internal predecessors, (86), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 10:37:13,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 126 transitions. [2024-10-24 10:37:13,440 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 126 transitions. Word has length 135 [2024-10-24 10:37:13,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:37:13,441 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 126 transitions. [2024-10-24 10:37:13,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 10:37:13,441 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 126 transitions. [2024-10-24 10:37:13,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-24 10:37:13,443 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:37:13,443 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:37:13,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 10:37:13,443 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:37:13,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:37:13,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1404959854, now seen corresponding path program 1 times [2024-10-24 10:37:13,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:37:13,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716932337] [2024-10-24 10:37:13,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:37:13,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:37:13,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:14,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:37:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:14,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:37:14,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:14,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:37:14,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:14,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:37:14,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:14,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:37:14,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:14,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:37:14,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:14,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:37:14,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:14,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:37:14,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:14,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:37:14,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:14,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:37:14,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:14,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 10:37:14,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:14,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 10:37:14,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:14,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 10:37:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:14,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 10:37:14,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:14,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 10:37:14,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:14,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 10:37:14,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:14,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 10:37:14,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:14,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 10:37:14,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:14,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 10:37:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:14,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 10:37:14,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:14,894 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 777 trivial. 0 not checked. [2024-10-24 10:37:14,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:37:14,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716932337] [2024-10-24 10:37:14,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716932337] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:37:14,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:37:14,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 10:37:14,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790455819] [2024-10-24 10:37:14,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:37:14,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 10:37:14,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:37:14,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 10:37:14,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 10:37:14,896 INFO L87 Difference]: Start difference. First operand 87 states and 126 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 10:37:15,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:37:15,626 INFO L93 Difference]: Finished difference Result 118 states and 164 transitions. [2024-10-24 10:37:15,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 10:37:15,626 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 136 [2024-10-24 10:37:15,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:37:15,628 INFO L225 Difference]: With dead ends: 118 [2024-10-24 10:37:15,628 INFO L226 Difference]: Without dead ends: 116 [2024-10-24 10:37:15,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-24 10:37:15,629 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 41 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 10:37:15,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 242 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 10:37:15,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-24 10:37:15,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 88. [2024-10-24 10:37:15,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 65 states have (on average 1.353846153846154) internal successors, (88), 65 states have internal predecessors, (88), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 10:37:15,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 128 transitions. [2024-10-24 10:37:15,649 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 128 transitions. Word has length 136 [2024-10-24 10:37:15,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:37:15,649 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 128 transitions. [2024-10-24 10:37:15,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 10:37:15,649 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 128 transitions. [2024-10-24 10:37:15,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-24 10:37:15,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:37:15,651 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:37:15,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 10:37:15,655 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:37:15,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:37:15,656 INFO L85 PathProgramCache]: Analyzing trace with hash 595613228, now seen corresponding path program 1 times [2024-10-24 10:37:15,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:37:15,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095596785] [2024-10-24 10:37:15,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:37:15,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:37:15,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:19,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:37:19,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:19,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:37:19,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:19,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:37:19,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:19,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:37:19,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:19,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:37:19,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:19,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:37:19,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:19,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:37:19,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:19,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:37:19,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:19,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:37:19,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:19,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:37:19,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:19,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 10:37:19,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:19,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 10:37:19,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:19,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 10:37:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:19,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 10:37:19,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:19,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 10:37:19,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:19,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 10:37:19,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:19,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 10:37:19,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:19,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 10:37:19,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:19,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 10:37:19,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:19,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 10:37:19,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:19,122 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 777 trivial. 0 not checked. [2024-10-24 10:37:19,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:37:19,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095596785] [2024-10-24 10:37:19,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095596785] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:37:19,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:37:19,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 10:37:19,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844114686] [2024-10-24 10:37:19,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:37:19,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 10:37:19,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:37:19,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 10:37:19,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 10:37:19,126 INFO L87 Difference]: Start difference. First operand 88 states and 128 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 10:37:20,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:37:20,477 INFO L93 Difference]: Finished difference Result 120 states and 166 transitions. [2024-10-24 10:37:20,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 10:37:20,478 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 136 [2024-10-24 10:37:20,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:37:20,480 INFO L225 Difference]: With dead ends: 120 [2024-10-24 10:37:20,480 INFO L226 Difference]: Without dead ends: 118 [2024-10-24 10:37:20,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-24 10:37:20,481 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 28 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 10:37:20,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 244 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 10:37:20,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-24 10:37:20,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 88. [2024-10-24 10:37:20,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 65 states have (on average 1.353846153846154) internal successors, (88), 65 states have internal predecessors, (88), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 10:37:20,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 128 transitions. [2024-10-24 10:37:20,489 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 128 transitions. Word has length 136 [2024-10-24 10:37:20,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:37:20,490 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 128 transitions. [2024-10-24 10:37:20,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 10:37:20,490 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 128 transitions. [2024-10-24 10:37:20,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-24 10:37:20,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:37:20,492 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:37:20,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 10:37:20,492 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:37:20,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:37:20,493 INFO L85 PathProgramCache]: Analyzing trace with hash 379567674, now seen corresponding path program 1 times [2024-10-24 10:37:20,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:37:20,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591084779] [2024-10-24 10:37:20,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:37:20,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:37:20,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:37:20,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:37:20,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:37:20,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:37:20,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:37:20,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:37:20,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:37:20,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:37:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:37:20,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:37:20,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 10:37:20,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 10:37:20,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 10:37:20,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 10:37:20,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 10:37:20,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 10:37:20,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 10:37:20,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 10:37:20,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 10:37:20,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 10:37:20,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,599 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 777 trivial. 0 not checked. [2024-10-24 10:37:20,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:37:20,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591084779] [2024-10-24 10:37:20,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591084779] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:37:20,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:37:20,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 10:37:20,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224456127] [2024-10-24 10:37:20,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:37:20,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 10:37:20,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:37:20,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 10:37:20,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 10:37:20,603 INFO L87 Difference]: Start difference. First operand 88 states and 128 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 10:37:20,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:37:20,633 INFO L93 Difference]: Finished difference Result 158 states and 230 transitions. [2024-10-24 10:37:20,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 10:37:20,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 136 [2024-10-24 10:37:20,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:37:20,635 INFO L225 Difference]: With dead ends: 158 [2024-10-24 10:37:20,635 INFO L226 Difference]: Without dead ends: 101 [2024-10-24 10:37:20,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 10:37:20,637 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 13 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:37:20,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 89 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:37:20,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-24 10:37:20,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 79. [2024-10-24 10:37:20,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 56 states have internal predecessors, (74), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 10:37:20,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 114 transitions. [2024-10-24 10:37:20,643 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 114 transitions. Word has length 136 [2024-10-24 10:37:20,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:37:20,644 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 114 transitions. [2024-10-24 10:37:20,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 10:37:20,644 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 114 transitions. [2024-10-24 10:37:20,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-24 10:37:20,646 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:37:20,646 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:37:20,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 10:37:20,646 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:37:20,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:37:20,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1905536322, now seen corresponding path program 1 times [2024-10-24 10:37:20,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:37:20,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429618974] [2024-10-24 10:37:20,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:37:20,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:37:20,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:37:20,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:37:20,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:37:20,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:37:20,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:37:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:37:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:37:20,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:37:20,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:37:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:37:20,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 10:37:20,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 10:37:20,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 10:37:20,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 10:37:20,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 10:37:20,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 10:37:20,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 10:37:20,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 10:37:20,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 10:37:20,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 10:37:20,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,751 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 777 trivial. 0 not checked. [2024-10-24 10:37:20,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:37:20,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429618974] [2024-10-24 10:37:20,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429618974] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:37:20,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:37:20,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 10:37:20,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308141809] [2024-10-24 10:37:20,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:37:20,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 10:37:20,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:37:20,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 10:37:20,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 10:37:20,754 INFO L87 Difference]: Start difference. First operand 79 states and 114 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 10:37:20,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:37:20,781 INFO L93 Difference]: Finished difference Result 137 states and 198 transitions. [2024-10-24 10:37:20,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 10:37:20,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 136 [2024-10-24 10:37:20,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:37:20,782 INFO L225 Difference]: With dead ends: 137 [2024-10-24 10:37:20,782 INFO L226 Difference]: Without dead ends: 81 [2024-10-24 10:37:20,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 10:37:20,783 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 14 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:37:20,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 100 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:37:20,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-24 10:37:20,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 71. [2024-10-24 10:37:20,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 10:37:20,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 100 transitions. [2024-10-24 10:37:20,793 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 100 transitions. Word has length 136 [2024-10-24 10:37:20,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:37:20,793 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 100 transitions. [2024-10-24 10:37:20,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 10:37:20,793 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 100 transitions. [2024-10-24 10:37:20,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-24 10:37:20,794 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:37:20,795 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:37:20,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 10:37:20,795 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:37:20,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:37:20,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1758697221, now seen corresponding path program 1 times [2024-10-24 10:37:20,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:37:20,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743849063] [2024-10-24 10:37:20,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:37:20,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:37:20,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:37:20,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:37:20,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:37:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:37:20,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:37:20,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:37:20,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:37:20,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:37:20,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:37:20,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:37:20,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 10:37:20,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 10:37:20,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 10:37:20,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 10:37:20,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 10:37:20,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 10:37:20,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 10:37:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 10:37:20,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 10:37:20,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 10:37:20,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:20,975 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 761 trivial. 0 not checked. [2024-10-24 10:37:20,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:37:20,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743849063] [2024-10-24 10:37:20,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743849063] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 10:37:20,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052528046] [2024-10-24 10:37:20,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:37:20,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 10:37:20,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:37:20,978 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 10:37:20,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 10:37:21,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:21,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 10:37:21,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:37:21,315 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 8 proven. 417 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2024-10-24 10:37:21,315 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 10:37:21,561 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 761 trivial. 0 not checked. [2024-10-24 10:37:21,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052528046] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 10:37:21,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 10:37:21,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 5] total 7 [2024-10-24 10:37:21,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281453526] [2024-10-24 10:37:21,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 10:37:21,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 10:37:21,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:37:21,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 10:37:21,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 10:37:21,564 INFO L87 Difference]: Start difference. First operand 71 states and 100 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 4 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) [2024-10-24 10:37:21,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:37:21,618 INFO L93 Difference]: Finished difference Result 161 states and 227 transitions. [2024-10-24 10:37:21,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 10:37:21,619 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 4 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) Word has length 137 [2024-10-24 10:37:21,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:37:21,620 INFO L225 Difference]: With dead ends: 161 [2024-10-24 10:37:21,620 INFO L226 Difference]: Without dead ends: 113 [2024-10-24 10:37:21,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 311 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-24 10:37:21,622 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 68 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:37:21,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 175 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:37:21,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-24 10:37:21,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 104. [2024-10-24 10:37:21,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 70 states have internal predecessors, (87), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 10:37:21,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 147 transitions. [2024-10-24 10:37:21,630 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 147 transitions. Word has length 137 [2024-10-24 10:37:21,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:37:21,631 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 147 transitions. [2024-10-24 10:37:21,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 4 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) [2024-10-24 10:37:21,631 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 147 transitions. [2024-10-24 10:37:21,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-24 10:37:21,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:37:21,633 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:37:21,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 10:37:21,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-24 10:37:21,834 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:37:21,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:37:21,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1474725700, now seen corresponding path program 1 times [2024-10-24 10:37:21,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:37:21,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833446934] [2024-10-24 10:37:21,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:37:21,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:37:21,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:22,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:37:22,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:22,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:37:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:22,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:37:22,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:22,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:37:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:22,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:37:22,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:22,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:37:22,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:22,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:37:22,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:22,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:37:22,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:22,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:37:22,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:22,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:37:22,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:22,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 10:37:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:22,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 10:37:22,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:22,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 10:37:22,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:22,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 10:37:22,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:22,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 10:37:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:22,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 10:37:22,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:22,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 10:37:22,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:22,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 10:37:22,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:22,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 10:37:22,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:22,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 10:37:22,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:22,374 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 47 proven. 81 refuted. 0 times theorem prover too weak. 658 trivial. 0 not checked. [2024-10-24 10:37:22,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:37:22,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833446934] [2024-10-24 10:37:22,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833446934] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 10:37:22,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637002161] [2024-10-24 10:37:22,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:37:22,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 10:37:22,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:37:22,377 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-10-24 10:37:22,378 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-10-24 10:37:22,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:37:22,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-24 10:37:22,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:37:23,058 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 542 proven. 24 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 10:37:23,060 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 10:37:23,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637002161] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 10:37:23,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 10:37:23,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15] total 18 [2024-10-24 10:37:23,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293442191] [2024-10-24 10:37:23,335 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 10:37:23,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-24 10:37:23,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:37:23,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-24 10:37:23,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2024-10-24 10:37:23,338 INFO L87 Difference]: Start difference. First operand 104 states and 147 transitions. Second operand has 18 states, 18 states have (on average 3.5) internal successors, (63), 17 states have internal predecessors, (63), 6 states have call successors, (37), 5 states have call predecessors, (37), 7 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2024-10-24 10:37:23,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:37:23,686 INFO L93 Difference]: Finished difference Result 172 states and 220 transitions. [2024-10-24 10:37:23,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-24 10:37:23,687 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.5) internal successors, (63), 17 states have internal predecessors, (63), 6 states have call successors, (37), 5 states have call predecessors, (37), 7 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) Word has length 138 [2024-10-24 10:37:23,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:37:23,687 INFO L225 Difference]: With dead ends: 172 [2024-10-24 10:37:23,687 INFO L226 Difference]: Without dead ends: 0 [2024-10-24 10:37:23,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2024-10-24 10:37:23,689 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 47 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 10:37:23,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 133 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 10:37:23,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-24 10:37:23,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-24 10:37:23,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 10:37:23,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-24 10:37:23,690 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 138 [2024-10-24 10:37:23,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:37:23,690 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 10:37:23,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.5) internal successors, (63), 17 states have internal predecessors, (63), 6 states have call successors, (37), 5 states have call predecessors, (37), 7 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2024-10-24 10:37:23,691 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-24 10:37:23,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-24 10:37:23,693 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 10:37:23,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 10:37:23,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-24 10:37:23,897 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:37:23,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-24 10:37:24,443 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 10:37:24,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:37:24 BoogieIcfgContainer [2024-10-24 10:37:24,469 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 10:37:24,469 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 10:37:24,469 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 10:37:24,470 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 10:37:24,470 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:36:58" (3/4) ... [2024-10-24 10:37:24,472 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 10:37:24,476 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-24 10:37:24,481 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-10-24 10:37:24,482 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-24 10:37:24,482 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-24 10:37:24,482 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-24 10:37:24,586 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 10:37:24,587 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 10:37:24,587 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 10:37:24,588 INFO L158 Benchmark]: Toolchain (without parser) took 27311.66ms. Allocated memory was 188.7MB in the beginning and 419.4MB in the end (delta: 230.7MB). Free memory was 120.3MB in the beginning and 341.2MB in the end (delta: -220.9MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. [2024-10-24 10:37:24,588 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 109.1MB. Free memory is still 70.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:37:24,588 INFO L158 Benchmark]: CACSL2BoogieTranslator took 354.03ms. Allocated memory is still 188.7MB. Free memory was 120.1MB in the beginning and 106.3MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 10:37:24,588 INFO L158 Benchmark]: Boogie Procedure Inliner took 109.19ms. Allocated memory is still 188.7MB. Free memory was 106.2MB in the beginning and 158.1MB in the end (delta: -52.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 10:37:24,588 INFO L158 Benchmark]: Boogie Preprocessor took 48.02ms. Allocated memory is still 188.7MB. Free memory was 158.1MB in the beginning and 153.2MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 10:37:24,589 INFO L158 Benchmark]: RCFGBuilder took 495.46ms. Allocated memory is still 188.7MB. Free memory was 153.2MB in the beginning and 133.0MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-24 10:37:24,590 INFO L158 Benchmark]: TraceAbstraction took 26180.80ms. Allocated memory was 188.7MB in the beginning and 419.4MB in the end (delta: 230.7MB). Free memory was 132.2MB in the beginning and 347.5MB in the end (delta: -215.2MB). Peak memory consumption was 226.7MB. Max. memory is 16.1GB. [2024-10-24 10:37:24,590 INFO L158 Benchmark]: Witness Printer took 117.93ms. Allocated memory is still 419.4MB. Free memory was 347.5MB in the beginning and 341.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 10:37:24,593 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.18ms. Allocated memory is still 109.1MB. Free memory is still 70.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 354.03ms. Allocated memory is still 188.7MB. Free memory was 120.1MB in the beginning and 106.3MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 109.19ms. Allocated memory is still 188.7MB. Free memory was 106.2MB in the beginning and 158.1MB in the end (delta: -52.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.02ms. Allocated memory is still 188.7MB. Free memory was 158.1MB in the beginning and 153.2MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 495.46ms. Allocated memory is still 188.7MB. Free memory was 153.2MB in the beginning and 133.0MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 26180.80ms. Allocated memory was 188.7MB in the beginning and 419.4MB in the end (delta: 230.7MB). Free memory was 132.2MB in the beginning and 347.5MB in the end (delta: -215.2MB). Peak memory consumption was 226.7MB. Max. memory is 16.1GB. * Witness Printer took 117.93ms. Allocated memory is still 419.4MB. Free memory was 347.5MB in the beginning and 341.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.5s, OverallIterations: 12, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 377 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 375 mSDsluCounter, 1993 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1426 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1674 IncrementalHoareTripleChecker+Invalid, 1734 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 567 mSDtfsCounter, 1674 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 995 GetRequests, 906 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=11, InterpolantAutomatonStates: 86, 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, 199 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 17.1s InterpolantComputationTime, 1571 NumberOfCodeBlocks, 1571 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1693 ConstructedInterpolants, 0 QuantifiedInterpolants, 7872 SizeOfPredicates, 6 NumberOfNonLiveVariables, 613 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 15 InterpolantComputations, 10 PerfectInterpolantSequences, 8205/8760 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: 85]: Loop Invariant Derived loop invariant: ((((((1073741823 <= var_1_10) && (var_1_11 == 0)) && (127 <= var_1_5)) && (last_1_var_1_11 == 0)) && (var_1_5 <= 254)) && (var_1_10 <= 2147483647)) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: ((var_1_11 == 0) && (last_1_var_1_11 == 0)) Ensures: ((((cond != 0) && (var_1_11 == 0)) && (last_1_var_1_11 == 0)) && ((((((((((((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_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (last_1_var_1_1 == \old(last_1_var_1_1))) && (last_1_var_1_11 == \old(last_1_var_1_11)))) RESULT: Ultimate proved your program to be correct! [2024-10-24 10:37:24,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE