./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/Problem12_label44.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label44.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 4590079a5f8946ec9488ef76281079c2cb860e2f88ad1b21eefdd23ad59a57f9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:24:29,771 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:24:29,848 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:24:29,854 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:24:29,855 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:24:29,884 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:24:29,885 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:24:29,885 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:24:29,886 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:24:29,898 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:24:29,898 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:24:29,899 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:24:29,899 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:24:29,900 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:24:29,900 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:24:29,900 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:24:29,901 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:24:29,901 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:24:29,901 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:24:29,902 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:24:29,902 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:24:29,904 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:24:29,904 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:24:29,904 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:24:29,904 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:24:29,905 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:24:29,905 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:24:29,905 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:24:29,906 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:24:29,906 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:24:29,906 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:24:29,907 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:24:29,907 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:24:29,907 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:24:29,908 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:24:29,908 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:24:29,908 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:24:29,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:24:29,909 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:24:29,909 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:24:29,909 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:24:29,910 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:24:29,910 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-clean/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-clean/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 -> 4590079a5f8946ec9488ef76281079c2cb860e2f88ad1b21eefdd23ad59a57f9 [2024-10-10 23:24:30,155 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:24:30,181 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:24:30,184 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:24:30,186 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:24:30,186 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:24:30,187 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label44.c [2024-10-10 23:24:31,606 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:24:32,053 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:24:32,054 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label44.c [2024-10-10 23:24:32,087 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/27d53c2bd/ed27166d504e4bf09ca5f85b02c8ae9c/FLAG84dc86ad4 [2024-10-10 23:24:32,177 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/27d53c2bd/ed27166d504e4bf09ca5f85b02c8ae9c [2024-10-10 23:24:32,180 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:24:32,182 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:24:32,184 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:24:32,184 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:24:32,190 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:24:32,191 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:24:32" (1/1) ... [2024-10-10 23:24:32,192 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a9ec481 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:24:32, skipping insertion in model container [2024-10-10 23:24:32,193 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:24:32" (1/1) ... [2024-10-10 23:24:32,316 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:24:32,595 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/Problem12_label44.c[6250,6263] [2024-10-10 23:24:33,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:24:33,517 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:24:33,542 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/Problem12_label44.c[6250,6263] [2024-10-10 23:24:33,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:24:33,947 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:24:33,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:24:33 WrapperNode [2024-10-10 23:24:33,948 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:24:33,949 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:24:33,949 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:24:33,949 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:24:33,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:24:33" (1/1) ... [2024-10-10 23:24:34,029 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:24:33" (1/1) ... [2024-10-10 23:24:34,386 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4761 [2024-10-10 23:24:34,387 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:24:34,389 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:24:34,389 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:24:34,389 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:24:34,399 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:24:33" (1/1) ... [2024-10-10 23:24:34,400 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:24:33" (1/1) ... [2024-10-10 23:24:34,450 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:24:33" (1/1) ... [2024-10-10 23:24:34,651 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-10 23:24:34,651 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:24:33" (1/1) ... [2024-10-10 23:24:34,651 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:24:33" (1/1) ... [2024-10-10 23:24:34,787 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:24:33" (1/1) ... [2024-10-10 23:24:34,809 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:24:33" (1/1) ... [2024-10-10 23:24:34,836 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:24:33" (1/1) ... [2024-10-10 23:24:34,853 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:24:33" (1/1) ... [2024-10-10 23:24:35,005 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:24:35,011 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:24:35,011 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:24:35,011 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:24:35,012 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:24:33" (1/1) ... [2024-10-10 23:24:35,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:24:35,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:24:35,071 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:24:35,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:24:35,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:24:35,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:24:35,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:24:35,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:24:35,286 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:24:35,288 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:24:39,441 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2024-10-10 23:24:39,442 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:24:39,541 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:24:39,542 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:24:39,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:24:39 BoogieIcfgContainer [2024-10-10 23:24:39,543 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:24:39,544 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:24:39,545 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:24:39,548 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:24:39,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:24:32" (1/3) ... [2024-10-10 23:24:39,548 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4313509a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:24:39, skipping insertion in model container [2024-10-10 23:24:39,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:24:33" (2/3) ... [2024-10-10 23:24:39,549 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4313509a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:24:39, skipping insertion in model container [2024-10-10 23:24:39,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:24:39" (3/3) ... [2024-10-10 23:24:39,550 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label44.c [2024-10-10 23:24:39,566 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:24:39,567 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:24:39,663 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:24:39,670 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;@289bc71d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:24:39,671 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:24:39,682 INFO L276 IsEmpty]: Start isEmpty. Operand has 756 states, 754 states have (on average 1.993368700265252) internal successors, (1503), 755 states have internal predecessors, (1503), 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-10 23:24:39,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-10 23:24:39,697 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:24:39,699 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:24:39,700 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:24:39,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:24:39,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1252887199, now seen corresponding path program 1 times [2024-10-10 23:24:39,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:24:39,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77347696] [2024-10-10 23:24:39,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:24:39,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:24:39,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:24:39,929 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-10 23:24:39,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:24:39,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77347696] [2024-10-10 23:24:39,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77347696] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:24:39,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:24:39,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:24:39,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800586749] [2024-10-10 23:24:39,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:24:39,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:24:39,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:24:39,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:24:39,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:24:39,967 INFO L87 Difference]: Start difference. First operand has 756 states, 754 states have (on average 1.993368700265252) internal successors, (1503), 755 states have internal predecessors, (1503), 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 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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-10 23:24:40,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:24:40,059 INFO L93 Difference]: Finished difference Result 1511 states and 3005 transitions. [2024-10-10 23:24:40,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:24:40,062 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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 49 [2024-10-10 23:24:40,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:24:40,087 INFO L225 Difference]: With dead ends: 1511 [2024-10-10 23:24:40,087 INFO L226 Difference]: Without dead ends: 754 [2024-10-10 23:24:40,094 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-10 23:24:40,097 INFO L432 NwaCegarLoop]: 1438 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, 1438 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-10 23:24:40,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1438 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:24:40,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2024-10-10 23:24:40,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2024-10-10 23:24:40,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 753 states have (on average 1.9096945551128819) internal successors, (1438), 753 states have internal predecessors, (1438), 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-10 23:24:40,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1438 transitions. [2024-10-10 23:24:40,191 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1438 transitions. Word has length 49 [2024-10-10 23:24:40,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:24:40,192 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1438 transitions. [2024-10-10 23:24:40,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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-10 23:24:40,193 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1438 transitions. [2024-10-10 23:24:40,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-10 23:24:40,194 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:24:40,194 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:24:40,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:24:40,194 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:24:40,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:24:40,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1096341895, now seen corresponding path program 1 times [2024-10-10 23:24:40,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:24:40,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935890871] [2024-10-10 23:24:40,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:24:40,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:24:40,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:24:40,392 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-10 23:24:40,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:24:40,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935890871] [2024-10-10 23:24:40,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935890871] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:24:40,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:24:40,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:24:40,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015038946] [2024-10-10 23:24:40,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:24:40,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:24:40,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:24:40,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:24:40,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:24:40,396 INFO L87 Difference]: Start difference. First operand 754 states and 1438 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 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-10 23:24:43,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:24:43,607 INFO L93 Difference]: Finished difference Result 2258 states and 4311 transitions. [2024-10-10 23:24:43,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:24:43,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 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 49 [2024-10-10 23:24:43,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:24:43,615 INFO L225 Difference]: With dead ends: 2258 [2024-10-10 23:24:43,616 INFO L226 Difference]: Without dead ends: 1505 [2024-10-10 23:24:43,617 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-10 23:24:43,618 INFO L432 NwaCegarLoop]: 419 mSDtfsCounter, 768 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2275 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 2866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:24:43,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 426 Invalid, 2866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2275 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-10 23:24:43,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2024-10-10 23:24:43,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1505. [2024-10-10 23:24:43,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1504 states have (on average 1.6389627659574468) internal successors, (2465), 1504 states have internal predecessors, (2465), 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-10 23:24:43,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 2465 transitions. [2024-10-10 23:24:43,656 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 2465 transitions. Word has length 49 [2024-10-10 23:24:43,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:24:43,656 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 2465 transitions. [2024-10-10 23:24:43,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 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-10 23:24:43,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 2465 transitions. [2024-10-10 23:24:43,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-10 23:24:43,660 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:24:43,660 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 23:24:43,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:24:43,661 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:24:43,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:24:43,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1802998582, now seen corresponding path program 1 times [2024-10-10 23:24:43,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:24:43,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911553254] [2024-10-10 23:24:43,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:24:43,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:24:43,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:24:44,102 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:24:44,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:24:44,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911553254] [2024-10-10 23:24:44,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911553254] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:24:44,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:24:44,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:24:44,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048220805] [2024-10-10 23:24:44,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:24:44,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:24:44,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:24:44,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:24:44,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:24:44,109 INFO L87 Difference]: Start difference. First operand 1505 states and 2465 transitions. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 3 states have internal predecessors, (120), 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-10 23:24:48,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:24:48,006 INFO L93 Difference]: Finished difference Result 4548 states and 7429 transitions. [2024-10-10 23:24:48,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:24:48,006 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 3 states have internal predecessors, (120), 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 120 [2024-10-10 23:24:48,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:24:48,018 INFO L225 Difference]: With dead ends: 4548 [2024-10-10 23:24:48,018 INFO L226 Difference]: Without dead ends: 3007 [2024-10-10 23:24:48,021 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-10 23:24:48,022 INFO L432 NwaCegarLoop]: 636 mSDtfsCounter, 703 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 3075 mSolverCounterSat, 729 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 3804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 729 IncrementalHoareTripleChecker+Valid, 3075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:24:48,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 649 Invalid, 3804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [729 Valid, 3075 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-10 23:24:48,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3007 states. [2024-10-10 23:24:48,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3007 to 3007. [2024-10-10 23:24:48,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3007 states, 3006 states have (on average 1.3416500332667998) internal successors, (4033), 3006 states have internal predecessors, (4033), 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-10 23:24:48,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3007 states to 3007 states and 4033 transitions. [2024-10-10 23:24:48,084 INFO L78 Accepts]: Start accepts. Automaton has 3007 states and 4033 transitions. Word has length 120 [2024-10-10 23:24:48,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:24:48,084 INFO L471 AbstractCegarLoop]: Abstraction has 3007 states and 4033 transitions. [2024-10-10 23:24:48,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 3 states have internal predecessors, (120), 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-10 23:24:48,085 INFO L276 IsEmpty]: Start isEmpty. Operand 3007 states and 4033 transitions. [2024-10-10 23:24:48,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-10 23:24:48,087 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:24:48,088 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 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-10 23:24:48,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:24:48,088 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:24:48,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:24:48,089 INFO L85 PathProgramCache]: Analyzing trace with hash -782506773, now seen corresponding path program 1 times [2024-10-10 23:24:48,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:24:48,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538830050] [2024-10-10 23:24:48,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:24:48,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:24:48,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:24:48,459 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:24:48,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:24:48,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538830050] [2024-10-10 23:24:48,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538830050] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:24:48,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:24:48,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:24:48,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626456614] [2024-10-10 23:24:48,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:24:48,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:24:48,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:24:48,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:24:48,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:24:48,463 INFO L87 Difference]: Start difference. First operand 3007 states and 4033 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 3 states have internal predecessors, (158), 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-10 23:24:52,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:24:52,383 INFO L93 Difference]: Finished difference Result 9768 states and 12891 transitions. [2024-10-10 23:24:52,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:24:52,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 3 states have internal predecessors, (158), 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 158 [2024-10-10 23:24:52,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:24:52,408 INFO L225 Difference]: With dead ends: 9768 [2024-10-10 23:24:52,408 INFO L226 Difference]: Without dead ends: 6762 [2024-10-10 23:24:52,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:24:52,419 INFO L432 NwaCegarLoop]: 435 mSDtfsCounter, 2092 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 4274 mSolverCounterSat, 567 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2092 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 4841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 567 IncrementalHoareTripleChecker+Valid, 4274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:24:52,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2092 Valid, 450 Invalid, 4841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [567 Valid, 4274 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-10 23:24:52,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6762 states. [2024-10-10 23:24:52,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6762 to 6762. [2024-10-10 23:24:52,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6762 states, 6761 states have (on average 1.2873835231474633) internal successors, (8704), 6761 states have internal predecessors, (8704), 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-10 23:24:52,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6762 states to 6762 states and 8704 transitions. [2024-10-10 23:24:52,587 INFO L78 Accepts]: Start accepts. Automaton has 6762 states and 8704 transitions. Word has length 158 [2024-10-10 23:24:52,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:24:52,588 INFO L471 AbstractCegarLoop]: Abstraction has 6762 states and 8704 transitions. [2024-10-10 23:24:52,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 3 states have internal predecessors, (158), 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-10 23:24:52,589 INFO L276 IsEmpty]: Start isEmpty. Operand 6762 states and 8704 transitions. [2024-10-10 23:24:52,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-10-10 23:24:52,595 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:24:52,595 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:24:52,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:24:52,596 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:24:52,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:24:52,596 INFO L85 PathProgramCache]: Analyzing trace with hash -576013208, now seen corresponding path program 1 times [2024-10-10 23:24:52,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:24:52,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348058971] [2024-10-10 23:24:52,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:24:52,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:24:52,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:24:53,024 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-10 23:24:53,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:24:53,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348058971] [2024-10-10 23:24:53,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348058971] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:24:53,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:24:53,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:24:53,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158250930] [2024-10-10 23:24:53,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:24:53,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:24:53,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:24:53,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:24:53,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:24:53,030 INFO L87 Difference]: Start difference. First operand 6762 states and 8704 transitions. Second operand has 4 states, 4 states have (on average 48.0) internal successors, (192), 3 states have internal predecessors, (192), 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-10 23:24:56,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:24:56,284 INFO L93 Difference]: Finished difference Result 15815 states and 21392 transitions. [2024-10-10 23:24:56,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:24:56,285 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 48.0) internal successors, (192), 3 states have internal predecessors, (192), 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 261 [2024-10-10 23:24:56,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:24:56,315 INFO L225 Difference]: With dead ends: 15815 [2024-10-10 23:24:56,316 INFO L226 Difference]: Without dead ends: 9768 [2024-10-10 23:24:56,324 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-10 23:24:56,325 INFO L432 NwaCegarLoop]: 475 mSDtfsCounter, 850 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3466 mSolverCounterSat, 553 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 4019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 553 IncrementalHoareTripleChecker+Valid, 3466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:24:56,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 489 Invalid, 4019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [553 Valid, 3466 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-10 23:24:56,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9768 states. [2024-10-10 23:24:56,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9768 to 9766. [2024-10-10 23:24:56,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9766 states, 9765 states have (on average 1.273015873015873) internal successors, (12431), 9765 states have internal predecessors, (12431), 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-10 23:24:56,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9766 states to 9766 states and 12431 transitions. [2024-10-10 23:24:56,482 INFO L78 Accepts]: Start accepts. Automaton has 9766 states and 12431 transitions. Word has length 261 [2024-10-10 23:24:56,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:24:56,483 INFO L471 AbstractCegarLoop]: Abstraction has 9766 states and 12431 transitions. [2024-10-10 23:24:56,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.0) internal successors, (192), 3 states have internal predecessors, (192), 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-10 23:24:56,484 INFO L276 IsEmpty]: Start isEmpty. Operand 9766 states and 12431 transitions. [2024-10-10 23:24:56,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2024-10-10 23:24:56,487 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:24:56,488 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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-10 23:24:56,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:24:56,488 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:24:56,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:24:56,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1963518705, now seen corresponding path program 1 times [2024-10-10 23:24:56,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:24:56,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586561477] [2024-10-10 23:24:56,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:24:56,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:24:56,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:24:57,150 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 41 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:24:57,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:24:57,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586561477] [2024-10-10 23:24:57,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586561477] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:24:57,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147600325] [2024-10-10 23:24:57,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:24:57,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:24:57,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:24:57,156 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:24:57,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:24:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:24:57,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:24:57,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:24:57,518 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-10 23:24:57,520 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:24:57,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147600325] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:24:57,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:24:57,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-10-10 23:24:57,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316809100] [2024-10-10 23:24:57,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:24:57,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:24:57,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:24:57,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:24:57,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-10 23:24:57,525 INFO L87 Difference]: Start difference. First operand 9766 states and 12431 transitions. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 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-10 23:25:00,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:25:00,176 INFO L93 Difference]: Finished difference Result 26290 states and 34150 transitions. [2024-10-10 23:25:00,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:25:00,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 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 279 [2024-10-10 23:25:00,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:25:00,218 INFO L225 Difference]: With dead ends: 26290 [2024-10-10 23:25:00,218 INFO L226 Difference]: Without dead ends: 17276 [2024-10-10 23:25:00,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-10 23:25:00,232 INFO L432 NwaCegarLoop]: 1085 mSDtfsCounter, 741 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2356 mSolverCounterSat, 547 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 2903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 547 IncrementalHoareTripleChecker+Valid, 2356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:25:00,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 1092 Invalid, 2903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [547 Valid, 2356 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-10 23:25:00,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17276 states. [2024-10-10 23:25:00,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17276 to 17276. [2024-10-10 23:25:00,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17276 states, 17275 states have (on average 1.2610130246020261) internal successors, (21784), 17275 states have internal predecessors, (21784), 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-10 23:25:00,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17276 states to 17276 states and 21784 transitions. [2024-10-10 23:25:00,501 INFO L78 Accepts]: Start accepts. Automaton has 17276 states and 21784 transitions. Word has length 279 [2024-10-10 23:25:00,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:25:00,503 INFO L471 AbstractCegarLoop]: Abstraction has 17276 states and 21784 transitions. [2024-10-10 23:25:00,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 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-10 23:25:00,504 INFO L276 IsEmpty]: Start isEmpty. Operand 17276 states and 21784 transitions. [2024-10-10 23:25:00,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-10-10 23:25:00,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:25:00,508 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:25:00,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-10 23:25:00,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:25:00,713 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:25:00,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:25:00,713 INFO L85 PathProgramCache]: Analyzing trace with hash 900132401, now seen corresponding path program 1 times [2024-10-10 23:25:00,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:25:00,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219433583] [2024-10-10 23:25:00,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:25:00,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:25:00,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:25:01,039 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-10-10 23:25:01,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:25:01,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219433583] [2024-10-10 23:25:01,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219433583] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:25:01,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:25:01,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:25:01,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526740336] [2024-10-10 23:25:01,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:25:01,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:25:01,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:25:01,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:25:01,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:25:01,043 INFO L87 Difference]: Start difference. First operand 17276 states and 21784 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 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-10 23:25:03,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:25:03,705 INFO L93 Difference]: Finished difference Result 33800 states and 42811 transitions. [2024-10-10 23:25:03,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:25:03,706 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 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 283 [2024-10-10 23:25:03,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:25:03,742 INFO L225 Difference]: With dead ends: 33800 [2024-10-10 23:25:03,743 INFO L226 Difference]: Without dead ends: 17276 [2024-10-10 23:25:03,761 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-10 23:25:03,762 INFO L432 NwaCegarLoop]: 423 mSDtfsCounter, 694 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1970 mSolverCounterSat, 703 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 2673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 703 IncrementalHoareTripleChecker+Valid, 1970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:25:03,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 429 Invalid, 2673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [703 Valid, 1970 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-10 23:25:03,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17276 states. [2024-10-10 23:25:03,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17276 to 15774. [2024-10-10 23:25:03,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15774 states, 15773 states have (on average 1.1705446015342673) internal successors, (18463), 15773 states have internal predecessors, (18463), 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-10 23:25:03,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15774 states to 15774 states and 18463 transitions. [2024-10-10 23:25:03,986 INFO L78 Accepts]: Start accepts. Automaton has 15774 states and 18463 transitions. Word has length 283 [2024-10-10 23:25:03,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:25:03,987 INFO L471 AbstractCegarLoop]: Abstraction has 15774 states and 18463 transitions. [2024-10-10 23:25:03,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 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-10 23:25:03,988 INFO L276 IsEmpty]: Start isEmpty. Operand 15774 states and 18463 transitions. [2024-10-10 23:25:03,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2024-10-10 23:25:03,993 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:25:03,993 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:25:03,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:25:03,994 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:25:03,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:25:03,994 INFO L85 PathProgramCache]: Analyzing trace with hash 315997464, now seen corresponding path program 1 times [2024-10-10 23:25:03,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:25:03,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073922626] [2024-10-10 23:25:03,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:25:03,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:25:04,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:25:04,287 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-10-10 23:25:04,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:25:04,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073922626] [2024-10-10 23:25:04,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073922626] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:25:04,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:25:04,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:25:04,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572407916] [2024-10-10 23:25:04,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:25:04,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:25:04,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:25:04,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:25:04,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:25:04,290 INFO L87 Difference]: Start difference. First operand 15774 states and 18463 transitions. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 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-10 23:25:06,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:25:06,715 INFO L93 Difference]: Finished difference Result 38306 states and 45532 transitions. [2024-10-10 23:25:06,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:25:06,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 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 362 [2024-10-10 23:25:06,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:25:06,753 INFO L225 Difference]: With dead ends: 38306 [2024-10-10 23:25:06,753 INFO L226 Difference]: Without dead ends: 23284 [2024-10-10 23:25:06,772 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-10 23:25:06,773 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 764 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2068 mSolverCounterSat, 719 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 764 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 2787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 719 IncrementalHoareTripleChecker+Valid, 2068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:25:06,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [764 Valid, 233 Invalid, 2787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [719 Valid, 2068 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-10 23:25:06,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23284 states. [2024-10-10 23:25:06,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23284 to 22533. [2024-10-10 23:25:07,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22533 states, 22532 states have (on average 1.1530711876442392) internal successors, (25981), 22532 states have internal predecessors, (25981), 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-10 23:25:07,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22533 states to 22533 states and 25981 transitions. [2024-10-10 23:25:07,061 INFO L78 Accepts]: Start accepts. Automaton has 22533 states and 25981 transitions. Word has length 362 [2024-10-10 23:25:07,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:25:07,062 INFO L471 AbstractCegarLoop]: Abstraction has 22533 states and 25981 transitions. [2024-10-10 23:25:07,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 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-10 23:25:07,062 INFO L276 IsEmpty]: Start isEmpty. Operand 22533 states and 25981 transitions. [2024-10-10 23:25:07,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2024-10-10 23:25:07,068 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:25:07,070 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:25:07,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:25:07,070 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:25:07,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:25:07,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1334372574, now seen corresponding path program 1 times [2024-10-10 23:25:07,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:25:07,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213401202] [2024-10-10 23:25:07,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:25:07,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:25:07,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:25:07,407 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-10 23:25:07,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:25:07,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213401202] [2024-10-10 23:25:07,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213401202] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:25:07,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:25:07,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:25:07,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679969393] [2024-10-10 23:25:07,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:25:07,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:25:07,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:25:07,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:25:07,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:25:07,410 INFO L87 Difference]: Start difference. First operand 22533 states and 25981 transitions. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 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-10 23:25:09,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:25:09,581 INFO L93 Difference]: Finished difference Result 49571 states and 57146 transitions. [2024-10-10 23:25:09,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:25:09,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 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 377 [2024-10-10 23:25:09,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:25:09,624 INFO L225 Difference]: With dead ends: 49571 [2024-10-10 23:25:09,624 INFO L226 Difference]: Without dead ends: 25537 [2024-10-10 23:25:09,648 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-10 23:25:09,650 INFO L432 NwaCegarLoop]: 1335 mSDtfsCounter, 724 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1971 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 1342 SdHoareTripleChecker+Invalid, 2355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 1971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:25:09,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 1342 Invalid, 2355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 1971 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-10 23:25:09,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25537 states. [2024-10-10 23:25:09,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25537 to 24786. [2024-10-10 23:25:09,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24786 states, 24785 states have (on average 1.138148073431511) internal successors, (28209), 24785 states have internal predecessors, (28209), 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-10 23:25:10,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24786 states to 24786 states and 28209 transitions. [2024-10-10 23:25:10,177 INFO L78 Accepts]: Start accepts. Automaton has 24786 states and 28209 transitions. Word has length 377 [2024-10-10 23:25:10,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:25:10,182 INFO L471 AbstractCegarLoop]: Abstraction has 24786 states and 28209 transitions. [2024-10-10 23:25:10,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 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-10 23:25:10,182 INFO L276 IsEmpty]: Start isEmpty. Operand 24786 states and 28209 transitions. [2024-10-10 23:25:10,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2024-10-10 23:25:10,202 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:25:10,203 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:25:10,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:25:10,203 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:25:10,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:25:10,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1097691755, now seen corresponding path program 1 times [2024-10-10 23:25:10,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:25:10,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320442260] [2024-10-10 23:25:10,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:25:10,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:25:10,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:25:10,905 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 392 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-10 23:25:10,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:25:10,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320442260] [2024-10-10 23:25:10,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320442260] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:25:10,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:25:10,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:25:10,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788119424] [2024-10-10 23:25:10,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:25:10,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:25:10,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:25:10,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:25:10,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:25:10,910 INFO L87 Difference]: Start difference. First operand 24786 states and 28209 transitions. Second operand has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 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-10 23:25:13,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:25:13,692 INFO L93 Difference]: Finished difference Result 67595 states and 77602 transitions. [2024-10-10 23:25:13,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:25:13,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 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 463 [2024-10-10 23:25:13,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:25:13,734 INFO L225 Difference]: With dead ends: 67595 [2024-10-10 23:25:13,735 INFO L226 Difference]: Without dead ends: 43561 [2024-10-10 23:25:13,754 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-10 23:25:13,755 INFO L432 NwaCegarLoop]: 513 mSDtfsCounter, 710 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2286 mSolverCounterSat, 564 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 2850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 564 IncrementalHoareTripleChecker+Valid, 2286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:25:13,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 520 Invalid, 2850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [564 Valid, 2286 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-10 23:25:13,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43561 states. [2024-10-10 23:25:14,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43561 to 42059. [2024-10-10 23:25:14,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42059 states, 42058 states have (on average 1.1252555994103381) internal successors, (47326), 42058 states have internal predecessors, (47326), 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-10 23:25:14,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42059 states to 42059 states and 47326 transitions. [2024-10-10 23:25:14,315 INFO L78 Accepts]: Start accepts. Automaton has 42059 states and 47326 transitions. Word has length 463 [2024-10-10 23:25:14,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:25:14,318 INFO L471 AbstractCegarLoop]: Abstraction has 42059 states and 47326 transitions. [2024-10-10 23:25:14,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 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-10 23:25:14,318 INFO L276 IsEmpty]: Start isEmpty. Operand 42059 states and 47326 transitions. [2024-10-10 23:25:14,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2024-10-10 23:25:14,334 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:25:14,334 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:25:14,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:25:14,335 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:25:14,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:25:14,335 INFO L85 PathProgramCache]: Analyzing trace with hash 402066997, now seen corresponding path program 1 times [2024-10-10 23:25:14,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:25:14,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244127629] [2024-10-10 23:25:14,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:25:14,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:25:14,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:25:15,091 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 396 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-10 23:25:15,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:25:15,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244127629] [2024-10-10 23:25:15,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244127629] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:25:15,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:25:15,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:25:15,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931535317] [2024-10-10 23:25:15,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:25:15,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:25:15,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:25:15,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:25:15,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:25:15,095 INFO L87 Difference]: Start difference. First operand 42059 states and 47326 transitions. Second operand has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 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-10 23:25:17,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:25:17,952 INFO L93 Difference]: Finished difference Result 100641 states and 114228 transitions. [2024-10-10 23:25:17,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:25:17,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 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 467 [2024-10-10 23:25:17,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:25:18,018 INFO L225 Difference]: With dead ends: 100641 [2024-10-10 23:25:18,018 INFO L226 Difference]: Without dead ends: 59334 [2024-10-10 23:25:18,054 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-10 23:25:18,055 INFO L432 NwaCegarLoop]: 1258 mSDtfsCounter, 698 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 2775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 466 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:25:18,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 1265 Invalid, 2775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [466 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-10 23:25:18,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59334 states. [2024-10-10 23:25:18,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59334 to 55577. [2024-10-10 23:25:18,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55577 states, 55576 states have (on average 1.1114149992802649) internal successors, (61768), 55576 states have internal predecessors, (61768), 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-10 23:25:18,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55577 states to 55577 states and 61768 transitions. [2024-10-10 23:25:18,923 INFO L78 Accepts]: Start accepts. Automaton has 55577 states and 61768 transitions. Word has length 467 [2024-10-10 23:25:18,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:25:18,923 INFO L471 AbstractCegarLoop]: Abstraction has 55577 states and 61768 transitions. [2024-10-10 23:25:18,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 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-10 23:25:18,924 INFO L276 IsEmpty]: Start isEmpty. Operand 55577 states and 61768 transitions. [2024-10-10 23:25:18,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2024-10-10 23:25:18,934 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:25:18,935 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:25:18,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:25:18,935 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:25:18,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:25:18,936 INFO L85 PathProgramCache]: Analyzing trace with hash -725188935, now seen corresponding path program 1 times [2024-10-10 23:25:18,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:25:18,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393009817] [2024-10-10 23:25:18,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:25:18,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:25:19,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:25:19,475 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 382 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-10-10 23:25:19,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:25:19,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393009817] [2024-10-10 23:25:19,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393009817] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:25:19,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:25:19,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:25:19,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549226437] [2024-10-10 23:25:19,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:25:19,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:25:19,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:25:19,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:25:19,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:25:19,482 INFO L87 Difference]: Start difference. First operand 55577 states and 61768 transitions. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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-10 23:25:22,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:25:22,337 INFO L93 Difference]: Finished difference Result 141944 states and 157368 transitions. [2024-10-10 23:25:22,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:25:22,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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 483 [2024-10-10 23:25:22,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:25:22,434 INFO L225 Difference]: With dead ends: 141944 [2024-10-10 23:25:22,434 INFO L226 Difference]: Without dead ends: 87119 [2024-10-10 23:25:22,473 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-10 23:25:22,473 INFO L432 NwaCegarLoop]: 1146 mSDtfsCounter, 569 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2514 mSolverCounterSat, 336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 2850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 336 IncrementalHoareTripleChecker+Valid, 2514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:25:22,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 1153 Invalid, 2850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [336 Valid, 2514 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-10 23:25:22,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87119 states. [2024-10-10 23:25:23,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87119 to 84866. [2024-10-10 23:25:23,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84866 states, 84865 states have (on average 1.1005361456430802) internal successors, (93397), 84865 states have internal predecessors, (93397), 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-10 23:25:23,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84866 states to 84866 states and 93397 transitions. [2024-10-10 23:25:23,620 INFO L78 Accepts]: Start accepts. Automaton has 84866 states and 93397 transitions. Word has length 483 [2024-10-10 23:25:23,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:25:23,621 INFO L471 AbstractCegarLoop]: Abstraction has 84866 states and 93397 transitions. [2024-10-10 23:25:23,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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-10 23:25:23,621 INFO L276 IsEmpty]: Start isEmpty. Operand 84866 states and 93397 transitions. [2024-10-10 23:25:23,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2024-10-10 23:25:23,638 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:25:23,638 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:25:23,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:25:23,638 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:25:23,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:25:23,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1316863930, now seen corresponding path program 1 times [2024-10-10 23:25:23,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:25:23,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817880110] [2024-10-10 23:25:23,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:25:23,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:25:23,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:25:24,208 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 419 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-10-10 23:25:24,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:25:24,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817880110] [2024-10-10 23:25:24,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817880110] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:25:24,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:25:24,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:25:24,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705109207] [2024-10-10 23:25:24,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:25:24,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:25:24,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:25:24,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:25:24,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:25:24,213 INFO L87 Difference]: Start difference. First operand 84866 states and 93397 transitions. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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-10 23:25:27,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:25:27,264 INFO L93 Difference]: Finished difference Result 208032 states and 230733 transitions. [2024-10-10 23:25:27,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:25:27,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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 520 [2024-10-10 23:25:27,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:25:27,409 INFO L225 Difference]: With dead ends: 208032 [2024-10-10 23:25:27,409 INFO L226 Difference]: Without dead ends: 123918 [2024-10-10 23:25:27,443 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-10 23:25:27,443 INFO L432 NwaCegarLoop]: 1219 mSDtfsCounter, 617 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2112 mSolverCounterSat, 642 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 1225 SdHoareTripleChecker+Invalid, 2754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 642 IncrementalHoareTripleChecker+Valid, 2112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:25:27,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 1225 Invalid, 2754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [642 Valid, 2112 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-10 23:25:27,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123918 states. [2024-10-10 23:25:28,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123918 to 117159. [2024-10-10 23:25:28,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117159 states, 117158 states have (on average 1.0886495160381706) internal successors, (127544), 117158 states have internal predecessors, (127544), 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-10 23:25:29,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117159 states to 117159 states and 127544 transitions. [2024-10-10 23:25:29,004 INFO L78 Accepts]: Start accepts. Automaton has 117159 states and 127544 transitions. Word has length 520 [2024-10-10 23:25:29,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:25:29,004 INFO L471 AbstractCegarLoop]: Abstraction has 117159 states and 127544 transitions. [2024-10-10 23:25:29,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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-10 23:25:29,005 INFO L276 IsEmpty]: Start isEmpty. Operand 117159 states and 127544 transitions. [2024-10-10 23:25:29,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2024-10-10 23:25:29,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:25:29,341 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:25:29,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:25:29,341 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:25:29,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:25:29,342 INFO L85 PathProgramCache]: Analyzing trace with hash 738272688, now seen corresponding path program 1 times [2024-10-10 23:25:29,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:25:29,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336949670] [2024-10-10 23:25:29,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:25:29,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:25:29,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:25:29,752 INFO L134 CoverageAnalysis]: Checked inductivity of 788 backedges. 642 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-10-10 23:25:29,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:25:29,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336949670] [2024-10-10 23:25:29,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336949670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:25:29,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:25:29,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:25:29,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402696691] [2024-10-10 23:25:29,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:25:29,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:25:29,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:25:29,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:25:29,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:25:29,756 INFO L87 Difference]: Start difference. First operand 117159 states and 127544 transitions. Second operand has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 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-10 23:25:32,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:25:32,575 INFO L93 Difference]: Finished difference Result 233566 states and 254331 transitions. [2024-10-10 23:25:32,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:25:32,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 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 570 [2024-10-10 23:25:32,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:25:32,726 INFO L225 Difference]: With dead ends: 233566 [2024-10-10 23:25:32,726 INFO L226 Difference]: Without dead ends: 117159 [2024-10-10 23:25:33,031 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-10 23:25:33,031 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 788 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2173 mSolverCounterSat, 415 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 2588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 415 IncrementalHoareTripleChecker+Valid, 2173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:25:33,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [788 Valid, 219 Invalid, 2588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [415 Valid, 2173 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-10 23:25:33,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117159 states. [2024-10-10 23:25:34,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117159 to 114155. [2024-10-10 23:25:34,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114155 states, 114154 states have (on average 1.0758711915482593) internal successors, (122815), 114154 states have internal predecessors, (122815), 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-10 23:25:34,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114155 states to 114155 states and 122815 transitions. [2024-10-10 23:25:34,481 INFO L78 Accepts]: Start accepts. Automaton has 114155 states and 122815 transitions. Word has length 570 [2024-10-10 23:25:34,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:25:34,481 INFO L471 AbstractCegarLoop]: Abstraction has 114155 states and 122815 transitions. [2024-10-10 23:25:34,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 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-10 23:25:34,481 INFO L276 IsEmpty]: Start isEmpty. Operand 114155 states and 122815 transitions. [2024-10-10 23:25:34,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2024-10-10 23:25:34,505 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:25:34,506 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:25:34,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 23:25:34,506 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:25:34,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:25:34,507 INFO L85 PathProgramCache]: Analyzing trace with hash -784980045, now seen corresponding path program 1 times [2024-10-10 23:25:34,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:25:34,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87245465] [2024-10-10 23:25:34,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:25:34,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:25:34,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:25:35,383 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 664 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-10-10 23:25:35,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:25:35,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87245465] [2024-10-10 23:25:35,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87245465] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:25:35,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:25:35,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:25:35,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749207373] [2024-10-10 23:25:35,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:25:35,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:25:35,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:25:35,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:25:35,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:25:35,388 INFO L87 Difference]: Start difference. First operand 114155 states and 122815 transitions. Second operand has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 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-10 23:25:38,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:25:38,341 INFO L93 Difference]: Finished difference Result 260602 states and 282213 transitions. [2024-10-10 23:25:38,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:25:38,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 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 592 [2024-10-10 23:25:38,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:25:38,543 INFO L225 Difference]: With dead ends: 260602 [2024-10-10 23:25:38,543 INFO L226 Difference]: Without dead ends: 147199 [2024-10-10 23:25:38,616 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-10 23:25:38,616 INFO L432 NwaCegarLoop]: 1246 mSDtfsCounter, 679 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2200 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 679 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 2511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 2200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:25:38,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [679 Valid, 1253 Invalid, 2511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 2200 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-10 23:25:38,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147199 states. [2024-10-10 23:25:40,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147199 to 146448. [2024-10-10 23:25:40,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146448 states, 146447 states have (on average 1.068577710707628) internal successors, (156490), 146447 states have internal predecessors, (156490), 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-10 23:25:40,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146448 states to 146448 states and 156490 transitions. [2024-10-10 23:25:40,680 INFO L78 Accepts]: Start accepts. Automaton has 146448 states and 156490 transitions. Word has length 592 [2024-10-10 23:25:40,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:25:40,681 INFO L471 AbstractCegarLoop]: Abstraction has 146448 states and 156490 transitions. [2024-10-10 23:25:40,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 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-10 23:25:40,681 INFO L276 IsEmpty]: Start isEmpty. Operand 146448 states and 156490 transitions. [2024-10-10 23:25:40,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 628 [2024-10-10 23:25:40,703 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:25:40,703 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:25:40,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 23:25:40,703 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:25:40,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:25:40,704 INFO L85 PathProgramCache]: Analyzing trace with hash -464343562, now seen corresponding path program 1 times [2024-10-10 23:25:40,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:25:40,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975819830] [2024-10-10 23:25:40,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:25:40,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:25:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:25:42,076 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2024-10-10 23:25:42,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:25:42,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975819830] [2024-10-10 23:25:42,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975819830] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:25:42,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:25:42,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:25:42,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780345028] [2024-10-10 23:25:42,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:25:42,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:25:42,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:25:42,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:25:42,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:25:42,080 INFO L87 Difference]: Start difference. First operand 146448 states and 156490 transitions. Second operand has 4 states, 4 states have (on average 89.25) internal successors, (357), 3 states have internal predecessors, (357), 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)