./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_fillercode_fillercodesize_normal_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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_fillercode_fillercodesize_normal_file-34.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 5f70a8d930c5557b68c07ef577122d328ec387effee8f919b747045b88161608 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 07:51:18,213 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 07:51:18,271 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 07:51:18,277 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 07:51:18,279 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 07:51:18,300 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 07:51:18,301 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 07:51:18,301 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 07:51:18,302 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 07:51:18,305 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 07:51:18,305 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 07:51:18,305 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 07:51:18,306 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 07:51:18,306 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 07:51:18,306 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 07:51:18,306 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 07:51:18,307 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 07:51:18,307 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 07:51:18,307 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 07:51:18,307 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 07:51:18,309 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 07:51:18,309 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 07:51:18,310 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 07:51:18,310 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 07:51:18,310 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 07:51:18,310 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 07:51:18,310 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 07:51:18,311 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 07:51:18,311 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 07:51:18,311 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 07:51:18,311 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 07:51:18,311 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 07:51:18,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:51:18,312 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 07:51:18,312 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 07:51:18,312 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 07:51:18,312 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 07:51:18,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 07:51:18,313 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 07:51:18,313 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 07:51:18,313 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 07:51:18,314 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 07:51:18,315 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 -> 5f70a8d930c5557b68c07ef577122d328ec387effee8f919b747045b88161608 [2024-10-14 07:51:18,515 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 07:51:18,532 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 07:51:18,534 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 07:51:18,535 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 07:51:18,536 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 07:51:18,537 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-34.i [2024-10-14 07:51:19,819 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 07:51:20,024 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 07:51:20,025 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-34.i [2024-10-14 07:51:20,039 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6db3390ed/02232e11e5d14199ab0e604b6c381640/FLAGc79dc0dc8 [2024-10-14 07:51:20,053 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6db3390ed/02232e11e5d14199ab0e604b6c381640 [2024-10-14 07:51:20,056 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 07:51:20,058 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 07:51:20,060 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 07:51:20,060 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 07:51:20,064 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 07:51:20,065 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:51:20" (1/1) ... [2024-10-14 07:51:20,066 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@449bcfc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:51:20, skipping insertion in model container [2024-10-14 07:51:20,066 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:51:20" (1/1) ... [2024-10-14 07:51:20,091 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 07:51:20,217 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_fillercode_fillercodesize_normal_file-34.i[913,926] [2024-10-14 07:51:20,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:51:20,283 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 07:51:20,293 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_fillercode_fillercodesize_normal_file-34.i[913,926] [2024-10-14 07:51:20,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:51:20,366 INFO L204 MainTranslator]: Completed translation [2024-10-14 07:51:20,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:51:20 WrapperNode [2024-10-14 07:51:20,366 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 07:51:20,367 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 07:51:20,368 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 07:51:20,368 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 07:51:20,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:51:20" (1/1) ... [2024-10-14 07:51:20,384 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:51:20" (1/1) ... [2024-10-14 07:51:20,424 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 176 [2024-10-14 07:51:20,428 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 07:51:20,429 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 07:51:20,429 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 07:51:20,429 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 07:51:20,440 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:51:20" (1/1) ... [2024-10-14 07:51:20,440 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:51:20" (1/1) ... [2024-10-14 07:51:20,445 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:51:20" (1/1) ... [2024-10-14 07:51:20,459 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-14 07:51:20,459 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:51:20" (1/1) ... [2024-10-14 07:51:20,460 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:51:20" (1/1) ... [2024-10-14 07:51:20,466 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:51:20" (1/1) ... [2024-10-14 07:51:20,471 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:51:20" (1/1) ... [2024-10-14 07:51:20,473 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:51:20" (1/1) ... [2024-10-14 07:51:20,474 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:51:20" (1/1) ... [2024-10-14 07:51:20,477 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 07:51:20,478 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 07:51:20,478 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 07:51:20,478 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 07:51:20,479 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:51:20" (1/1) ... [2024-10-14 07:51:20,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:51:20,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:51:20,520 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-14 07:51:20,522 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-14 07:51:20,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 07:51:20,556 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 07:51:20,556 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 07:51:20,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 07:51:20,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 07:51:20,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 07:51:20,622 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 07:51:20,623 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 07:51:20,889 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-10-14 07:51:20,889 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 07:51:20,936 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 07:51:20,936 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 07:51:20,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:51:20 BoogieIcfgContainer [2024-10-14 07:51:20,938 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 07:51:20,940 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 07:51:20,943 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 07:51:20,946 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 07:51:20,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:51:20" (1/3) ... [2024-10-14 07:51:20,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c44217c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:51:20, skipping insertion in model container [2024-10-14 07:51:20,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:51:20" (2/3) ... [2024-10-14 07:51:20,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c44217c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:51:20, skipping insertion in model container [2024-10-14 07:51:20,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:51:20" (3/3) ... [2024-10-14 07:51:20,952 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-34.i [2024-10-14 07:51:20,976 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 07:51:20,979 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 07:51:21,038 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 07:51:21,045 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;@d92d80d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 07:51:21,046 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 07:51:21,050 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 49 states have (on average 1.5510204081632653) internal successors, (76), 50 states have internal predecessors, (76), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 07:51:21,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-14 07:51:21,060 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:51:21,061 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:51:21,062 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:51:21,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:51:21,067 INFO L85 PathProgramCache]: Analyzing trace with hash -100955092, now seen corresponding path program 1 times [2024-10-14 07:51:21,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:51:21,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102201470] [2024-10-14 07:51:21,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:51:21,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:51:21,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:21,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:51:21,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:21,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:51:21,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:21,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 07:51:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:21,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:51:21,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:21,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 07:51:21,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:21,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:51:21,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:21,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 07:51:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:21,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:51:21,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:21,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 07:51:21,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:21,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:51:21,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:21,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 07:51:21,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:21,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:51:21,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:21,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 07:51:21,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:21,329 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-14 07:51:21,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:51:21,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102201470] [2024-10-14 07:51:21,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102201470] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:51:21,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:51:21,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 07:51:21,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226716340] [2024-10-14 07:51:21,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:51:21,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 07:51:21,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:51:21,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 07:51:21,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 07:51:21,367 INFO L87 Difference]: Start difference. First operand has 65 states, 49 states have (on average 1.5510204081632653) internal successors, (76), 50 states have internal predecessors, (76), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 07:51:21,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:51:21,403 INFO L93 Difference]: Finished difference Result 127 states and 215 transitions. [2024-10-14 07:51:21,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 07:51:21,407 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 90 [2024-10-14 07:51:21,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:51:21,412 INFO L225 Difference]: With dead ends: 127 [2024-10-14 07:51:21,413 INFO L226 Difference]: Without dead ends: 63 [2024-10-14 07:51:21,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 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-14 07:51:21,418 INFO L432 NwaCegarLoop]: 94 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, 94 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-14 07:51:21,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:51:21,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-14 07:51:21,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-14 07:51:21,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 48 states have internal predecessors, (71), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 07:51:21,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 97 transitions. [2024-10-14 07:51:21,534 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 97 transitions. Word has length 90 [2024-10-14 07:51:21,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:51:21,534 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 97 transitions. [2024-10-14 07:51:21,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 07:51:21,535 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 97 transitions. [2024-10-14 07:51:21,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-14 07:51:21,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:51:21,537 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:51:21,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 07:51:21,538 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:51:21,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:51:21,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1074906774, now seen corresponding path program 1 times [2024-10-14 07:51:21,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:51:21,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320307070] [2024-10-14 07:51:21,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:51:21,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:51:21,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:22,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:51:22,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:22,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:51:22,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:22,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 07:51:22,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:22,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:51:22,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:22,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 07:51:22,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:22,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:51:22,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:22,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 07:51:22,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:22,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:51:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:22,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 07:51:22,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:22,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:51:22,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:22,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 07:51:22,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:22,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:51:22,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:22,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 07:51:22,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:22,104 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-14 07:51:22,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:51:22,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320307070] [2024-10-14 07:51:22,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320307070] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:51:22,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:51:22,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 07:51:22,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179048086] [2024-10-14 07:51:22,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:51:22,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 07:51:22,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:51:22,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 07:51:22,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 07:51:22,107 INFO L87 Difference]: Start difference. First operand 63 states and 97 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-14 07:51:22,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:51:22,237 INFO L93 Difference]: Finished difference Result 216 states and 333 transitions. [2024-10-14 07:51:22,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 07:51:22,238 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 90 [2024-10-14 07:51:22,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:51:22,240 INFO L225 Difference]: With dead ends: 216 [2024-10-14 07:51:22,240 INFO L226 Difference]: Without dead ends: 154 [2024-10-14 07:51:22,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 07:51:22,243 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 124 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:51:22,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 309 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:51:22,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-10-14 07:51:22,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 125. [2024-10-14 07:51:22,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 96 states have (on average 1.46875) internal successors, (141), 96 states have internal predecessors, (141), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 07:51:22,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 193 transitions. [2024-10-14 07:51:22,275 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 193 transitions. Word has length 90 [2024-10-14 07:51:22,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:51:22,275 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 193 transitions. [2024-10-14 07:51:22,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-14 07:51:22,276 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 193 transitions. [2024-10-14 07:51:22,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-14 07:51:22,277 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:51:22,277 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:51:22,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 07:51:22,278 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:51:22,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:51:22,282 INFO L85 PathProgramCache]: Analyzing trace with hash -238751484, now seen corresponding path program 1 times [2024-10-14 07:51:22,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:51:22,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672901758] [2024-10-14 07:51:22,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:51:22,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:51:22,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:22,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:51:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:22,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:51:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:22,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 07:51:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:22,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:51:22,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:22,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 07:51:22,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:22,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:51:22,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:22,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 07:51:22,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:22,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:51:22,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:22,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 07:51:22,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:22,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:51:22,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:22,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 07:51:22,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:22,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:51:22,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:22,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 07:51:22,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:22,748 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-14 07:51:22,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:51:22,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672901758] [2024-10-14 07:51:22,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672901758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:51:22,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:51:22,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 07:51:22,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626764924] [2024-10-14 07:51:22,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:51:22,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 07:51:22,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:51:22,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 07:51:22,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 07:51:22,750 INFO L87 Difference]: Start difference. First operand 125 states and 193 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-14 07:51:22,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:51:22,944 INFO L93 Difference]: Finished difference Result 368 states and 566 transitions. [2024-10-14 07:51:22,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 07:51:22,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 91 [2024-10-14 07:51:22,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:51:22,947 INFO L225 Difference]: With dead ends: 368 [2024-10-14 07:51:22,947 INFO L226 Difference]: Without dead ends: 244 [2024-10-14 07:51:22,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 07:51:22,949 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 153 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 07:51:22,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 290 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 07:51:22,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-10-14 07:51:22,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 129. [2024-10-14 07:51:22,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 100 states have (on average 1.45) internal successors, (145), 100 states have internal predecessors, (145), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 07:51:22,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 197 transitions. [2024-10-14 07:51:22,979 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 197 transitions. Word has length 91 [2024-10-14 07:51:22,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:51:22,979 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 197 transitions. [2024-10-14 07:51:22,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-14 07:51:22,980 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 197 transitions. [2024-10-14 07:51:22,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 07:51:22,981 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:51:22,981 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:51:22,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 07:51:22,981 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:51:22,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:51:22,982 INFO L85 PathProgramCache]: Analyzing trace with hash 635638786, now seen corresponding path program 1 times [2024-10-14 07:51:22,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:51:22,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418917029] [2024-10-14 07:51:22,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:51:22,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:51:23,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:34,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:51:34,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:34,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:51:34,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:34,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 07:51:34,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:34,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:51:34,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:34,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 07:51:34,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:34,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:51:34,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:34,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 07:51:34,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:34,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:51:34,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:34,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 07:51:34,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:34,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:51:34,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:34,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 07:51:34,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:34,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:51:34,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:34,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 07:51:34,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:34,223 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-14 07:51:34,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:51:34,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418917029] [2024-10-14 07:51:34,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418917029] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:51:34,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:51:34,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-14 07:51:34,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531340287] [2024-10-14 07:51:34,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:51:34,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 07:51:34,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:51:34,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 07:51:34,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-10-14 07:51:34,225 INFO L87 Difference]: Start difference. First operand 129 states and 197 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-14 07:51:36,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:51:36,690 INFO L93 Difference]: Finished difference Result 465 states and 697 transitions. [2024-10-14 07:51:36,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 07:51:36,690 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 92 [2024-10-14 07:51:36,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:51:36,692 INFO L225 Difference]: With dead ends: 465 [2024-10-14 07:51:36,692 INFO L226 Difference]: Without dead ends: 337 [2024-10-14 07:51:36,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2024-10-14 07:51:36,694 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 347 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 07:51:36,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 496 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 07:51:36,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-10-14 07:51:36,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 187. [2024-10-14 07:51:36,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 144 states have (on average 1.4236111111111112) internal successors, (205), 144 states have internal predecessors, (205), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-14 07:51:36,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 283 transitions. [2024-10-14 07:51:36,711 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 283 transitions. Word has length 92 [2024-10-14 07:51:36,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:51:36,712 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 283 transitions. [2024-10-14 07:51:36,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-14 07:51:36,712 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 283 transitions. [2024-10-14 07:51:36,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 07:51:36,713 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:51:36,713 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:51:36,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 07:51:36,713 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:51:36,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:51:36,714 INFO L85 PathProgramCache]: Analyzing trace with hash 692897088, now seen corresponding path program 1 times [2024-10-14 07:51:36,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:51:36,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796240152] [2024-10-14 07:51:36,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:51:36,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:51:36,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:39,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:51:39,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:39,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:51:39,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:39,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 07:51:39,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:39,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:51:39,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:39,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 07:51:39,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:39,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:51:39,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:39,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 07:51:39,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:39,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:51:39,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:39,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 07:51:39,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:39,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:51:39,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:39,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 07:51:39,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:39,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:51:39,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:39,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 07:51:39,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:39,420 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-14 07:51:39,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:51:39,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796240152] [2024-10-14 07:51:39,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796240152] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:51:39,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:51:39,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 07:51:39,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966875671] [2024-10-14 07:51:39,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:51:39,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 07:51:39,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:51:39,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 07:51:39,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-14 07:51:39,422 INFO L87 Difference]: Start difference. First operand 187 states and 283 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-14 07:51:40,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:51:40,070 INFO L93 Difference]: Finished difference Result 500 states and 751 transitions. [2024-10-14 07:51:40,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 07:51:40,071 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 92 [2024-10-14 07:51:40,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:51:40,073 INFO L225 Difference]: With dead ends: 500 [2024-10-14 07:51:40,074 INFO L226 Difference]: Without dead ends: 372 [2024-10-14 07:51:40,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-10-14 07:51:40,075 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 317 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 07:51:40,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 352 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 07:51:40,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-10-14 07:51:40,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 228. [2024-10-14 07:51:40,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 185 states have (on average 1.4378378378378378) internal successors, (266), 185 states have internal predecessors, (266), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-14 07:51:40,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 344 transitions. [2024-10-14 07:51:40,108 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 344 transitions. Word has length 92 [2024-10-14 07:51:40,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:51:40,108 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 344 transitions. [2024-10-14 07:51:40,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-14 07:51:40,108 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 344 transitions. [2024-10-14 07:51:40,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 07:51:40,109 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:51:40,109 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:51:40,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 07:51:40,109 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:51:40,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:51:40,109 INFO L85 PathProgramCache]: Analyzing trace with hash -173707840, now seen corresponding path program 1 times [2024-10-14 07:51:40,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:51:40,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205262402] [2024-10-14 07:51:40,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:51:40,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:51:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:42,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:51:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:42,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:51:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:42,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 07:51:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:42,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:51:42,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:42,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 07:51:42,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:42,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:51:42,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:42,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 07:51:42,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:42,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:51:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:42,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 07:51:42,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:42,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:51:42,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:42,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 07:51:42,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:42,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:51:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:42,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 07:51:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:42,869 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-14 07:51:42,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:51:42,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205262402] [2024-10-14 07:51:42,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205262402] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:51:42,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:51:42,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 07:51:42,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185104743] [2024-10-14 07:51:42,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:51:42,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 07:51:42,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:51:42,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 07:51:42,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-14 07:51:42,872 INFO L87 Difference]: Start difference. First operand 228 states and 344 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-14 07:51:43,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:51:43,605 INFO L93 Difference]: Finished difference Result 572 states and 848 transitions. [2024-10-14 07:51:43,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 07:51:43,606 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 92 [2024-10-14 07:51:43,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:51:43,608 INFO L225 Difference]: With dead ends: 572 [2024-10-14 07:51:43,608 INFO L226 Difference]: Without dead ends: 401 [2024-10-14 07:51:43,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-10-14 07:51:43,614 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 268 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 07:51:43,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 327 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 07:51:43,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-10-14 07:51:43,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 331. [2024-10-14 07:51:43,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 288 states have (on average 1.4409722222222223) internal successors, (415), 288 states have internal predecessors, (415), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-14 07:51:43,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 493 transitions. [2024-10-14 07:51:43,640 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 493 transitions. Word has length 92 [2024-10-14 07:51:43,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:51:43,641 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 493 transitions. [2024-10-14 07:51:43,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-14 07:51:43,642 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 493 transitions. [2024-10-14 07:51:43,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 07:51:43,644 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:51:43,644 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:51:43,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 07:51:43,644 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:51:43,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:51:43,644 INFO L85 PathProgramCache]: Analyzing trace with hash -2037732559, now seen corresponding path program 1 times [2024-10-14 07:51:43,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:51:43,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672102523] [2024-10-14 07:51:43,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:51:43,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:51:43,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:45,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:51:45,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:45,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:51:45,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:45,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 07:51:45,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:45,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:51:45,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:45,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 07:51:45,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:45,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:51:45,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:45,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 07:51:45,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:45,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:51:45,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:45,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 07:51:45,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:45,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:51:45,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:45,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 07:51:45,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:45,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:51:45,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:45,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 07:51:45,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:45,320 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-14 07:51:45,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:51:45,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672102523] [2024-10-14 07:51:45,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672102523] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:51:45,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:51:45,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 07:51:45,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575947841] [2024-10-14 07:51:45,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:51:45,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 07:51:45,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:51:45,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 07:51:45,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 07:51:45,322 INFO L87 Difference]: Start difference. First operand 331 states and 493 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-14 07:51:45,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:51:45,697 INFO L93 Difference]: Finished difference Result 597 states and 885 transitions. [2024-10-14 07:51:45,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 07:51:45,697 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 92 [2024-10-14 07:51:45,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:51:45,709 INFO L225 Difference]: With dead ends: 597 [2024-10-14 07:51:45,709 INFO L226 Difference]: Without dead ends: 423 [2024-10-14 07:51:45,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-10-14 07:51:45,715 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 157 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 07:51:45,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 316 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 07:51:45,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2024-10-14 07:51:45,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 333. [2024-10-14 07:51:45,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 290 states have (on average 1.4241379310344828) internal successors, (413), 290 states have internal predecessors, (413), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-14 07:51:45,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 491 transitions. [2024-10-14 07:51:45,743 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 491 transitions. Word has length 92 [2024-10-14 07:51:45,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:51:45,743 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 491 transitions. [2024-10-14 07:51:45,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-14 07:51:45,744 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 491 transitions. [2024-10-14 07:51:45,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 07:51:45,746 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:51:45,746 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:51:45,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 07:51:45,746 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:51:45,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:51:45,747 INFO L85 PathProgramCache]: Analyzing trace with hash 48832772, now seen corresponding path program 1 times [2024-10-14 07:51:45,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:51:45,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998431756] [2024-10-14 07:51:45,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:51:45,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:51:45,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:45,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:51:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:45,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:51:45,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:45,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 07:51:45,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:45,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:51:45,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:45,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 07:51:45,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:45,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:51:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:45,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 07:51:45,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:45,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:51:45,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:45,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 07:51:45,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:45,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:51:45,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:45,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 07:51:45,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:45,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:51:45,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:45,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 07:51:45,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:45,970 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-14 07:51:45,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:51:45,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998431756] [2024-10-14 07:51:45,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998431756] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:51:45,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:51:45,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 07:51:45,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45291983] [2024-10-14 07:51:45,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:51:45,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 07:51:45,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:51:45,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 07:51:45,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 07:51:45,972 INFO L87 Difference]: Start difference. First operand 333 states and 491 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-14 07:51:46,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:51:46,250 INFO L93 Difference]: Finished difference Result 515 states and 766 transitions. [2024-10-14 07:51:46,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 07:51:46,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 92 [2024-10-14 07:51:46,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:51:46,253 INFO L225 Difference]: With dead ends: 515 [2024-10-14 07:51:46,254 INFO L226 Difference]: Without dead ends: 327 [2024-10-14 07:51:46,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 07:51:46,255 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 77 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 07:51:46,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 219 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 07:51:46,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-10-14 07:51:46,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 301. [2024-10-14 07:51:46,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 258 states have (on average 1.3914728682170543) internal successors, (359), 258 states have internal predecessors, (359), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-14 07:51:46,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 437 transitions. [2024-10-14 07:51:46,279 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 437 transitions. Word has length 92 [2024-10-14 07:51:46,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:51:46,281 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 437 transitions. [2024-10-14 07:51:46,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-14 07:51:46,281 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 437 transitions. [2024-10-14 07:51:46,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 07:51:46,282 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:51:46,282 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:51:46,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 07:51:46,282 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:51:46,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:51:46,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1114190223, now seen corresponding path program 1 times [2024-10-14 07:51:46,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:51:46,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538683005] [2024-10-14 07:51:46,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:51:46,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:51:46,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:50,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:51:50,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:50,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:51:50,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:50,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 07:51:50,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:50,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:51:50,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:50,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 07:51:50,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:50,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:51:50,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:50,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 07:51:51,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:51,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:51:51,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:51,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 07:51:51,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:51,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:51:51,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:51,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 07:51:51,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:51,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:51:51,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:51,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 07:51:51,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:51,006 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-14 07:51:51,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:51:51,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538683005] [2024-10-14 07:51:51,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538683005] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:51:51,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:51:51,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 07:51:51,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547160478] [2024-10-14 07:51:51,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:51:51,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 07:51:51,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:51:51,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 07:51:51,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-14 07:51:51,008 INFO L87 Difference]: Start difference. First operand 301 states and 437 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-14 07:51:52,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:51:52,316 INFO L93 Difference]: Finished difference Result 607 states and 878 transitions. [2024-10-14 07:51:52,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 07:51:52,317 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 93 [2024-10-14 07:51:52,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:51:52,318 INFO L225 Difference]: With dead ends: 607 [2024-10-14 07:51:52,318 INFO L226 Difference]: Without dead ends: 479 [2024-10-14 07:51:52,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-10-14 07:51:52,319 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 208 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 07:51:52,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 581 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 07:51:52,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2024-10-14 07:51:52,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 317. [2024-10-14 07:51:52,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 272 states have (on average 1.3786764705882353) internal successors, (375), 272 states have internal predecessors, (375), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-14 07:51:52,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 453 transitions. [2024-10-14 07:51:52,342 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 453 transitions. Word has length 93 [2024-10-14 07:51:52,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:51:52,342 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 453 transitions. [2024-10-14 07:51:52,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-14 07:51:52,343 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 453 transitions. [2024-10-14 07:51:52,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 07:51:52,343 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:51:52,344 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:51:52,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 07:51:52,344 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:51:52,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:51:52,344 INFO L85 PathProgramCache]: Analyzing trace with hash -969020839, now seen corresponding path program 1 times [2024-10-14 07:51:52,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:51:52,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938869874] [2024-10-14 07:51:52,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:51:52,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:51:52,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:58,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:51:58,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:58,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:51:58,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:58,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 07:51:58,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:58,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:51:58,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:58,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 07:51:58,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:58,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:51:58,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:58,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 07:51:58,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:58,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:51:58,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:58,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 07:51:58,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:58,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:51:58,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:58,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 07:51:58,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:58,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:51:58,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:58,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 07:51:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:51:58,150 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-14 07:51:58,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:51:58,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938869874] [2024-10-14 07:51:58,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938869874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:51:58,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:51:58,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 07:51:58,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405350771] [2024-10-14 07:51:58,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:51:58,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 07:51:58,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:51:58,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 07:51:58,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-10-14 07:51:58,156 INFO L87 Difference]: Start difference. First operand 317 states and 453 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-14 07:52:00,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:52:00,036 INFO L93 Difference]: Finished difference Result 802 states and 1147 transitions. [2024-10-14 07:52:00,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-14 07:52:00,037 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 93 [2024-10-14 07:52:00,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:52:00,039 INFO L225 Difference]: With dead ends: 802 [2024-10-14 07:52:00,039 INFO L226 Difference]: Without dead ends: 606 [2024-10-14 07:52:00,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2024-10-14 07:52:00,040 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 283 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 07:52:00,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 462 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 07:52:00,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-10-14 07:52:00,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 414. [2024-10-14 07:52:00,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 369 states have (on average 1.3983739837398375) internal successors, (516), 369 states have internal predecessors, (516), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-14 07:52:00,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 594 transitions. [2024-10-14 07:52:00,063 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 594 transitions. Word has length 93 [2024-10-14 07:52:00,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:52:00,064 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 594 transitions. [2024-10-14 07:52:00,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-14 07:52:00,064 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 594 transitions. [2024-10-14 07:52:00,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-14 07:52:00,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:52:00,065 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:52:00,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 07:52:00,065 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:52:00,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:52:00,065 INFO L85 PathProgramCache]: Analyzing trace with hash -372841257, now seen corresponding path program 1 times [2024-10-14 07:52:00,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:52:00,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807069335] [2024-10-14 07:52:00,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:52:00,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:52:00,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:07,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:52:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:07,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:52:07,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:07,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 07:52:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:07,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:52:07,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:07,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 07:52:07,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:07,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:52:07,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:07,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 07:52:07,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:07,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:52:07,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:07,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 07:52:07,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:07,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:52:07,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:07,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 07:52:07,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:07,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:52:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:07,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 07:52:07,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:07,364 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-14 07:52:07,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:52:07,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807069335] [2024-10-14 07:52:07,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807069335] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:52:07,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:52:07,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-14 07:52:07,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026607970] [2024-10-14 07:52:07,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:52:07,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 07:52:07,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:52:07,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 07:52:07,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-14 07:52:07,366 INFO L87 Difference]: Start difference. First operand 414 states and 594 transitions. Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-14 07:52:10,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:52:10,267 INFO L93 Difference]: Finished difference Result 1172 states and 1706 transitions. [2024-10-14 07:52:10,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-14 07:52:10,268 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 94 [2024-10-14 07:52:10,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:52:10,275 INFO L225 Difference]: With dead ends: 1172 [2024-10-14 07:52:10,275 INFO L226 Difference]: Without dead ends: 958 [2024-10-14 07:52:10,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=248, Invalid=564, Unknown=0, NotChecked=0, Total=812 [2024-10-14 07:52:10,276 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 538 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 07:52:10,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 510 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 07:52:10,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2024-10-14 07:52:10,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 648. [2024-10-14 07:52:10,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 573 states have (on average 1.4101221640488657) internal successors, (808), 573 states have internal predecessors, (808), 65 states have call successors, (65), 9 states have call predecessors, (65), 9 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2024-10-14 07:52:10,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 938 transitions. [2024-10-14 07:52:10,346 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 938 transitions. Word has length 94 [2024-10-14 07:52:10,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:52:10,347 INFO L471 AbstractCegarLoop]: Abstraction has 648 states and 938 transitions. [2024-10-14 07:52:10,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-14 07:52:10,347 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 938 transitions. [2024-10-14 07:52:10,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-14 07:52:10,348 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:52:10,348 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:52:10,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 07:52:10,348 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:52:10,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:52:10,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1520730717, now seen corresponding path program 1 times [2024-10-14 07:52:10,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:52:10,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466212484] [2024-10-14 07:52:10,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:52:10,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:52:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:17,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:52:17,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:17,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:52:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:17,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 07:52:17,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:17,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:52:17,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:17,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 07:52:17,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:17,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:52:17,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:17,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 07:52:17,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:17,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:52:17,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:17,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 07:52:17,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:17,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:52:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:17,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 07:52:17,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:17,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:52:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:17,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 07:52:17,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:17,625 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-14 07:52:17,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:52:17,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466212484] [2024-10-14 07:52:17,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466212484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:52:17,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:52:17,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 07:52:17,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421820359] [2024-10-14 07:52:17,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:52:17,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 07:52:17,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:52:17,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 07:52:17,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-14 07:52:17,627 INFO L87 Difference]: Start difference. First operand 648 states and 938 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-14 07:52:21,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:52:21,688 INFO L93 Difference]: Finished difference Result 1508 states and 2180 transitions. [2024-10-14 07:52:21,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-14 07:52:21,691 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 94 [2024-10-14 07:52:21,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:52:21,695 INFO L225 Difference]: With dead ends: 1508 [2024-10-14 07:52:21,695 INFO L226 Difference]: Without dead ends: 1082 [2024-10-14 07:52:21,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2024-10-14 07:52:21,697 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 351 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:52:21,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 441 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-14 07:52:21,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2024-10-14 07:52:21,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 690. [2024-10-14 07:52:21,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 615 states have (on average 1.408130081300813) internal successors, (866), 615 states have internal predecessors, (866), 65 states have call successors, (65), 9 states have call predecessors, (65), 9 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2024-10-14 07:52:21,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 996 transitions. [2024-10-14 07:52:21,739 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 996 transitions. Word has length 94 [2024-10-14 07:52:21,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:52:21,739 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 996 transitions. [2024-10-14 07:52:21,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-14 07:52:21,739 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 996 transitions. [2024-10-14 07:52:21,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-14 07:52:21,740 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:52:21,740 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:52:21,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 07:52:21,741 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:52:21,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:52:21,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1907631651, now seen corresponding path program 1 times [2024-10-14 07:52:21,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:52:21,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494043250] [2024-10-14 07:52:21,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:52:21,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:52:21,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:26,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:52:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:26,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:52:26,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:26,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 07:52:26,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:26,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:52:26,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:26,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 07:52:26,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:27,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:52:27,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:27,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 07:52:27,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:27,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:52:27,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:27,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 07:52:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:27,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:52:27,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:27,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 07:52:27,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:27,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:52:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:27,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 07:52:27,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:27,074 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-14 07:52:27,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:52:27,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494043250] [2024-10-14 07:52:27,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494043250] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:52:27,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:52:27,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 07:52:27,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823247755] [2024-10-14 07:52:27,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:52:27,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 07:52:27,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:52:27,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 07:52:27,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-14 07:52:27,076 INFO L87 Difference]: Start difference. First operand 690 states and 996 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-14 07:52:28,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:52:28,700 INFO L93 Difference]: Finished difference Result 1502 states and 2159 transitions. [2024-10-14 07:52:28,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 07:52:28,701 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 94 [2024-10-14 07:52:28,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:52:28,708 INFO L225 Difference]: With dead ends: 1502 [2024-10-14 07:52:28,708 INFO L226 Difference]: Without dead ends: 959 [2024-10-14 07:52:28,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2024-10-14 07:52:28,713 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 216 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:52:28,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 555 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 07:52:28,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2024-10-14 07:52:28,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 690. [2024-10-14 07:52:28,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 615 states have (on average 1.4065040650406504) internal successors, (865), 615 states have internal predecessors, (865), 65 states have call successors, (65), 9 states have call predecessors, (65), 9 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2024-10-14 07:52:28,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 995 transitions. [2024-10-14 07:52:28,774 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 995 transitions. Word has length 94 [2024-10-14 07:52:28,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:52:28,774 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 995 transitions. [2024-10-14 07:52:28,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-14 07:52:28,774 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 995 transitions. [2024-10-14 07:52:28,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-14 07:52:28,775 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:52:28,775 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:52:28,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 07:52:28,775 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:52:28,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:52:28,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1964889953, now seen corresponding path program 1 times [2024-10-14 07:52:28,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:52:28,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605761930] [2024-10-14 07:52:28,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:52:28,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:52:28,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:44,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:52:44,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:44,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:52:44,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:44,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 07:52:44,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:44,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:52:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:44,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 07:52:44,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:44,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:52:44,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:44,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 07:52:44,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:44,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:52:44,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:44,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 07:52:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:44,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:52:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:44,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 07:52:44,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:44,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:52:44,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:44,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 07:52:44,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:44,597 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-14 07:52:44,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:52:44,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605761930] [2024-10-14 07:52:44,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605761930] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:52:44,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:52:44,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-14 07:52:44,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794288581] [2024-10-14 07:52:44,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:52:44,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 07:52:44,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:52:44,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 07:52:44,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-10-14 07:52:44,599 INFO L87 Difference]: Start difference. First operand 690 states and 995 transitions. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-14 07:52:47,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:52:47,869 INFO L93 Difference]: Finished difference Result 1364 states and 1944 transitions. [2024-10-14 07:52:47,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 07:52:47,869 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 94 [2024-10-14 07:52:47,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:52:47,872 INFO L225 Difference]: With dead ends: 1364 [2024-10-14 07:52:47,872 INFO L226 Difference]: Without dead ends: 898 [2024-10-14 07:52:47,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=161, Invalid=541, Unknown=0, NotChecked=0, Total=702 [2024-10-14 07:52:47,876 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 339 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-14 07:52:47,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 494 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1029 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-14 07:52:47,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2024-10-14 07:52:47,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 726. [2024-10-14 07:52:47,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 651 states have (on average 1.3978494623655915) internal successors, (910), 651 states have internal predecessors, (910), 65 states have call successors, (65), 9 states have call predecessors, (65), 9 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2024-10-14 07:52:47,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1040 transitions. [2024-10-14 07:52:47,918 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1040 transitions. Word has length 94 [2024-10-14 07:52:47,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:52:47,918 INFO L471 AbstractCegarLoop]: Abstraction has 726 states and 1040 transitions. [2024-10-14 07:52:47,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-14 07:52:47,919 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1040 transitions. [2024-10-14 07:52:47,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-14 07:52:47,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:52:47,920 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:52:47,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 07:52:47,920 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:52:47,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:52:47,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1330888373, now seen corresponding path program 1 times [2024-10-14 07:52:47,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:52:47,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758263241] [2024-10-14 07:52:47,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:52:47,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:52:47,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat