./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label58.c --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/eca-rers2012/Problem13_label58.c -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 18d91842aba67b15ef1ce5fcca24e96a1a752cfb2bfcabae8ea7bcde2585be09 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-13 23:41:14,440 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 23:41:14,520 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 23:41:14,524 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 23:41:14,525 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 23:41:14,556 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 23:41:14,557 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 23:41:14,557 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 23:41:14,558 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 23:41:14,558 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 23:41:14,558 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 23:41:14,559 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 23:41:14,559 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 23:41:14,560 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 23:41:14,560 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 23:41:14,560 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 23:41:14,561 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 23:41:14,561 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 23:41:14,561 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 23:41:14,562 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 23:41:14,562 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 23:41:14,563 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 23:41:14,563 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 23:41:14,563 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 23:41:14,564 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 23:41:14,564 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 23:41:14,564 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 23:41:14,565 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 23:41:14,565 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 23:41:14,565 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 23:41:14,565 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 23:41:14,566 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 23:41:14,566 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:41:14,566 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 23:41:14,567 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 23:41:14,567 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 23:41:14,567 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 23:41:14,568 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 23:41:14,568 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 23:41:14,568 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 23:41:14,569 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 23:41:14,572 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 23:41:14,572 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 -> 18d91842aba67b15ef1ce5fcca24e96a1a752cfb2bfcabae8ea7bcde2585be09 [2024-10-13 23:41:14,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 23:41:14,846 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 23:41:14,850 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 23:41:14,851 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 23:41:14,852 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 23:41:14,853 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label58.c [2024-10-13 23:41:16,422 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 23:41:16,892 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 23:41:16,894 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label58.c [2024-10-13 23:41:16,933 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36f28be73/8c4149737d394fdb9e403b507fda3490/FLAG391816344 [2024-10-13 23:41:16,997 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36f28be73/8c4149737d394fdb9e403b507fda3490 [2024-10-13 23:41:17,001 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 23:41:17,003 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 23:41:17,005 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 23:41:17,005 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 23:41:17,010 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 23:41:17,011 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:41:17" (1/1) ... [2024-10-13 23:41:17,014 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73f59f04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:41:17, skipping insertion in model container [2024-10-13 23:41:17,014 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:41:17" (1/1) ... [2024-10-13 23:41:17,137 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 23:41:17,355 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/eca-rers2012/Problem13_label58.c[2071,2084] [2024-10-13 23:41:18,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:41:18,300 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 23:41:18,315 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/eca-rers2012/Problem13_label58.c[2071,2084] [2024-10-13 23:41:18,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:41:18,873 INFO L204 MainTranslator]: Completed translation [2024-10-13 23:41:18,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:41:18 WrapperNode [2024-10-13 23:41:18,874 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 23:41:18,875 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 23:41:18,875 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 23:41:18,875 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 23:41:18,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:41:18" (1/1) ... [2024-10-13 23:41:18,948 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:41:18" (1/1) ... [2024-10-13 23:41:19,418 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-10-13 23:41:19,418 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 23:41:19,420 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 23:41:19,420 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 23:41:19,420 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 23:41:19,431 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:41:18" (1/1) ... [2024-10-13 23:41:19,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:41:18" (1/1) ... [2024-10-13 23:41:19,527 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:41:18" (1/1) ... [2024-10-13 23:41:19,977 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 23:41:19,981 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:41:18" (1/1) ... [2024-10-13 23:41:19,982 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:41:18" (1/1) ... [2024-10-13 23:41:20,296 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:41:18" (1/1) ... [2024-10-13 23:41:20,337 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:41:18" (1/1) ... [2024-10-13 23:41:20,373 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:41:18" (1/1) ... [2024-10-13 23:41:20,397 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:41:18" (1/1) ... [2024-10-13 23:41:20,466 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 23:41:20,467 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 23:41:20,468 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 23:41:20,468 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 23:41:20,469 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:41:18" (1/1) ... [2024-10-13 23:41:20,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:41:20,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:41:20,501 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 23:41:20,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 23:41:20,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 23:41:20,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 23:41:20,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 23:41:20,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 23:41:20,622 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 23:41:20,626 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 23:41:26,492 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-10-13 23:41:26,492 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 23:41:26,566 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 23:41:26,566 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 23:41:26,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:41:26 BoogieIcfgContainer [2024-10-13 23:41:26,567 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 23:41:26,570 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 23:41:26,570 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 23:41:26,576 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 23:41:26,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:41:17" (1/3) ... [2024-10-13 23:41:26,578 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b7de171 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:41:26, skipping insertion in model container [2024-10-13 23:41:26,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:41:18" (2/3) ... [2024-10-13 23:41:26,578 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b7de171 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:41:26, skipping insertion in model container [2024-10-13 23:41:26,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:41:26" (3/3) ... [2024-10-13 23:41:26,580 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label58.c [2024-10-13 23:41:26,597 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 23:41:26,597 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 23:41:26,709 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 23:41:26,717 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;@7c6ba181, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 23:41:26,718 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 23:41:26,729 INFO L276 IsEmpty]: Start isEmpty. Operand has 1036 states, 1034 states have (on average 1.877176015473888) internal successors, (1941), 1035 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:26,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-13 23:41:26,735 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:41:26,737 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:41:26,737 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:41:26,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:41:26,744 INFO L85 PathProgramCache]: Analyzing trace with hash 757761469, now seen corresponding path program 1 times [2024-10-13 23:41:26,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:41:26,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822500709] [2024-10-13 23:41:26,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:41:26,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:41:26,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:41:27,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:41:27,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:41:27,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822500709] [2024-10-13 23:41:27,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822500709] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:41:27,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:41:27,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:41:27,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276638132] [2024-10-13 23:41:27,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:41:27,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 23:41:27,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:41:27,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 23:41:27,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 23:41:27,056 INFO L87 Difference]: Start difference. First operand has 1036 states, 1034 states have (on average 1.877176015473888) internal successors, (1941), 1035 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:27,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:41:27,151 INFO L93 Difference]: Finished difference Result 2071 states and 3881 transitions. [2024-10-13 23:41:27,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 23:41:27,154 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-13 23:41:27,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:41:27,185 INFO L225 Difference]: With dead ends: 2071 [2024-10-13 23:41:27,185 INFO L226 Difference]: Without dead ends: 1034 [2024-10-13 23:41:27,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 23:41:27,194 INFO L432 NwaCegarLoop]: 1876 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1876 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:41:27,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1876 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 23:41:27,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-10-13 23:41:27,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2024-10-13 23:41:27,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1033 states have (on average 1.8160696999031947) internal successors, (1876), 1033 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:27,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1876 transitions. [2024-10-13 23:41:27,273 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1876 transitions. Word has length 11 [2024-10-13 23:41:27,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:41:27,273 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1876 transitions. [2024-10-13 23:41:27,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:27,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1876 transitions. [2024-10-13 23:41:27,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-13 23:41:27,274 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:41:27,274 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:41:27,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 23:41:27,275 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:41:27,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:41:27,276 INFO L85 PathProgramCache]: Analyzing trace with hash 740187147, now seen corresponding path program 1 times [2024-10-13 23:41:27,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:41:27,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031916125] [2024-10-13 23:41:27,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:41:27,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:41:27,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:41:27,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:41:27,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:41:27,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031916125] [2024-10-13 23:41:27,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031916125] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:41:27,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:41:27,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:41:27,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915504866] [2024-10-13 23:41:27,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:41:27,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:41:27,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:41:27,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:41:27,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:41:27,393 INFO L87 Difference]: Start difference. First operand 1034 states and 1876 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:31,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:41:31,522 INFO L93 Difference]: Finished difference Result 2976 states and 5471 transitions. [2024-10-13 23:41:31,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:41:31,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-13 23:41:31,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:41:31,531 INFO L225 Difference]: With dead ends: 2976 [2024-10-13 23:41:31,531 INFO L226 Difference]: Without dead ends: 1943 [2024-10-13 23:41:31,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:41:31,536 INFO L432 NwaCegarLoop]: 404 mSDtfsCounter, 943 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 3050 mSolverCounterSat, 532 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 943 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 3582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 532 IncrementalHoareTripleChecker+Valid, 3050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:41:31,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [943 Valid, 538 Invalid, 3582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [532 Valid, 3050 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-13 23:41:31,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2024-10-13 23:41:31,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1872. [2024-10-13 23:41:31,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1872 states, 1871 states have (on average 1.7397113842864778) internal successors, (3255), 1871 states have internal predecessors, (3255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:31,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1872 states to 1872 states and 3255 transitions. [2024-10-13 23:41:31,609 INFO L78 Accepts]: Start accepts. Automaton has 1872 states and 3255 transitions. Word has length 11 [2024-10-13 23:41:31,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:41:31,610 INFO L471 AbstractCegarLoop]: Abstraction has 1872 states and 3255 transitions. [2024-10-13 23:41:31,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:31,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1872 states and 3255 transitions. [2024-10-13 23:41:31,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-13 23:41:31,614 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:41:31,614 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:41:31,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 23:41:31,615 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:41:31,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:41:31,616 INFO L85 PathProgramCache]: Analyzing trace with hash 197939521, now seen corresponding path program 1 times [2024-10-13 23:41:31,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:41:31,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669722843] [2024-10-13 23:41:31,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:41:31,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:41:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:41:31,899 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:41:31,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:41:31,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669722843] [2024-10-13 23:41:31,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669722843] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:41:31,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:41:31,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:41:31,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506651288] [2024-10-13 23:41:31,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:41:31,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:41:31,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:41:31,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:41:31,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:41:31,903 INFO L87 Difference]: Start difference. First operand 1872 states and 3255 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:35,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:41:35,295 INFO L93 Difference]: Finished difference Result 5350 states and 9368 transitions. [2024-10-13 23:41:35,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:41:35,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-10-13 23:41:35,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:41:35,310 INFO L225 Difference]: With dead ends: 5350 [2024-10-13 23:41:35,310 INFO L226 Difference]: Without dead ends: 3479 [2024-10-13 23:41:35,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:41:35,316 INFO L432 NwaCegarLoop]: 924 mSDtfsCounter, 884 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2339 mSolverCounterSat, 878 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 3217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 878 IncrementalHoareTripleChecker+Valid, 2339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:41:35,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 1077 Invalid, 3217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [878 Valid, 2339 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-13 23:41:35,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3479 states. [2024-10-13 23:41:35,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3479 to 3478. [2024-10-13 23:41:35,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3478 states, 3477 states have (on average 1.5188380788035662) internal successors, (5281), 3477 states have internal predecessors, (5281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:35,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3478 states to 3478 states and 5281 transitions. [2024-10-13 23:41:35,385 INFO L78 Accepts]: Start accepts. Automaton has 3478 states and 5281 transitions. Word has length 76 [2024-10-13 23:41:35,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:41:35,385 INFO L471 AbstractCegarLoop]: Abstraction has 3478 states and 5281 transitions. [2024-10-13 23:41:35,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:35,386 INFO L276 IsEmpty]: Start isEmpty. Operand 3478 states and 5281 transitions. [2024-10-13 23:41:35,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-13 23:41:35,388 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:41:35,388 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:41:35,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 23:41:35,389 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:41:35,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:41:35,389 INFO L85 PathProgramCache]: Analyzing trace with hash -221495940, now seen corresponding path program 1 times [2024-10-13 23:41:35,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:41:35,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169364706] [2024-10-13 23:41:35,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:41:35,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:41:35,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:41:35,635 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:41:35,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:41:35,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169364706] [2024-10-13 23:41:35,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169364706] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:41:35,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:41:35,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:41:35,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274521345] [2024-10-13 23:41:35,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:41:35,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:41:35,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:41:35,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:41:35,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:41:35,640 INFO L87 Difference]: Start difference. First operand 3478 states and 5281 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:39,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:41:39,006 INFO L93 Difference]: Finished difference Result 10143 states and 15438 transitions. [2024-10-13 23:41:39,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:41:39,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-10-13 23:41:39,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:41:39,035 INFO L225 Difference]: With dead ends: 10143 [2024-10-13 23:41:39,036 INFO L226 Difference]: Without dead ends: 6666 [2024-10-13 23:41:39,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:41:39,045 INFO L432 NwaCegarLoop]: 743 mSDtfsCounter, 977 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 2555 mSolverCounterSat, 771 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 977 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 3326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 771 IncrementalHoareTripleChecker+Valid, 2555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-13 23:41:39,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [977 Valid, 877 Invalid, 3326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [771 Valid, 2555 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-13 23:41:39,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6666 states. [2024-10-13 23:41:39,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6666 to 6656. [2024-10-13 23:41:39,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6656 states, 6655 states have (on average 1.3729526671675432) internal successors, (9137), 6655 states have internal predecessors, (9137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:39,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6656 states to 6656 states and 9137 transitions. [2024-10-13 23:41:39,194 INFO L78 Accepts]: Start accepts. Automaton has 6656 states and 9137 transitions. Word has length 78 [2024-10-13 23:41:39,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:41:39,196 INFO L471 AbstractCegarLoop]: Abstraction has 6656 states and 9137 transitions. [2024-10-13 23:41:39,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:39,197 INFO L276 IsEmpty]: Start isEmpty. Operand 6656 states and 9137 transitions. [2024-10-13 23:41:39,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-13 23:41:39,198 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:41:39,198 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:41:39,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 23:41:39,199 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:41:39,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:41:39,201 INFO L85 PathProgramCache]: Analyzing trace with hash 500471917, now seen corresponding path program 1 times [2024-10-13 23:41:39,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:41:39,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627953826] [2024-10-13 23:41:39,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:41:39,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:41:39,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:41:39,359 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:41:39,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:41:39,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627953826] [2024-10-13 23:41:39,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627953826] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:41:39,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:41:39,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:41:39,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879022798] [2024-10-13 23:41:39,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:41:39,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:41:39,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:41:39,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:41:39,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:41:39,365 INFO L87 Difference]: Start difference. First operand 6656 states and 9137 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:42,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:41:42,406 INFO L93 Difference]: Finished difference Result 19636 states and 26968 transitions. [2024-10-13 23:41:42,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:41:42,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2024-10-13 23:41:42,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:41:42,450 INFO L225 Difference]: With dead ends: 19636 [2024-10-13 23:41:42,450 INFO L226 Difference]: Without dead ends: 12981 [2024-10-13 23:41:42,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:41:42,464 INFO L432 NwaCegarLoop]: 1010 mSDtfsCounter, 791 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2486 mSolverCounterSat, 792 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 3278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 792 IncrementalHoareTripleChecker+Valid, 2486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-13 23:41:42,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 1161 Invalid, 3278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [792 Valid, 2486 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-13 23:41:42,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12981 states. [2024-10-13 23:41:42,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12981 to 12174. [2024-10-13 23:41:42,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12174 states, 12173 states have (on average 1.2529368274049124) internal successors, (15252), 12173 states have internal predecessors, (15252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:42,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12174 states to 12174 states and 15252 transitions. [2024-10-13 23:41:42,687 INFO L78 Accepts]: Start accepts. Automaton has 12174 states and 15252 transitions. Word has length 84 [2024-10-13 23:41:42,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:41:42,687 INFO L471 AbstractCegarLoop]: Abstraction has 12174 states and 15252 transitions. [2024-10-13 23:41:42,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:42,688 INFO L276 IsEmpty]: Start isEmpty. Operand 12174 states and 15252 transitions. [2024-10-13 23:41:42,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-13 23:41:42,689 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:41:42,689 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:41:42,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 23:41:42,690 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:41:42,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:41:42,690 INFO L85 PathProgramCache]: Analyzing trace with hash 50340485, now seen corresponding path program 1 times [2024-10-13 23:41:42,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:41:42,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546975837] [2024-10-13 23:41:42,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:41:42,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:41:42,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:41:43,085 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:41:43,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:41:43,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546975837] [2024-10-13 23:41:43,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546975837] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:41:43,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550482906] [2024-10-13 23:41:43,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:41:43,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:41:43,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:41:43,089 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:41:43,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 23:41:43,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:41:43,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:41:43,189 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:41:43,349 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 23:41:43,349 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:41:43,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550482906] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:41:43,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:41:43,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-13 23:41:43,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338756326] [2024-10-13 23:41:43,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:41:43,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:41:43,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:41:43,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:41:43,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:41:43,352 INFO L87 Difference]: Start difference. First operand 12174 states and 15252 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:46,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:41:46,433 INFO L93 Difference]: Finished difference Result 36311 states and 45490 transitions. [2024-10-13 23:41:46,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:41:46,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2024-10-13 23:41:46,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:41:46,487 INFO L225 Difference]: With dead ends: 36311 [2024-10-13 23:41:46,487 INFO L226 Difference]: Without dead ends: 24138 [2024-10-13 23:41:46,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:41:46,504 INFO L432 NwaCegarLoop]: 706 mSDtfsCounter, 1053 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 2632 mSolverCounterSat, 544 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1053 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 3176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 544 IncrementalHoareTripleChecker+Valid, 2632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-13 23:41:46,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1053 Valid, 920 Invalid, 3176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [544 Valid, 2632 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-13 23:41:46,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24138 states. [2024-10-13 23:41:46,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24138 to 24120. [2024-10-13 23:41:46,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24120 states, 24119 states have (on average 1.2004229031054356) internal successors, (28953), 24119 states have internal predecessors, (28953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:46,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24120 states to 24120 states and 28953 transitions. [2024-10-13 23:41:46,861 INFO L78 Accepts]: Start accepts. Automaton has 24120 states and 28953 transitions. Word has length 100 [2024-10-13 23:41:46,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:41:46,862 INFO L471 AbstractCegarLoop]: Abstraction has 24120 states and 28953 transitions. [2024-10-13 23:41:46,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:46,863 INFO L276 IsEmpty]: Start isEmpty. Operand 24120 states and 28953 transitions. [2024-10-13 23:41:46,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-10-13 23:41:46,869 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:41:46,869 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:41:46,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 23:41:47,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-13 23:41:47,070 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:41:47,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:41:47,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1749023240, now seen corresponding path program 1 times [2024-10-13 23:41:47,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:41:47,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850134957] [2024-10-13 23:41:47,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:41:47,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:41:47,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:41:47,469 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-13 23:41:47,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:41:47,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850134957] [2024-10-13 23:41:47,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850134957] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:41:47,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:41:47,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:41:47,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207676152] [2024-10-13 23:41:47,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:41:47,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:41:47,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:41:47,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:41:47,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:41:47,472 INFO L87 Difference]: Start difference. First operand 24120 states and 28953 transitions. Second operand has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 2 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:50,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:41:50,334 INFO L93 Difference]: Finished difference Result 49026 states and 58707 transitions. [2024-10-13 23:41:50,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:41:50,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 2 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 203 [2024-10-13 23:41:50,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:41:50,372 INFO L225 Difference]: With dead ends: 49026 [2024-10-13 23:41:50,372 INFO L226 Difference]: Without dead ends: 24907 [2024-10-13 23:41:50,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:41:50,394 INFO L432 NwaCegarLoop]: 1081 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2521 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 2530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:41:50,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1210 Invalid, 2530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2521 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-13 23:41:50,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24907 states. [2024-10-13 23:41:50,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24907 to 24907. [2024-10-13 23:41:50,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24907 states, 24906 states have (on average 1.194290532401831) internal successors, (29745), 24906 states have internal predecessors, (29745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:50,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24907 states to 24907 states and 29745 transitions. [2024-10-13 23:41:50,709 INFO L78 Accepts]: Start accepts. Automaton has 24907 states and 29745 transitions. Word has length 203 [2024-10-13 23:41:50,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:41:50,709 INFO L471 AbstractCegarLoop]: Abstraction has 24907 states and 29745 transitions. [2024-10-13 23:41:50,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 2 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:50,710 INFO L276 IsEmpty]: Start isEmpty. Operand 24907 states and 29745 transitions. [2024-10-13 23:41:50,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-13 23:41:50,713 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:41:50,713 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:41:50,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 23:41:50,713 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:41:50,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:41:50,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1026097377, now seen corresponding path program 1 times [2024-10-13 23:41:50,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:41:50,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503844377] [2024-10-13 23:41:50,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:41:50,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:41:50,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:41:50,890 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:41:50,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:41:50,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503844377] [2024-10-13 23:41:50,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503844377] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:41:50,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:41:50,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:41:50,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948331673] [2024-10-13 23:41:50,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:41:50,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:41:50,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:41:50,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:41:50,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:41:50,893 INFO L87 Difference]: Start difference. First operand 24907 states and 29745 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:54,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:41:54,303 INFO L93 Difference]: Finished difference Result 61633 states and 75006 transitions. [2024-10-13 23:41:54,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:41:54,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 210 [2024-10-13 23:41:54,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:41:54,345 INFO L225 Difference]: With dead ends: 61633 [2024-10-13 23:41:54,345 INFO L226 Difference]: Without dead ends: 37514 [2024-10-13 23:41:54,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:41:54,367 INFO L432 NwaCegarLoop]: 824 mSDtfsCounter, 859 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 2391 mSolverCounterSat, 915 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 3306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 915 IncrementalHoareTripleChecker+Valid, 2391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-13 23:41:54,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 944 Invalid, 3306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [915 Valid, 2391 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-13 23:41:54,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37514 states. [2024-10-13 23:41:54,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37514 to 35929. [2024-10-13 23:41:54,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35929 states, 35928 states have (on average 1.1822812291249165) internal successors, (42477), 35928 states have internal predecessors, (42477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:55,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35929 states to 35929 states and 42477 transitions. [2024-10-13 23:41:55,009 INFO L78 Accepts]: Start accepts. Automaton has 35929 states and 42477 transitions. Word has length 210 [2024-10-13 23:41:55,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:41:55,010 INFO L471 AbstractCegarLoop]: Abstraction has 35929 states and 42477 transitions. [2024-10-13 23:41:55,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:55,011 INFO L276 IsEmpty]: Start isEmpty. Operand 35929 states and 42477 transitions. [2024-10-13 23:41:55,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-10-13 23:41:55,020 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:41:55,021 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:41:55,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 23:41:55,021 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:41:55,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:41:55,022 INFO L85 PathProgramCache]: Analyzing trace with hash -98545812, now seen corresponding path program 1 times [2024-10-13 23:41:55,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:41:55,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362835782] [2024-10-13 23:41:55,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:41:55,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:41:55,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:41:55,237 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:41:55,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:41:55,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362835782] [2024-10-13 23:41:55,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362835782] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:41:55,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:41:55,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:41:55,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038080159] [2024-10-13 23:41:55,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:41:55,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:41:55,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:41:55,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:41:55,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:41:55,245 INFO L87 Difference]: Start difference. First operand 35929 states and 42477 transitions. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:58,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:41:58,102 INFO L93 Difference]: Finished difference Result 70919 states and 83954 transitions. [2024-10-13 23:41:58,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:41:58,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 225 [2024-10-13 23:41:58,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:41:58,145 INFO L225 Difference]: With dead ends: 70919 [2024-10-13 23:41:58,145 INFO L226 Difference]: Without dead ends: 35778 [2024-10-13 23:41:58,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:41:58,169 INFO L432 NwaCegarLoop]: 1502 mSDtfsCounter, 1036 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 2351 mSolverCounterSat, 602 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1036 SdHoareTripleChecker+Valid, 1638 SdHoareTripleChecker+Invalid, 2953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 602 IncrementalHoareTripleChecker+Valid, 2351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:41:58,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1036 Valid, 1638 Invalid, 2953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [602 Valid, 2351 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-13 23:41:58,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35778 states. [2024-10-13 23:41:58,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35778 to 34200. [2024-10-13 23:41:58,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34200 states, 34199 states have (on average 1.129594432585748) internal successors, (38631), 34199 states have internal predecessors, (38631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:58,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34200 states to 34200 states and 38631 transitions. [2024-10-13 23:41:58,710 INFO L78 Accepts]: Start accepts. Automaton has 34200 states and 38631 transitions. Word has length 225 [2024-10-13 23:41:58,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:41:58,710 INFO L471 AbstractCegarLoop]: Abstraction has 34200 states and 38631 transitions. [2024-10-13 23:41:58,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:58,711 INFO L276 IsEmpty]: Start isEmpty. Operand 34200 states and 38631 transitions. [2024-10-13 23:41:58,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-10-13 23:41:58,715 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:41:58,715 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:41:58,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 23:41:58,716 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:41:58,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:41:58,716 INFO L85 PathProgramCache]: Analyzing trace with hash 173197257, now seen corresponding path program 1 times [2024-10-13 23:41:58,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:41:58,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274304317] [2024-10-13 23:41:58,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:41:58,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:41:58,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:41:59,390 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-10-13 23:41:59,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:41:59,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274304317] [2024-10-13 23:41:59,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274304317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:41:59,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:41:59,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:41:59,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034735911] [2024-10-13 23:41:59,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:41:59,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:41:59,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:41:59,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:41:59,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:41:59,393 INFO L87 Difference]: Start difference. First operand 34200 states and 38631 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:04,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:04,620 INFO L93 Difference]: Finished difference Result 109365 states and 124638 transitions. [2024-10-13 23:42:04,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:42:04,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 299 [2024-10-13 23:42:04,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:04,704 INFO L225 Difference]: With dead ends: 109365 [2024-10-13 23:42:04,705 INFO L226 Difference]: Without dead ends: 75953 [2024-10-13 23:42:04,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:42:04,732 INFO L432 NwaCegarLoop]: 574 mSDtfsCounter, 1658 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 5326 mSolverCounterSat, 872 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1658 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 6198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 872 IncrementalHoareTripleChecker+Valid, 5326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:04,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1658 Valid, 885 Invalid, 6198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [872 Valid, 5326 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-10-13 23:42:04,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75953 states. [2024-10-13 23:42:05,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75953 to 72801. [2024-10-13 23:42:05,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72801 states, 72800 states have (on average 1.1204258241758243) internal successors, (81567), 72800 states have internal predecessors, (81567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:05,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72801 states to 72801 states and 81567 transitions. [2024-10-13 23:42:05,741 INFO L78 Accepts]: Start accepts. Automaton has 72801 states and 81567 transitions. Word has length 299 [2024-10-13 23:42:05,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:05,742 INFO L471 AbstractCegarLoop]: Abstraction has 72801 states and 81567 transitions. [2024-10-13 23:42:05,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:05,742 INFO L276 IsEmpty]: Start isEmpty. Operand 72801 states and 81567 transitions. [2024-10-13 23:42:05,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-10-13 23:42:05,746 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:05,746 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:42:05,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 23:42:05,747 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:05,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:05,747 INFO L85 PathProgramCache]: Analyzing trace with hash -416765883, now seen corresponding path program 1 times [2024-10-13 23:42:05,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:05,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491395903] [2024-10-13 23:42:05,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:05,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:05,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:06,164 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 295 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-13 23:42:06,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:06,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491395903] [2024-10-13 23:42:06,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491395903] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:06,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:42:06,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:42:06,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420528818] [2024-10-13 23:42:06,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:06,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:42:06,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:06,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:42:06,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:42:06,168 INFO L87 Difference]: Start difference. First operand 72801 states and 81567 transitions. Second operand has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:12,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:12,693 INFO L93 Difference]: Finished difference Result 202478 states and 227409 transitions. [2024-10-13 23:42:12,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:42:12,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 299 [2024-10-13 23:42:12,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:12,861 INFO L225 Difference]: With dead ends: 202478 [2024-10-13 23:42:12,861 INFO L226 Difference]: Without dead ends: 130465 [2024-10-13 23:42:12,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:42:12,901 INFO L432 NwaCegarLoop]: 540 mSDtfsCounter, 1725 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 5972 mSolverCounterSat, 1113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1725 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 7085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1113 IncrementalHoareTripleChecker+Valid, 5972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:12,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1725 Valid, 728 Invalid, 7085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1113 Valid, 5972 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2024-10-13 23:42:13,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130465 states. [2024-10-13 23:42:14,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130465 to 128761. [2024-10-13 23:42:14,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128761 states, 128760 states have (on average 1.113443616029823) internal successors, (143367), 128760 states have internal predecessors, (143367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:14,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128761 states to 128761 states and 143367 transitions. [2024-10-13 23:42:14,945 INFO L78 Accepts]: Start accepts. Automaton has 128761 states and 143367 transitions. Word has length 299 [2024-10-13 23:42:14,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:14,945 INFO L471 AbstractCegarLoop]: Abstraction has 128761 states and 143367 transitions. [2024-10-13 23:42:14,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:14,946 INFO L276 IsEmpty]: Start isEmpty. Operand 128761 states and 143367 transitions. [2024-10-13 23:42:14,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2024-10-13 23:42:14,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:14,950 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:42:14,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 23:42:14,951 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:14,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:14,951 INFO L85 PathProgramCache]: Analyzing trace with hash -119783286, now seen corresponding path program 1 times [2024-10-13 23:42:14,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:14,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585734198] [2024-10-13 23:42:14,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:14,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:15,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:15,526 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-10-13 23:42:15,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:15,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585734198] [2024-10-13 23:42:15,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585734198] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:15,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:42:15,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:42:15,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367047580] [2024-10-13 23:42:15,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:15,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:42:15,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:15,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:42:15,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:42:15,529 INFO L87 Difference]: Start difference. First operand 128761 states and 143367 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:18,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:18,931 INFO L93 Difference]: Finished difference Result 243357 states and 271905 transitions. [2024-10-13 23:42:18,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:42:18,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 308 [2024-10-13 23:42:18,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:19,101 INFO L225 Difference]: With dead ends: 243357 [2024-10-13 23:42:19,101 INFO L226 Difference]: Without dead ends: 127986 [2024-10-13 23:42:19,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:42:19,146 INFO L432 NwaCegarLoop]: 998 mSDtfsCounter, 728 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 2689 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 2693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:19,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 1174 Invalid, 2693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2689 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-13 23:42:19,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127986 states. [2024-10-13 23:42:20,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127986 to 127187. [2024-10-13 23:42:21,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127187 states, 127186 states have (on average 1.1140534335540075) internal successors, (141692), 127186 states have internal predecessors, (141692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:21,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127187 states to 127187 states and 141692 transitions. [2024-10-13 23:42:21,185 INFO L78 Accepts]: Start accepts. Automaton has 127187 states and 141692 transitions. Word has length 308 [2024-10-13 23:42:21,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:21,186 INFO L471 AbstractCegarLoop]: Abstraction has 127187 states and 141692 transitions. [2024-10-13 23:42:21,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:21,186 INFO L276 IsEmpty]: Start isEmpty. Operand 127187 states and 141692 transitions. [2024-10-13 23:42:21,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2024-10-13 23:42:21,189 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:21,189 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:42:21,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 23:42:21,190 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:21,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:21,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1680969746, now seen corresponding path program 1 times [2024-10-13 23:42:21,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:21,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208792511] [2024-10-13 23:42:21,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:21,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:23,014 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 188 proven. 113 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-13 23:42:23,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:23,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208792511] [2024-10-13 23:42:23,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208792511] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:42:23,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100822074] [2024-10-13 23:42:23,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:23,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:42:23,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:42:23,018 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:42:23,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 23:42:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:23,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:42:23,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:42:23,348 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2024-10-13 23:42:23,349 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:42:23,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100822074] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:23,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:42:23,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-13 23:42:23,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395629899] [2024-10-13 23:42:23,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:23,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:42:23,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:23,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:42:23,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-13 23:42:23,352 INFO L87 Difference]: Start difference. First operand 127187 states and 141692 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:26,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:26,733 INFO L93 Difference]: Finished difference Result 253585 states and 282591 transitions. [2024-10-13 23:42:26,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:42:26,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 337 [2024-10-13 23:42:26,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:26,892 INFO L225 Difference]: With dead ends: 253585 [2024-10-13 23:42:26,892 INFO L226 Difference]: Without dead ends: 127186 [2024-10-13 23:42:26,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-13 23:42:26,959 INFO L432 NwaCegarLoop]: 1340 mSDtfsCounter, 1113 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 2463 mSolverCounterSat, 443 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 1418 SdHoareTripleChecker+Invalid, 2906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 443 IncrementalHoareTripleChecker+Valid, 2463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:26,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 1418 Invalid, 2906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [443 Valid, 2463 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-13 23:42:27,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127186 states. [2024-10-13 23:42:28,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127186 to 127184. [2024-10-13 23:42:28,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127184 states, 127183 states have (on average 1.0854516720001888) internal successors, (138051), 127183 states have internal predecessors, (138051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:28,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127184 states to 127184 states and 138051 transitions. [2024-10-13 23:42:28,574 INFO L78 Accepts]: Start accepts. Automaton has 127184 states and 138051 transitions. Word has length 337 [2024-10-13 23:42:28,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:28,575 INFO L471 AbstractCegarLoop]: Abstraction has 127184 states and 138051 transitions. [2024-10-13 23:42:28,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:28,575 INFO L276 IsEmpty]: Start isEmpty. Operand 127184 states and 138051 transitions. [2024-10-13 23:42:28,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2024-10-13 23:42:28,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:28,582 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:42:28,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 23:42:28,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-13 23:42:28,782 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:28,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:28,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1223411125, now seen corresponding path program 1 times [2024-10-13 23:42:28,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:28,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330056442] [2024-10-13 23:42:28,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:28,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:28,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:29,484 INFO L134 CoverageAnalysis]: Checked inductivity of 538 backedges. 266 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-10-13 23:42:29,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:29,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330056442] [2024-10-13 23:42:29,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330056442] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:29,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:42:29,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:42:29,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100850549] [2024-10-13 23:42:29,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:29,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:42:29,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:29,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:42:29,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:42:29,486 INFO L87 Difference]: Start difference. First operand 127184 states and 138051 transitions. Second operand has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)