./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label02.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/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label02.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 a2614820f8fcca1461600fdfdb6d83bb1945786709afdcaca608393c61cf1d21 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:40:20,807 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:40:20,898 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 04:40:20,905 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:40:20,907 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:40:20,943 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:40:20,943 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:40:20,944 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:40:20,945 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:40:20,946 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:40:20,946 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:40:20,947 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:40:20,947 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:40:20,948 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:40:20,950 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:40:20,950 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:40:20,951 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:40:20,951 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:40:20,951 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:40:20,951 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:40:20,952 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:40:20,953 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:40:20,953 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:40:20,953 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:40:20,954 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:40:20,954 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:40:20,954 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:40:20,955 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:40:20,958 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:40:20,959 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:40:20,959 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:40:20,959 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:40:20,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:40:20,961 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:40:20,961 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:40:20,962 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:40:20,962 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:40:20,962 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:40:20,963 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:40:20,963 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:40:20,963 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:40:20,963 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:40:20,964 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 -> a2614820f8fcca1461600fdfdb6d83bb1945786709afdcaca608393c61cf1d21 [2024-10-11 04:40:21,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:40:21,263 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:40:21,265 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:40:21,270 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:40:21,270 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:40:21,271 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label02.c [2024-10-11 04:40:22,733 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:40:23,186 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:40:23,186 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label02.c [2024-10-11 04:40:23,232 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/818df2555/4ae07c6e0049451da6903375d568ce94/FLAGd7f98df59 [2024-10-11 04:40:23,250 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/818df2555/4ae07c6e0049451da6903375d568ce94 [2024-10-11 04:40:23,253 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:40:23,255 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:40:23,259 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:40:23,259 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:40:23,265 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:40:23,266 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:40:23" (1/1) ... [2024-10-11 04:40:23,267 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d058dda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:40:23, skipping insertion in model container [2024-10-11 04:40:23,267 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:40:23" (1/1) ... [2024-10-11 04:40:23,377 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:40:23,721 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/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label02.c[6391,6404] [2024-10-11 04:40:23,779 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/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label02.c[13681,13694] [2024-10-11 04:40:24,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:40:24,394 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:40:24,433 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/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label02.c[6391,6404] [2024-10-11 04:40:24,450 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/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label02.c[13681,13694] [2024-10-11 04:40:24,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:40:24,838 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:40:24,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:40:24 WrapperNode [2024-10-11 04:40:24,840 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:40:24,841 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:40:24,841 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:40:24,841 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:40:24,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:40:24" (1/1) ... [2024-10-11 04:40:24,901 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:40:24" (1/1) ... [2024-10-11 04:40:25,216 INFO L138 Inliner]: procedures = 33, calls = 19, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 4984 [2024-10-11 04:40:25,218 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:40:25,218 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:40:25,218 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:40:25,219 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:40:25,229 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:40:24" (1/1) ... [2024-10-11 04:40:25,230 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:40:24" (1/1) ... [2024-10-11 04:40:25,319 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:40:24" (1/1) ... [2024-10-11 04:40:25,493 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-11 04:40:25,493 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:40:24" (1/1) ... [2024-10-11 04:40:25,494 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:40:24" (1/1) ... [2024-10-11 04:40:25,765 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:40:24" (1/1) ... [2024-10-11 04:40:25,791 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:40:24" (1/1) ... [2024-10-11 04:40:25,826 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:40:24" (1/1) ... [2024-10-11 04:40:25,845 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:40:24" (1/1) ... [2024-10-11 04:40:25,894 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:40:25,896 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:40:25,897 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:40:25,897 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:40:25,898 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:40:24" (1/1) ... [2024-10-11 04:40:25,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:40:25,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:40:25,933 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-11 04:40:25,940 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-11 04:40:25,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:40:25,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:40:25,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:40:25,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:40:26,075 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:40:26,077 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:40:30,525 INFO L? ?]: Removed 732 outVars from TransFormulas that were not future-live. [2024-10-11 04:40:30,525 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:40:30,597 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:40:30,598 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 04:40:30,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:40:30 BoogieIcfgContainer [2024-10-11 04:40:30,598 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:40:30,600 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:40:30,600 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:40:30,604 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:40:30,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:40:23" (1/3) ... [2024-10-11 04:40:30,605 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76dfe878 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:40:30, skipping insertion in model container [2024-10-11 04:40:30,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:40:24" (2/3) ... [2024-10-11 04:40:30,605 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76dfe878 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:40:30, skipping insertion in model container [2024-10-11 04:40:30,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:40:30" (3/3) ... [2024-10-11 04:40:30,606 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label02.c [2024-10-11 04:40:30,624 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:40:30,624 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:40:30,724 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:40:30,731 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;@6a68e48, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:40:30,731 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:40:30,741 INFO L276 IsEmpty]: Start isEmpty. Operand has 807 states, 804 states have (on average 1.9800995024875623) internal successors, (1592), 806 states have internal predecessors, (1592), 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-11 04:40:30,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 04:40:30,748 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:30,748 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:40:30,749 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:30,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:30,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1100216757, now seen corresponding path program 1 times [2024-10-11 04:40:30,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:30,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931344569] [2024-10-11 04:40:30,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:30,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:30,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:30,975 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-11 04:40:30,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:30,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931344569] [2024-10-11 04:40:30,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931344569] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:40:30,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:40:30,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 04:40:30,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141039843] [2024-10-11 04:40:30,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:40:30,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 04:40:30,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:31,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 04:40:31,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 04:40:31,016 INFO L87 Difference]: Start difference. First operand has 807 states, 804 states have (on average 1.9800995024875623) internal successors, (1592), 806 states have internal predecessors, (1592), 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 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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-11 04:40:31,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:31,119 INFO L93 Difference]: Finished difference Result 1594 states and 3146 transitions. [2024-10-11 04:40:31,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 04:40:31,123 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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 17 [2024-10-11 04:40:31,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:31,148 INFO L225 Difference]: With dead ends: 1594 [2024-10-11 04:40:31,149 INFO L226 Difference]: Without dead ends: 803 [2024-10-11 04:40:31,159 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-11 04:40:31,165 INFO L432 NwaCegarLoop]: 1521 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1521 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:40:31,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1521 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:40:31,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2024-10-11 04:40:31,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 803. [2024-10-11 04:40:31,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 801 states have (on average 1.898876404494382) internal successors, (1521), 802 states have internal predecessors, (1521), 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-11 04:40:31,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1521 transitions. [2024-10-11 04:40:31,273 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1521 transitions. Word has length 17 [2024-10-11 04:40:31,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:31,273 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1521 transitions. [2024-10-11 04:40:31,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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-11 04:40:31,274 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1521 transitions. [2024-10-11 04:40:31,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 04:40:31,276 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:31,276 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:40:31,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:40:31,277 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:31,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:31,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1687022771, now seen corresponding path program 1 times [2024-10-11 04:40:31,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:31,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893404350] [2024-10-11 04:40:31,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:31,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:31,505 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-11 04:40:31,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:31,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893404350] [2024-10-11 04:40:31,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893404350] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:40:31,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:40:31,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 04:40:31,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475125081] [2024-10-11 04:40:31,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:40:31,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:40:31,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:31,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:40:31,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:40:31,513 INFO L87 Difference]: Start difference. First operand 803 states and 1521 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-11 04:40:31,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:31,647 INFO L93 Difference]: Finished difference Result 864 states and 1616 transitions. [2024-10-11 04:40:31,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:40:31,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2024-10-11 04:40:31,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:31,653 INFO L225 Difference]: With dead ends: 864 [2024-10-11 04:40:31,654 INFO L226 Difference]: Without dead ends: 832 [2024-10-11 04:40:31,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:40:31,656 INFO L432 NwaCegarLoop]: 1516 mSDtfsCounter, 45 mSDsluCounter, 3011 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 4527 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:40:31,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 4527 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:40:31,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2024-10-11 04:40:31,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 803. [2024-10-11 04:40:31,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 801 states have (on average 1.8789013732833957) internal successors, (1505), 802 states have internal predecessors, (1505), 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-11 04:40:31,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1505 transitions. [2024-10-11 04:40:31,681 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1505 transitions. Word has length 17 [2024-10-11 04:40:31,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:31,682 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1505 transitions. [2024-10-11 04:40:31,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-11 04:40:31,683 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1505 transitions. [2024-10-11 04:40:31,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 04:40:31,684 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:31,684 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] [2024-10-11 04:40:31,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:40:31,684 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:31,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:31,685 INFO L85 PathProgramCache]: Analyzing trace with hash 613121839, now seen corresponding path program 1 times [2024-10-11 04:40:31,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:31,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791084002] [2024-10-11 04:40:31,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:31,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:31,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:31,854 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-11 04:40:31,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:31,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791084002] [2024-10-11 04:40:31,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791084002] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:40:31,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:40:31,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:40:31,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959560747] [2024-10-11 04:40:31,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:40:31,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:40:31,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:31,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:40:31,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:40:31,859 INFO L87 Difference]: Start difference. First operand 803 states and 1505 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-11 04:40:32,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:32,013 INFO L93 Difference]: Finished difference Result 977 states and 1781 transitions. [2024-10-11 04:40:32,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:40:32,014 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 32 [2024-10-11 04:40:32,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:32,020 INFO L225 Difference]: With dead ends: 977 [2024-10-11 04:40:32,020 INFO L226 Difference]: Without dead ends: 948 [2024-10-11 04:40:32,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:40:32,024 INFO L432 NwaCegarLoop]: 1498 mSDtfsCounter, 4578 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4578 SdHoareTripleChecker+Valid, 1841 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:40:32,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4578 Valid, 1841 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:40:32,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2024-10-11 04:40:32,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 830. [2024-10-11 04:40:32,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 828 states have (on average 1.8695652173913044) internal successors, (1548), 829 states have internal predecessors, (1548), 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-11 04:40:32,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1548 transitions. [2024-10-11 04:40:32,044 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1548 transitions. Word has length 32 [2024-10-11 04:40:32,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:32,045 INFO L471 AbstractCegarLoop]: Abstraction has 830 states and 1548 transitions. [2024-10-11 04:40:32,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-11 04:40:32,048 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1548 transitions. [2024-10-11 04:40:32,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 04:40:32,049 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:32,049 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] [2024-10-11 04:40:32,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:40:32,050 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:32,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:32,050 INFO L85 PathProgramCache]: Analyzing trace with hash 675954815, now seen corresponding path program 1 times [2024-10-11 04:40:32,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:32,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049624124] [2024-10-11 04:40:32,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:32,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:32,143 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-11 04:40:32,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:32,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049624124] [2024-10-11 04:40:32,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049624124] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:40:32,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:40:32,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:40:32,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737082982] [2024-10-11 04:40:32,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:40:32,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:40:32,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:32,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:40:32,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:40:32,147 INFO L87 Difference]: Start difference. First operand 830 states and 1548 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-11 04:40:32,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:32,186 INFO L93 Difference]: Finished difference Result 931 states and 1707 transitions. [2024-10-11 04:40:32,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:40:32,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 34 [2024-10-11 04:40:32,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:32,190 INFO L225 Difference]: With dead ends: 931 [2024-10-11 04:40:32,191 INFO L226 Difference]: Without dead ends: 875 [2024-10-11 04:40:32,193 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-11 04:40:32,194 INFO L432 NwaCegarLoop]: 1500 mSDtfsCounter, 1464 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1464 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:40:32,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1464 Valid, 1540 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:40:32,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2024-10-11 04:40:32,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 873. [2024-10-11 04:40:32,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 871 states have (on average 1.8530424799081515) internal successors, (1614), 872 states have internal predecessors, (1614), 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-11 04:40:32,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1614 transitions. [2024-10-11 04:40:32,213 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1614 transitions. Word has length 34 [2024-10-11 04:40:32,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:32,213 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1614 transitions. [2024-10-11 04:40:32,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-11 04:40:32,214 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1614 transitions. [2024-10-11 04:40:32,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 04:40:32,215 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:32,215 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] [2024-10-11 04:40:32,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:40:32,215 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:32,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:32,216 INFO L85 PathProgramCache]: Analyzing trace with hash 678099767, now seen corresponding path program 1 times [2024-10-11 04:40:32,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:32,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225709924] [2024-10-11 04:40:32,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:32,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:32,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:32,409 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-11 04:40:32,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:32,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225709924] [2024-10-11 04:40:32,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225709924] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:40:32,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:40:32,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:40:32,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536208302] [2024-10-11 04:40:32,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:40:32,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:40:32,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:32,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:40:32,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:40:32,411 INFO L87 Difference]: Start difference. First operand 873 states and 1614 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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-11 04:40:32,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:32,493 INFO L93 Difference]: Finished difference Result 974 states and 1770 transitions. [2024-10-11 04:40:32,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 04:40:32,494 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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 34 [2024-10-11 04:40:32,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:32,498 INFO L225 Difference]: With dead ends: 974 [2024-10-11 04:40:32,498 INFO L226 Difference]: Without dead ends: 875 [2024-10-11 04:40:32,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:40:32,499 INFO L432 NwaCegarLoop]: 1497 mSDtfsCounter, 1473 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1473 SdHoareTripleChecker+Valid, 1620 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:40:32,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1473 Valid, 1620 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:40:32,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2024-10-11 04:40:32,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 873. [2024-10-11 04:40:32,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 871 states have (on average 1.8507462686567164) internal successors, (1612), 872 states have internal predecessors, (1612), 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-11 04:40:32,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1612 transitions. [2024-10-11 04:40:32,516 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1612 transitions. Word has length 34 [2024-10-11 04:40:32,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:32,517 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1612 transitions. [2024-10-11 04:40:32,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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-11 04:40:32,517 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1612 transitions. [2024-10-11 04:40:32,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 04:40:32,518 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:32,518 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] [2024-10-11 04:40:32,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:40:32,518 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:32,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:32,519 INFO L85 PathProgramCache]: Analyzing trace with hash -582127364, now seen corresponding path program 1 times [2024-10-11 04:40:32,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:32,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951328087] [2024-10-11 04:40:32,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:32,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:32,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:32,656 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-11 04:40:32,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:32,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951328087] [2024-10-11 04:40:32,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951328087] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:40:32,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:40:32,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 04:40:32,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617745282] [2024-10-11 04:40:32,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:40:32,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:40:32,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:32,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:40:32,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:40:32,658 INFO L87 Difference]: Start difference. First operand 873 states and 1612 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-11 04:40:32,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:32,696 INFO L93 Difference]: Finished difference Result 879 states and 1619 transitions. [2024-10-11 04:40:32,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:40:32,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 35 [2024-10-11 04:40:32,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:32,701 INFO L225 Difference]: With dead ends: 879 [2024-10-11 04:40:32,701 INFO L226 Difference]: Without dead ends: 877 [2024-10-11 04:40:32,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:40:32,703 INFO L432 NwaCegarLoop]: 1501 mSDtfsCounter, 0 mSDsluCounter, 2994 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4495 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:40:32,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4495 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:40:32,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2024-10-11 04:40:32,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 877. [2024-10-11 04:40:32,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 875 states have (on average 1.8457142857142856) internal successors, (1615), 876 states have internal predecessors, (1615), 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-11 04:40:32,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1615 transitions. [2024-10-11 04:40:32,727 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1615 transitions. Word has length 35 [2024-10-11 04:40:32,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:32,727 INFO L471 AbstractCegarLoop]: Abstraction has 877 states and 1615 transitions. [2024-10-11 04:40:32,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-11 04:40:32,727 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1615 transitions. [2024-10-11 04:40:32,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 04:40:32,728 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:32,728 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] [2024-10-11 04:40:32,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:40:32,728 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:32,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:32,729 INFO L85 PathProgramCache]: Analyzing trace with hash 2127458807, now seen corresponding path program 1 times [2024-10-11 04:40:32,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:32,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829503995] [2024-10-11 04:40:32,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:32,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:32,780 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-11 04:40:32,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:32,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829503995] [2024-10-11 04:40:32,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829503995] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:40:32,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:40:32,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:40:32,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584426084] [2024-10-11 04:40:32,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:40:32,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:40:32,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:32,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:40:32,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:40:32,783 INFO L87 Difference]: Start difference. First operand 877 states and 1615 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-11 04:40:32,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:32,814 INFO L93 Difference]: Finished difference Result 991 states and 1788 transitions. [2024-10-11 04:40:32,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:40:32,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 36 [2024-10-11 04:40:32,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:32,818 INFO L225 Difference]: With dead ends: 991 [2024-10-11 04:40:32,819 INFO L226 Difference]: Without dead ends: 931 [2024-10-11 04:40:32,819 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-11 04:40:32,820 INFO L432 NwaCegarLoop]: 1532 mSDtfsCounter, 1474 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1578 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:40:32,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1578 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:40:32,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2024-10-11 04:40:32,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 929. [2024-10-11 04:40:32,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 927 states have (on average 1.825242718446602) internal successors, (1692), 928 states have internal predecessors, (1692), 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-11 04:40:32,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1692 transitions. [2024-10-11 04:40:32,840 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1692 transitions. Word has length 36 [2024-10-11 04:40:32,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:32,840 INFO L471 AbstractCegarLoop]: Abstraction has 929 states and 1692 transitions. [2024-10-11 04:40:32,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-11 04:40:32,841 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1692 transitions. [2024-10-11 04:40:32,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 04:40:32,841 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:32,842 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] [2024-10-11 04:40:32,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:40:32,842 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:32,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:32,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1501802743, now seen corresponding path program 1 times [2024-10-11 04:40:32,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:32,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577927993] [2024-10-11 04:40:32,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:32,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:32,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:32,887 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-11 04:40:32,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:32,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577927993] [2024-10-11 04:40:32,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577927993] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:40:32,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:40:32,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:40:32,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579482887] [2024-10-11 04:40:32,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:40:32,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:40:32,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:32,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:40:32,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:40:32,890 INFO L87 Difference]: Start difference. First operand 929 states and 1692 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-11 04:40:32,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:32,925 INFO L93 Difference]: Finished difference Result 1211 states and 2112 transitions. [2024-10-11 04:40:32,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:40:32,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 36 [2024-10-11 04:40:32,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:32,930 INFO L225 Difference]: With dead ends: 1211 [2024-10-11 04:40:32,931 INFO L226 Difference]: Without dead ends: 1058 [2024-10-11 04:40:32,931 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-11 04:40:32,932 INFO L432 NwaCegarLoop]: 1534 mSDtfsCounter, 1472 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1472 SdHoareTripleChecker+Valid, 1584 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:40:32,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1472 Valid, 1584 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:40:32,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2024-10-11 04:40:32,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 1056. [2024-10-11 04:40:32,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1056 states, 1054 states have (on average 1.777988614800759) internal successors, (1874), 1055 states have internal predecessors, (1874), 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-11 04:40:32,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1874 transitions. [2024-10-11 04:40:32,959 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1874 transitions. Word has length 36 [2024-10-11 04:40:32,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:32,960 INFO L471 AbstractCegarLoop]: Abstraction has 1056 states and 1874 transitions. [2024-10-11 04:40:32,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-11 04:40:32,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1874 transitions. [2024-10-11 04:40:32,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 04:40:32,961 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:32,961 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] [2024-10-11 04:40:32,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:40:32,961 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:32,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:32,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1904431113, now seen corresponding path program 1 times [2024-10-11 04:40:32,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:32,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700751443] [2024-10-11 04:40:32,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:32,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:32,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:33,006 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-11 04:40:33,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:33,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700751443] [2024-10-11 04:40:33,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700751443] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:40:33,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:40:33,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:40:33,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434658898] [2024-10-11 04:40:33,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:40:33,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:40:33,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:33,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:40:33,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:40:33,009 INFO L87 Difference]: Start difference. First operand 1056 states and 1874 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-11 04:40:33,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:33,062 INFO L93 Difference]: Finished difference Result 1568 states and 2616 transitions. [2024-10-11 04:40:33,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:40:33,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 36 [2024-10-11 04:40:33,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:33,068 INFO L225 Difference]: With dead ends: 1568 [2024-10-11 04:40:33,068 INFO L226 Difference]: Without dead ends: 1288 [2024-10-11 04:40:33,069 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-11 04:40:33,070 INFO L432 NwaCegarLoop]: 1532 mSDtfsCounter, 1470 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1470 SdHoareTripleChecker+Valid, 1586 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:40:33,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1470 Valid, 1586 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:40:33,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2024-10-11 04:40:33,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 1286. [2024-10-11 04:40:33,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1286 states, 1284 states have (on average 1.705607476635514) internal successors, (2190), 1285 states have internal predecessors, (2190), 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-11 04:40:33,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 2190 transitions. [2024-10-11 04:40:33,104 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 2190 transitions. Word has length 36 [2024-10-11 04:40:33,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:33,104 INFO L471 AbstractCegarLoop]: Abstraction has 1286 states and 2190 transitions. [2024-10-11 04:40:33,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-11 04:40:33,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 2190 transitions. [2024-10-11 04:40:33,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 04:40:33,105 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:33,105 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 04:40:33,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:40:33,106 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:33,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:33,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1853448570, now seen corresponding path program 1 times [2024-10-11 04:40:33,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:33,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327855140] [2024-10-11 04:40:33,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:33,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:33,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:33,215 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 04:40:33,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:33,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327855140] [2024-10-11 04:40:33,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327855140] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:40:33,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:40:33,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:40:33,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904135794] [2024-10-11 04:40:33,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:40:33,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:40:33,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:33,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:40:33,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:40:33,217 INFO L87 Difference]: Start difference. First operand 1286 states and 2190 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 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-11 04:40:33,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:33,336 INFO L93 Difference]: Finished difference Result 2794 states and 4342 transitions. [2024-10-11 04:40:33,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 04:40:33,337 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 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 50 [2024-10-11 04:40:33,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:33,348 INFO L225 Difference]: With dead ends: 2794 [2024-10-11 04:40:33,348 INFO L226 Difference]: Without dead ends: 2424 [2024-10-11 04:40:33,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:40:33,351 INFO L432 NwaCegarLoop]: 1540 mSDtfsCounter, 3031 mSDsluCounter, 1613 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3031 SdHoareTripleChecker+Valid, 3153 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:40:33,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3031 Valid, 3153 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:40:33,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2424 states. [2024-10-11 04:40:33,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2424 to 1726. [2024-10-11 04:40:33,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1726 states, 1724 states have (on average 1.6299303944315546) internal successors, (2810), 1725 states have internal predecessors, (2810), 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-11 04:40:33,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 2810 transitions. [2024-10-11 04:40:33,421 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 2810 transitions. Word has length 50 [2024-10-11 04:40:33,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:33,421 INFO L471 AbstractCegarLoop]: Abstraction has 1726 states and 2810 transitions. [2024-10-11 04:40:33,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 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-11 04:40:33,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2810 transitions. [2024-10-11 04:40:33,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 04:40:33,423 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:33,423 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 04:40:33,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:40:33,424 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:33,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:33,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1815862662, now seen corresponding path program 1 times [2024-10-11 04:40:33,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:33,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314464459] [2024-10-11 04:40:33,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:33,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:33,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:33,563 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 04:40:33,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:33,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314464459] [2024-10-11 04:40:33,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314464459] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:40:33,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:40:33,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:40:33,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197594673] [2024-10-11 04:40:33,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:40:33,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:40:33,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:33,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:40:33,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:40:33,566 INFO L87 Difference]: Start difference. First operand 1726 states and 2810 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-11 04:40:33,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:33,712 INFO L93 Difference]: Finished difference Result 3302 states and 5062 transitions. [2024-10-11 04:40:33,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 04:40:33,713 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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 50 [2024-10-11 04:40:33,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:33,726 INFO L225 Difference]: With dead ends: 3302 [2024-10-11 04:40:33,727 INFO L226 Difference]: Without dead ends: 2792 [2024-10-11 04:40:33,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:40:33,731 INFO L432 NwaCegarLoop]: 1539 mSDtfsCounter, 3035 mSDsluCounter, 1591 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3035 SdHoareTripleChecker+Valid, 3130 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:40:33,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3035 Valid, 3130 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:40:33,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2792 states. [2024-10-11 04:40:33,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2792 to 2418. [2024-10-11 04:40:33,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2418 states, 2416 states have (on average 1.5653973509933774) internal successors, (3782), 2417 states have internal predecessors, (3782), 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-11 04:40:33,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 3782 transitions. [2024-10-11 04:40:33,846 INFO L78 Accepts]: Start accepts. Automaton has 2418 states and 3782 transitions. Word has length 50 [2024-10-11 04:40:33,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:33,847 INFO L471 AbstractCegarLoop]: Abstraction has 2418 states and 3782 transitions. [2024-10-11 04:40:33,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-11 04:40:33,847 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 3782 transitions. [2024-10-11 04:40:33,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 04:40:33,848 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:33,848 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 04:40:33,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:40:33,849 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:33,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:33,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1590371194, now seen corresponding path program 1 times [2024-10-11 04:40:33,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:33,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788385343] [2024-10-11 04:40:33,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:33,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:33,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:34,000 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 04:40:34,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:34,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788385343] [2024-10-11 04:40:34,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788385343] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:40:34,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:40:34,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:40:34,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405452819] [2024-10-11 04:40:34,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:40:34,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:40:34,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:34,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:40:34,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:40:34,003 INFO L87 Difference]: Start difference. First operand 2418 states and 3782 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-11 04:40:34,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:34,159 INFO L93 Difference]: Finished difference Result 3810 states and 5778 transitions. [2024-10-11 04:40:34,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 04:40:34,160 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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 50 [2024-10-11 04:40:34,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:34,174 INFO L225 Difference]: With dead ends: 3810 [2024-10-11 04:40:34,174 INFO L226 Difference]: Without dead ends: 3300 [2024-10-11 04:40:34,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:40:34,177 INFO L432 NwaCegarLoop]: 1538 mSDtfsCounter, 3041 mSDsluCounter, 1596 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3041 SdHoareTripleChecker+Valid, 3134 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:40:34,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3041 Valid, 3134 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:40:34,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3300 states. [2024-10-11 04:40:34,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3300 to 2926. [2024-10-11 04:40:34,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2926 states, 2924 states have (on average 1.5383036935704515) internal successors, (4498), 2925 states have internal predecessors, (4498), 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-11 04:40:34,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2926 states to 2926 states and 4498 transitions. [2024-10-11 04:40:34,299 INFO L78 Accepts]: Start accepts. Automaton has 2926 states and 4498 transitions. Word has length 50 [2024-10-11 04:40:34,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:34,299 INFO L471 AbstractCegarLoop]: Abstraction has 2926 states and 4498 transitions. [2024-10-11 04:40:34,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-11 04:40:34,300 INFO L276 IsEmpty]: Start isEmpty. Operand 2926 states and 4498 transitions. [2024-10-11 04:40:34,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 04:40:34,301 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:34,301 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:40:34,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 04:40:34,301 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:34,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:34,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1183432324, now seen corresponding path program 1 times [2024-10-11 04:40:34,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:34,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16819732] [2024-10-11 04:40:34,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:34,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:34,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:34,408 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:40:34,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:34,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16819732] [2024-10-11 04:40:34,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16819732] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:40:34,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:40:34,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:40:34,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911300859] [2024-10-11 04:40:34,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:40:34,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:40:34,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:34,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:40:34,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:40:34,412 INFO L87 Difference]: Start difference. First operand 2926 states and 4498 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-11 04:40:34,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:34,495 INFO L93 Difference]: Finished difference Result 5078 states and 7536 transitions. [2024-10-11 04:40:34,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:40:34,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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 51 [2024-10-11 04:40:34,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:34,509 INFO L225 Difference]: With dead ends: 5078 [2024-10-11 04:40:34,509 INFO L226 Difference]: Without dead ends: 2928 [2024-10-11 04:40:34,513 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-11 04:40:34,515 INFO L432 NwaCegarLoop]: 1520 mSDtfsCounter, 29 mSDsluCounter, 1491 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 3011 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:40:34,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 3011 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:40:34,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2024-10-11 04:40:34,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 2926. [2024-10-11 04:40:34,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2926 states, 2924 states have (on average 1.5212038303693571) internal successors, (4448), 2925 states have internal predecessors, (4448), 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-11 04:40:34,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2926 states to 2926 states and 4448 transitions. [2024-10-11 04:40:34,620 INFO L78 Accepts]: Start accepts. Automaton has 2926 states and 4448 transitions. Word has length 51 [2024-10-11 04:40:34,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:34,621 INFO L471 AbstractCegarLoop]: Abstraction has 2926 states and 4448 transitions. [2024-10-11 04:40:34,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-11 04:40:34,621 INFO L276 IsEmpty]: Start isEmpty. Operand 2926 states and 4448 transitions. [2024-10-11 04:40:34,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 04:40:34,622 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:34,622 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 04:40:34,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 04:40:34,623 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:34,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:34,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1165828046, now seen corresponding path program 1 times [2024-10-11 04:40:34,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:34,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524315687] [2024-10-11 04:40:34,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:34,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:34,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:34,724 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:40:34,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:34,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524315687] [2024-10-11 04:40:34,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524315687] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:40:34,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:40:34,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:40:34,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351619088] [2024-10-11 04:40:34,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:40:34,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:40:34,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:34,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:40:34,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:40:34,727 INFO L87 Difference]: Start difference. First operand 2926 states and 4448 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-11 04:40:34,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:34,777 INFO L93 Difference]: Finished difference Result 3772 states and 5635 transitions. [2024-10-11 04:40:34,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:40:34,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 52 [2024-10-11 04:40:34,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:34,785 INFO L225 Difference]: With dead ends: 3772 [2024-10-11 04:40:34,785 INFO L226 Difference]: Without dead ends: 1622 [2024-10-11 04:40:34,788 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-11 04:40:34,789 INFO L432 NwaCegarLoop]: 1518 mSDtfsCounter, 23 mSDsluCounter, 1490 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3008 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:40:34,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3008 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:40:34,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2024-10-11 04:40:34,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1615. [2024-10-11 04:40:34,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1615 states, 1613 states have (on average 1.6261624302541848) internal successors, (2623), 1614 states have internal predecessors, (2623), 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-11 04:40:34,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 2623 transitions. [2024-10-11 04:40:34,845 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 2623 transitions. Word has length 52 [2024-10-11 04:40:34,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:34,846 INFO L471 AbstractCegarLoop]: Abstraction has 1615 states and 2623 transitions. [2024-10-11 04:40:34,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-11 04:40:34,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2623 transitions. [2024-10-11 04:40:34,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 04:40:34,847 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:34,847 INFO L215 NwaCegarLoop]: trace histogram [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-11 04:40:34,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 04:40:34,847 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:34,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:34,848 INFO L85 PathProgramCache]: Analyzing trace with hash 2138930058, now seen corresponding path program 1 times [2024-10-11 04:40:34,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:34,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466513487] [2024-10-11 04:40:34,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:34,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:34,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:34,941 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:40:34,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:34,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466513487] [2024-10-11 04:40:34,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466513487] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:40:34,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:40:34,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:40:34,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82802536] [2024-10-11 04:40:34,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:40:34,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:40:34,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:34,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:40:34,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:40:34,943 INFO L87 Difference]: Start difference. First operand 1615 states and 2623 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-11 04:40:34,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:34,977 INFO L93 Difference]: Finished difference Result 2033 states and 3201 transitions. [2024-10-11 04:40:34,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:40:34,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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 53 [2024-10-11 04:40:34,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:34,983 INFO L225 Difference]: With dead ends: 2033 [2024-10-11 04:40:34,983 INFO L226 Difference]: Without dead ends: 1203 [2024-10-11 04:40:34,985 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-11 04:40:34,986 INFO L432 NwaCegarLoop]: 1512 mSDtfsCounter, 25 mSDsluCounter, 1475 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 2987 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:40:34,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 2987 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:40:34,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2024-10-11 04:40:35,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1201. [2024-10-11 04:40:35,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1201 states, 1199 states have (on average 1.6997497914929107) internal successors, (2038), 1200 states have internal predecessors, (2038), 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-11 04:40:35,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 1201 states and 2038 transitions. [2024-10-11 04:40:35,017 INFO L78 Accepts]: Start accepts. Automaton has 1201 states and 2038 transitions. Word has length 53 [2024-10-11 04:40:35,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:35,017 INFO L471 AbstractCegarLoop]: Abstraction has 1201 states and 2038 transitions. [2024-10-11 04:40:35,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-11 04:40:35,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 2038 transitions. [2024-10-11 04:40:35,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 04:40:35,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:35,019 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 04:40:35,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 04:40:35,019 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:35,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:35,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1489407768, now seen corresponding path program 1 times [2024-10-11 04:40:35,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:35,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625241011] [2024-10-11 04:40:35,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:35,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:35,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:36,942 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:40:36,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:36,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625241011] [2024-10-11 04:40:36,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625241011] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:40:36,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116206365] [2024-10-11 04:40:36,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:36,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:40:36,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:40:36,945 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-11 04:40:36,946 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-11 04:40:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:37,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 04:40:37,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:40:37,519 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:40:37,519 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:40:38,308 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:40:38,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116206365] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:40:38,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:40:38,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2024-10-11 04:40:38,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557363305] [2024-10-11 04:40:38,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:40:38,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-11 04:40:38,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:38,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-11 04:40:38,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2024-10-11 04:40:38,311 INFO L87 Difference]: Start difference. First operand 1201 states and 2038 transitions. Second operand has 28 states, 28 states have (on average 5.071428571428571) internal successors, (142), 27 states have internal predecessors, (142), 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-11 04:40:41,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:41,660 INFO L93 Difference]: Finished difference Result 2689 states and 4060 transitions. [2024-10-11 04:40:41,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-11 04:40:41,661 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.071428571428571) internal successors, (142), 27 states have internal predecessors, (142), 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 55 [2024-10-11 04:40:41,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:41,668 INFO L225 Difference]: With dead ends: 2689 [2024-10-11 04:40:41,668 INFO L226 Difference]: Without dead ends: 2273 [2024-10-11 04:40:41,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=813, Invalid=3093, Unknown=0, NotChecked=0, Total=3906 [2024-10-11 04:40:41,671 INFO L432 NwaCegarLoop]: 1477 mSDtfsCounter, 24395 mSDsluCounter, 6190 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24395 SdHoareTripleChecker+Valid, 7667 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:40:41,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24395 Valid, 7667 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 04:40:41,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2273 states. [2024-10-11 04:40:41,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2273 to 2220. [2024-10-11 04:40:41,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2220 states, 2218 states have (on average 1.5270513976555455) internal successors, (3387), 2219 states have internal predecessors, (3387), 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-11 04:40:41,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2220 states to 2220 states and 3387 transitions. [2024-10-11 04:40:41,747 INFO L78 Accepts]: Start accepts. Automaton has 2220 states and 3387 transitions. Word has length 55 [2024-10-11 04:40:41,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:41,747 INFO L471 AbstractCegarLoop]: Abstraction has 2220 states and 3387 transitions. [2024-10-11 04:40:41,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.071428571428571) internal successors, (142), 27 states have internal predecessors, (142), 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-11 04:40:41,748 INFO L276 IsEmpty]: Start isEmpty. Operand 2220 states and 3387 transitions. [2024-10-11 04:40:41,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 04:40:41,749 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:41,749 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 04:40:41,768 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-11 04:40:41,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-11 04:40:41,951 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:41,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:41,952 INFO L85 PathProgramCache]: Analyzing trace with hash -294784256, now seen corresponding path program 1 times [2024-10-11 04:40:41,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:41,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000845627] [2024-10-11 04:40:41,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:41,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:42,258 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:40:42,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:42,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000845627] [2024-10-11 04:40:42,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000845627] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:40:42,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751466751] [2024-10-11 04:40:42,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:42,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:40:42,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:40:42,261 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:40:42,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 04:40:42,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:42,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 04:40:42,363 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:40:42,677 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:40:42,677 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:40:43,376 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:40:43,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751466751] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:40:43,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:40:43,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2024-10-11 04:40:43,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672395181] [2024-10-11 04:40:43,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:40:43,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 04:40:43,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:43,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 04:40:43,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2024-10-11 04:40:43,379 INFO L87 Difference]: Start difference. First operand 2220 states and 3387 transitions. Second operand has 23 states, 23 states have (on average 5.260869565217392) internal successors, (121), 22 states have internal predecessors, (121), 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-11 04:40:43,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:43,855 INFO L93 Difference]: Finished difference Result 4415 states and 6352 transitions. [2024-10-11 04:40:43,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 04:40:43,856 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.260869565217392) internal successors, (121), 22 states have internal predecessors, (121), 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 56 [2024-10-11 04:40:43,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:43,867 INFO L225 Difference]: With dead ends: 4415 [2024-10-11 04:40:43,867 INFO L226 Difference]: Without dead ends: 2980 [2024-10-11 04:40:43,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=238, Invalid=692, Unknown=0, NotChecked=0, Total=930 [2024-10-11 04:40:43,872 INFO L432 NwaCegarLoop]: 1481 mSDtfsCounter, 10443 mSDsluCounter, 4535 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10443 SdHoareTripleChecker+Valid, 6016 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:40:43,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10443 Valid, 6016 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 04:40:43,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2980 states. [2024-10-11 04:40:43,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2980 to 2976. [2024-10-11 04:40:44,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2976 states, 2974 states have (on average 1.4828513786146604) internal successors, (4410), 2975 states have internal predecessors, (4410), 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-11 04:40:44,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2976 states to 2976 states and 4410 transitions. [2024-10-11 04:40:44,015 INFO L78 Accepts]: Start accepts. Automaton has 2976 states and 4410 transitions. Word has length 56 [2024-10-11 04:40:44,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:44,016 INFO L471 AbstractCegarLoop]: Abstraction has 2976 states and 4410 transitions. [2024-10-11 04:40:44,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.260869565217392) internal successors, (121), 22 states have internal predecessors, (121), 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-11 04:40:44,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2976 states and 4410 transitions. [2024-10-11 04:40:44,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 04:40:44,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:44,020 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 04:40:44,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 04:40:44,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 04:40:44,221 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:44,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:44,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1035298560, now seen corresponding path program 1 times [2024-10-11 04:40:44,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:44,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112485305] [2024-10-11 04:40:44,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:44,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:44,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:44,604 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:40:44,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:44,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112485305] [2024-10-11 04:40:44,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112485305] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:40:44,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718507239] [2024-10-11 04:40:44,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:44,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:40:44,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:40:44,608 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:40:44,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 04:40:44,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:44,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 04:40:44,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:40:45,014 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:40:45,015 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:40:45,433 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:40:45,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718507239] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:40:45,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:40:45,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2024-10-11 04:40:45,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347265503] [2024-10-11 04:40:45,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:40:45,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 04:40:45,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:45,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 04:40:45,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2024-10-11 04:40:45,436 INFO L87 Difference]: Start difference. First operand 2976 states and 4410 transitions. Second operand has 22 states, 22 states have (on average 5.7727272727272725) internal successors, (127), 21 states have internal predecessors, (127), 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-11 04:40:45,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:45,922 INFO L93 Difference]: Finished difference Result 6712 states and 9437 transitions. [2024-10-11 04:40:45,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 04:40:45,923 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.7727272727272725) internal successors, (127), 21 states have internal predecessors, (127), 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 56 [2024-10-11 04:40:45,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:45,934 INFO L225 Difference]: With dead ends: 6712 [2024-10-11 04:40:45,935 INFO L226 Difference]: Without dead ends: 4534 [2024-10-11 04:40:45,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=268, Invalid=788, Unknown=0, NotChecked=0, Total=1056 [2024-10-11 04:40:45,944 INFO L432 NwaCegarLoop]: 1488 mSDtfsCounter, 19390 mSDsluCounter, 3099 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19390 SdHoareTripleChecker+Valid, 4587 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:40:45,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19390 Valid, 4587 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 04:40:45,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4534 states. [2024-10-11 04:40:46,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4534 to 4242. [2024-10-11 04:40:46,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4242 states, 4240 states have (on average 1.432311320754717) internal successors, (6073), 4241 states have internal predecessors, (6073), 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-11 04:40:46,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4242 states to 4242 states and 6073 transitions. [2024-10-11 04:40:46,140 INFO L78 Accepts]: Start accepts. Automaton has 4242 states and 6073 transitions. Word has length 56 [2024-10-11 04:40:46,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:46,140 INFO L471 AbstractCegarLoop]: Abstraction has 4242 states and 6073 transitions. [2024-10-11 04:40:46,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.7727272727272725) internal successors, (127), 21 states have internal predecessors, (127), 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-11 04:40:46,141 INFO L276 IsEmpty]: Start isEmpty. Operand 4242 states and 6073 transitions. [2024-10-11 04:40:46,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 04:40:46,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:46,142 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 04:40:46,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 04:40:46,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:40:46,347 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:46,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:46,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1142870954, now seen corresponding path program 1 times [2024-10-11 04:40:46,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:46,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832457109] [2024-10-11 04:40:46,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:46,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:47,013 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:40:47,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:47,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832457109] [2024-10-11 04:40:47,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832457109] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:40:47,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911638261] [2024-10-11 04:40:47,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:47,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:40:47,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:40:47,016 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:40:47,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 04:40:47,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:47,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 04:40:47,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:40:47,767 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:40:47,767 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:40:48,569 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:40:48,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911638261] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:40:48,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:40:48,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 30 [2024-10-11 04:40:48,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422803187] [2024-10-11 04:40:48,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:40:48,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-11 04:40:48,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:48,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-11 04:40:48,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=756, Unknown=0, NotChecked=0, Total=870 [2024-10-11 04:40:48,572 INFO L87 Difference]: Start difference. First operand 4242 states and 6073 transitions. Second operand has 30 states, 30 states have (on average 4.133333333333334) internal successors, (124), 30 states have internal predecessors, (124), 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-11 04:40:49,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:49,776 INFO L93 Difference]: Finished difference Result 7033 states and 9776 transitions. [2024-10-11 04:40:49,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 04:40:49,776 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 4.133333333333334) internal successors, (124), 30 states have internal predecessors, (124), 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 57 [2024-10-11 04:40:49,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:49,789 INFO L225 Difference]: With dead ends: 7033 [2024-10-11 04:40:49,789 INFO L226 Difference]: Without dead ends: 5663 [2024-10-11 04:40:49,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=457, Invalid=1705, Unknown=0, NotChecked=0, Total=2162 [2024-10-11 04:40:49,794 INFO L432 NwaCegarLoop]: 1491 mSDtfsCounter, 12537 mSDsluCounter, 16375 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12537 SdHoareTripleChecker+Valid, 17866 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 04:40:49,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12537 Valid, 17866 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 04:40:49,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5663 states. [2024-10-11 04:40:49,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5663 to 4259. [2024-10-11 04:40:49,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4259 states, 4257 states have (on average 1.4272962179938924) internal successors, (6076), 4258 states have internal predecessors, (6076), 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-11 04:40:49,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4259 states to 4259 states and 6076 transitions. [2024-10-11 04:40:49,949 INFO L78 Accepts]: Start accepts. Automaton has 4259 states and 6076 transitions. Word has length 57 [2024-10-11 04:40:49,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:49,949 INFO L471 AbstractCegarLoop]: Abstraction has 4259 states and 6076 transitions. [2024-10-11 04:40:49,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.133333333333334) internal successors, (124), 30 states have internal predecessors, (124), 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-11 04:40:49,950 INFO L276 IsEmpty]: Start isEmpty. Operand 4259 states and 6076 transitions. [2024-10-11 04:40:49,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 04:40:49,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:49,951 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 04:40:49,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 04:40:50,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:40:50,155 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:50,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:50,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1615101446, now seen corresponding path program 1 times [2024-10-11 04:40:50,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:50,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757642004] [2024-10-11 04:40:50,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:50,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:50,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:50,919 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:40:50,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:50,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757642004] [2024-10-11 04:40:50,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757642004] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:40:50,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793283219] [2024-10-11 04:40:50,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:50,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:40:50,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:40:50,921 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:40:50,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 04:40:51,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:51,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-11 04:40:51,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:40:52,436 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:40:52,436 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:40:54,526 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:40:54,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793283219] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:40:54,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:40:54,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 16] total 38 [2024-10-11 04:40:54,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253544832] [2024-10-11 04:40:54,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:40:54,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-11 04:40:54,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:54,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-11 04:40:54,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1236, Unknown=0, NotChecked=0, Total=1406 [2024-10-11 04:40:54,529 INFO L87 Difference]: Start difference. First operand 4259 states and 6076 transitions. Second operand has 38 states, 38 states have (on average 4.0) internal successors, (152), 38 states have internal predecessors, (152), 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-11 04:40:57,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:57,157 INFO L93 Difference]: Finished difference Result 6201 states and 8656 transitions. [2024-10-11 04:40:57,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-11 04:40:57,158 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 4.0) internal successors, (152), 38 states have internal predecessors, (152), 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 57 [2024-10-11 04:40:57,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:57,165 INFO L225 Difference]: With dead ends: 6201 [2024-10-11 04:40:57,165 INFO L226 Difference]: Without dead ends: 3627 [2024-10-11 04:40:57,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1017 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=985, Invalid=3845, Unknown=0, NotChecked=0, Total=4830 [2024-10-11 04:40:57,171 INFO L432 NwaCegarLoop]: 1475 mSDtfsCounter, 22285 mSDsluCounter, 20792 mSDsCounter, 0 mSdLazyCounter, 1001 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22285 SdHoareTripleChecker+Valid, 22267 SdHoareTripleChecker+Invalid, 1041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:40:57,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22285 Valid, 22267 Invalid, 1041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1001 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 04:40:57,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3627 states. [2024-10-11 04:40:57,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3627 to 3317. [2024-10-11 04:40:57,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3317 states, 3315 states have (on average 1.4606334841628958) internal successors, (4842), 3316 states have internal predecessors, (4842), 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-11 04:40:57,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3317 states to 3317 states and 4842 transitions. [2024-10-11 04:40:57,281 INFO L78 Accepts]: Start accepts. Automaton has 3317 states and 4842 transitions. Word has length 57 [2024-10-11 04:40:57,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:57,282 INFO L471 AbstractCegarLoop]: Abstraction has 3317 states and 4842 transitions. [2024-10-11 04:40:57,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 4.0) internal successors, (152), 38 states have internal predecessors, (152), 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-11 04:40:57,282 INFO L276 IsEmpty]: Start isEmpty. Operand 3317 states and 4842 transitions. [2024-10-11 04:40:57,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 04:40:57,283 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:57,283 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 04:40:57,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 04:40:57,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:40:57,484 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:57,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:57,484 INFO L85 PathProgramCache]: Analyzing trace with hash -402890190, now seen corresponding path program 1 times [2024-10-11 04:40:57,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:57,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305960274] [2024-10-11 04:40:57,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:57,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:57,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:57,627 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 04:40:57,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:57,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305960274] [2024-10-11 04:40:57,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305960274] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:40:57,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939244326] [2024-10-11 04:40:57,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:57,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:40:57,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:40:57,630 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:40:57,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 04:40:57,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:57,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 04:40:57,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:40:57,889 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 04:40:57,890 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:40:58,050 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 04:40:58,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939244326] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:40:58,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:40:58,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 9 [2024-10-11 04:40:58,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664650110] [2024-10-11 04:40:58,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:40:58,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 04:40:58,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:58,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 04:40:58,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-11 04:40:58,052 INFO L87 Difference]: Start difference. First operand 3317 states and 4842 transitions. Second operand has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 states have internal predecessors, (157), 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-11 04:40:58,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:58,243 INFO L93 Difference]: Finished difference Result 7145 states and 9796 transitions. [2024-10-11 04:40:58,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 04:40:58,243 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 states have internal predecessors, (157), 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 58 [2024-10-11 04:40:58,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:58,253 INFO L225 Difference]: With dead ends: 7145 [2024-10-11 04:40:58,253 INFO L226 Difference]: Without dead ends: 4633 [2024-10-11 04:40:58,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-11 04:40:58,258 INFO L432 NwaCegarLoop]: 1510 mSDtfsCounter, 1496 mSDsluCounter, 3154 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1496 SdHoareTripleChecker+Valid, 4664 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:40:58,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1496 Valid, 4664 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:40:58,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4633 states. [2024-10-11 04:40:58,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4633 to 4393. [2024-10-11 04:40:58,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4393 states, 4391 states have (on average 1.3750854019585517) internal successors, (6038), 4392 states have internal predecessors, (6038), 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-11 04:40:58,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4393 states to 4393 states and 6038 transitions. [2024-10-11 04:40:58,426 INFO L78 Accepts]: Start accepts. Automaton has 4393 states and 6038 transitions. Word has length 58 [2024-10-11 04:40:58,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:58,426 INFO L471 AbstractCegarLoop]: Abstraction has 4393 states and 6038 transitions. [2024-10-11 04:40:58,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 states have internal predecessors, (157), 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-11 04:40:58,427 INFO L276 IsEmpty]: Start isEmpty. Operand 4393 states and 6038 transitions. [2024-10-11 04:40:58,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 04:40:58,427 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:58,428 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:40:58,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 04:40:58,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-10-11 04:40:58,632 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:58,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:58,633 INFO L85 PathProgramCache]: Analyzing trace with hash -56380255, now seen corresponding path program 1 times [2024-10-11 04:40:58,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:58,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196915682] [2024-10-11 04:40:58,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:58,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:58,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:58,682 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-11 04:40:58,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:58,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196915682] [2024-10-11 04:40:58,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196915682] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:40:58,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:40:58,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 04:40:58,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216160023] [2024-10-11 04:40:58,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:40:58,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:40:58,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:58,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:40:58,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:40:58,684 INFO L87 Difference]: Start difference. First operand 4393 states and 6038 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 2 states have internal predecessors, (62), 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-11 04:41:01,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:41:01,508 INFO L93 Difference]: Finished difference Result 5897 states and 8911 transitions. [2024-10-11 04:41:01,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:41:01,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 2 states have internal predecessors, (62), 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 62 [2024-10-11 04:41:01,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:41:01,519 INFO L225 Difference]: With dead ends: 5897 [2024-10-11 04:41:01,519 INFO L226 Difference]: Without dead ends: 5144 [2024-10-11 04:41:01,522 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-11 04:41:01,523 INFO L432 NwaCegarLoop]: 531 mSDtfsCounter, 805 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2264 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 2916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:41:01,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 538 Invalid, 2916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2264 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-11 04:41:01,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5144 states. [2024-10-11 04:41:01,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5144 to 5144. [2024-10-11 04:41:01,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5144 states, 5142 states have (on average 1.3646441073512252) internal successors, (7017), 5143 states have internal predecessors, (7017), 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-11 04:41:01,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5144 states to 5144 states and 7017 transitions. [2024-10-11 04:41:01,696 INFO L78 Accepts]: Start accepts. Automaton has 5144 states and 7017 transitions. Word has length 62 [2024-10-11 04:41:01,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:41:01,696 INFO L471 AbstractCegarLoop]: Abstraction has 5144 states and 7017 transitions. [2024-10-11 04:41:01,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 2 states have internal predecessors, (62), 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-11 04:41:01,697 INFO L276 IsEmpty]: Start isEmpty. Operand 5144 states and 7017 transitions. [2024-10-11 04:41:01,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 04:41:01,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:41:01,698 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2024-10-11 04:41:01,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 04:41:01,699 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:41:01,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:41:01,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1874846004, now seen corresponding path program 1 times [2024-10-11 04:41:01,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:41:01,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766192454] [2024-10-11 04:41:01,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:41:01,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:41:01,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:41:02,447 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 36 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:41:02,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:41:02,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766192454] [2024-10-11 04:41:02,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766192454] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:41:02,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145977770] [2024-10-11 04:41:02,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:41:02,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:41:02,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:41:02,449 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:41:02,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 04:41:02,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:41:02,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-11 04:41:02,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:41:04,893 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 52 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-11 04:41:04,893 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:41:08,375 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 19 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:41:08,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145977770] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:41:08,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:41:08,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 22, 24] total 57 [2024-10-11 04:41:08,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290201075] [2024-10-11 04:41:08,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:41:08,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-10-11 04:41:08,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:41:08,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-10-11 04:41:08,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=400, Invalid=2792, Unknown=0, NotChecked=0, Total=3192 [2024-10-11 04:41:08,379 INFO L87 Difference]: Start difference. First operand 5144 states and 7017 transitions. Second operand has 57 states, 57 states have (on average 4.157894736842105) internal successors, (237), 57 states have internal predecessors, (237), 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)