./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_label05.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_label05.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 55a25aaba499ad6f05f5b24cde70628308432569fd1f75e76cd806a685179688 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:40:27,311 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:40:27,367 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:27,372 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:40:27,372 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:40:27,392 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:40:27,393 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:40:27,393 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:40:27,393 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:40:27,394 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:40:27,394 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:40:27,394 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:40:27,395 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:40:27,395 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:40:27,395 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:40:27,395 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:40:27,396 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:40:27,396 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:40:27,396 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:40:27,396 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:40:27,397 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:40:27,397 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:40:27,397 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:40:27,397 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:40:27,398 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:40:27,398 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:40:27,398 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:40:27,398 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:40:27,399 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:40:27,399 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:40:27,399 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:40:27,399 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:40:27,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:40:27,400 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:40:27,400 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:40:27,400 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:40:27,400 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:40:27,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:40:27,401 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:40:27,401 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:40:27,401 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:40:27,402 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:40:27,402 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 -> 55a25aaba499ad6f05f5b24cde70628308432569fd1f75e76cd806a685179688 [2024-10-11 04:40:27,597 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:40:27,612 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:40:27,614 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:40:27,615 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:40:27,615 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:40:27,616 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_label05.c [2024-10-11 04:40:28,814 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:40:29,163 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:40:29,164 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label05.c [2024-10-11 04:40:29,188 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/54b314416/bc16925d159d43558190e6ea5b472559/FLAG48d9140a4 [2024-10-11 04:40:29,201 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/54b314416/bc16925d159d43558190e6ea5b472559 [2024-10-11 04:40:29,203 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:40:29,204 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:40:29,205 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:40:29,206 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:40:29,210 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:40:29,211 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:40:29" (1/1) ... [2024-10-11 04:40:29,211 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@94b71f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:40:29, skipping insertion in model container [2024-10-11 04:40:29,212 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:40:29" (1/1) ... [2024-10-11 04:40:29,302 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:40:29,566 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_label05.c[6391,6404] [2024-10-11 04:40:29,609 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_label05.c[13327,13340] [2024-10-11 04:40:30,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:40:30,101 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:40:30,130 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_label05.c[6391,6404] [2024-10-11 04:40:30,144 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_label05.c[13327,13340] [2024-10-11 04:40:30,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:40:30,493 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:40:30,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:40:30 WrapperNode [2024-10-11 04:40:30,493 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:40:30,494 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:40:30,494 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:40:30,494 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:40:30,499 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:30" (1/1) ... [2024-10-11 04:40:30,539 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:30" (1/1) ... [2024-10-11 04:40:30,761 INFO L138 Inliner]: procedures = 33, calls = 19, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 4984 [2024-10-11 04:40:30,761 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:40:30,762 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:40:30,762 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:40:30,762 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:40:30,770 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:30" (1/1) ... [2024-10-11 04:40:30,771 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:30" (1/1) ... [2024-10-11 04:40:30,814 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:30" (1/1) ... [2024-10-11 04:40:30,963 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:30,963 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:30" (1/1) ... [2024-10-11 04:40:30,964 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:30" (1/1) ... [2024-10-11 04:40:31,100 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:30" (1/1) ... [2024-10-11 04:40:31,127 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:30" (1/1) ... [2024-10-11 04:40:31,146 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:30" (1/1) ... [2024-10-11 04:40:31,161 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:30" (1/1) ... [2024-10-11 04:40:31,211 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:40:31,213 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:40:31,214 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:40:31,214 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:40:31,214 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:40:30" (1/1) ... [2024-10-11 04:40:31,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:40:31,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:40:31,242 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:31,244 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:31,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:40:31,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:40:31,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:40:31,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:40:31,370 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:40:31,372 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:40:34,662 INFO L? ?]: Removed 732 outVars from TransFormulas that were not future-live. [2024-10-11 04:40:34,663 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:40:34,725 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:40:34,726 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 04:40:34,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:40:34 BoogieIcfgContainer [2024-10-11 04:40:34,726 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:40:34,728 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:40:34,728 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:40:34,731 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:40:34,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:40:29" (1/3) ... [2024-10-11 04:40:34,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2495f0e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:40:34, skipping insertion in model container [2024-10-11 04:40:34,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:40:30" (2/3) ... [2024-10-11 04:40:34,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2495f0e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:40:34, skipping insertion in model container [2024-10-11 04:40:34,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:40:34" (3/3) ... [2024-10-11 04:40:34,733 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label05.c [2024-10-11 04:40:34,745 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:40:34,745 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:40:34,810 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:40:34,816 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;@6340f8d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:40:34,816 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:40:34,824 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:34,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 04:40:34,832 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:34,833 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:34,833 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:34,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:34,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1100216757, now seen corresponding path program 1 times [2024-10-11 04:40:34,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:34,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081925571] [2024-10-11 04:40:34,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:34,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:34,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:35,030 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:35,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:35,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081925571] [2024-10-11 04:40:35,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081925571] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:40:35,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:40:35,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 04:40:35,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111432066] [2024-10-11 04:40:35,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:40:35,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 04:40:35,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:35,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 04:40:35,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 04:40:35,097 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:35,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:35,184 INFO L93 Difference]: Finished difference Result 1594 states and 3146 transitions. [2024-10-11 04:40:35,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 04:40:35,188 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:35,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:35,200 INFO L225 Difference]: With dead ends: 1594 [2024-10-11 04:40:35,201 INFO L226 Difference]: Without dead ends: 803 [2024-10-11 04:40:35,205 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:35,208 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:35,209 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:35,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2024-10-11 04:40:35,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 803. [2024-10-11 04:40:35,273 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:35,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1521 transitions. [2024-10-11 04:40:35,282 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1521 transitions. Word has length 17 [2024-10-11 04:40:35,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:35,282 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1521 transitions. [2024-10-11 04:40:35,282 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:35,282 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1521 transitions. [2024-10-11 04:40:35,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 04:40:35,285 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:35,285 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:35,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:40:35,285 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:35,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:35,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1687022771, now seen corresponding path program 1 times [2024-10-11 04:40:35,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:35,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302395392] [2024-10-11 04:40:35,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:35,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:35,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:35,439 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:35,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:35,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302395392] [2024-10-11 04:40:35,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302395392] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:40:35,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:40:35,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 04:40:35,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146440239] [2024-10-11 04:40:35,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:40:35,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:40:35,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:35,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:40:35,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:40:35,444 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:35,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:35,518 INFO L93 Difference]: Finished difference Result 864 states and 1616 transitions. [2024-10-11 04:40:35,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:40:35,518 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:35,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:35,523 INFO L225 Difference]: With dead ends: 864 [2024-10-11 04:40:35,523 INFO L226 Difference]: Without dead ends: 832 [2024-10-11 04:40:35,524 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:35,525 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:35,525 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:35,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2024-10-11 04:40:35,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 803. [2024-10-11 04:40:35,544 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:35,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1505 transitions. [2024-10-11 04:40:35,546 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1505 transitions. Word has length 17 [2024-10-11 04:40:35,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:35,546 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1505 transitions. [2024-10-11 04:40:35,547 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:35,547 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1505 transitions. [2024-10-11 04:40:35,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 04:40:35,548 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:35,548 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:35,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:40:35,549 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:35,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:35,549 INFO L85 PathProgramCache]: Analyzing trace with hash 613121839, now seen corresponding path program 1 times [2024-10-11 04:40:35,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:35,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782182406] [2024-10-11 04:40:35,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:35,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:35,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:35,681 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:35,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:35,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782182406] [2024-10-11 04:40:35,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782182406] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:40:35,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:40:35,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:40:35,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320822883] [2024-10-11 04:40:35,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:40:35,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:40:35,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:35,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:40:35,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:40:35,683 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:35,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:35,789 INFO L93 Difference]: Finished difference Result 977 states and 1781 transitions. [2024-10-11 04:40:35,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:40:35,790 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:35,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:35,793 INFO L225 Difference]: With dead ends: 977 [2024-10-11 04:40:35,793 INFO L226 Difference]: Without dead ends: 948 [2024-10-11 04:40:35,793 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:35,794 INFO L432 NwaCegarLoop]: 1498 mSDtfsCounter, 4578 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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:35,795 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:35,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2024-10-11 04:40:35,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 830. [2024-10-11 04:40:35,806 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:35,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1548 transitions. [2024-10-11 04:40:35,808 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1548 transitions. Word has length 32 [2024-10-11 04:40:35,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:35,809 INFO L471 AbstractCegarLoop]: Abstraction has 830 states and 1548 transitions. [2024-10-11 04:40:35,809 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:35,809 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1548 transitions. [2024-10-11 04:40:35,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 04:40:35,810 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:35,810 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:35,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:40:35,810 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:35,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:35,811 INFO L85 PathProgramCache]: Analyzing trace with hash 675954815, now seen corresponding path program 1 times [2024-10-11 04:40:35,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:35,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459935747] [2024-10-11 04:40:35,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:35,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:35,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:35,871 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:35,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:35,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459935747] [2024-10-11 04:40:35,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459935747] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:40:35,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:40:35,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:40:35,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069382128] [2024-10-11 04:40:35,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:40:35,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:40:35,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:35,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:40:35,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:40:35,874 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:35,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:35,902 INFO L93 Difference]: Finished difference Result 931 states and 1707 transitions. [2024-10-11 04:40:35,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:40:35,902 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:35,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:35,905 INFO L225 Difference]: With dead ends: 931 [2024-10-11 04:40:35,905 INFO L226 Difference]: Without dead ends: 875 [2024-10-11 04:40:35,907 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:35,909 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:35,910 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:35,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2024-10-11 04:40:35,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 873. [2024-10-11 04:40:35,922 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:35,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1614 transitions. [2024-10-11 04:40:35,924 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1614 transitions. Word has length 34 [2024-10-11 04:40:35,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:35,925 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1614 transitions. [2024-10-11 04:40:35,925 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:35,925 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1614 transitions. [2024-10-11 04:40:35,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 04:40:35,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:35,928 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:35,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:40:35,929 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:35,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:35,929 INFO L85 PathProgramCache]: Analyzing trace with hash 678099767, now seen corresponding path program 1 times [2024-10-11 04:40:35,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:35,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542102191] [2024-10-11 04:40:35,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:35,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:35,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:36,040 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:36,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:36,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542102191] [2024-10-11 04:40:36,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542102191] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:40:36,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:40:36,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:40:36,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535583582] [2024-10-11 04:40:36,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:40:36,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:40:36,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:36,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:40:36,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:40:36,042 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:36,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:36,103 INFO L93 Difference]: Finished difference Result 974 states and 1770 transitions. [2024-10-11 04:40:36,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 04:40:36,104 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:36,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:36,106 INFO L225 Difference]: With dead ends: 974 [2024-10-11 04:40:36,106 INFO L226 Difference]: Without dead ends: 875 [2024-10-11 04:40:36,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:40:36,109 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:36,109 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:36,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2024-10-11 04:40:36,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 873. [2024-10-11 04:40:36,121 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:36,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1612 transitions. [2024-10-11 04:40:36,124 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1612 transitions. Word has length 34 [2024-10-11 04:40:36,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:36,125 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1612 transitions. [2024-10-11 04:40:36,125 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:36,125 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1612 transitions. [2024-10-11 04:40:36,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 04:40:36,127 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:36,127 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:36,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:40:36,128 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:36,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:36,128 INFO L85 PathProgramCache]: Analyzing trace with hash -582127364, now seen corresponding path program 1 times [2024-10-11 04:40:36,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:36,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748189866] [2024-10-11 04:40:36,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:36,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:36,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:36,263 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:36,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:36,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748189866] [2024-10-11 04:40:36,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748189866] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:40:36,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:40:36,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 04:40:36,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60964972] [2024-10-11 04:40:36,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:40:36,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:40:36,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:36,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:40:36,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:40:36,267 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:36,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:36,301 INFO L93 Difference]: Finished difference Result 879 states and 1619 transitions. [2024-10-11 04:40:36,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:40:36,303 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:36,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:36,306 INFO L225 Difference]: With dead ends: 879 [2024-10-11 04:40:36,306 INFO L226 Difference]: Without dead ends: 877 [2024-10-11 04:40:36,307 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:36,307 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:36,307 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:36,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2024-10-11 04:40:36,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 877. [2024-10-11 04:40:36,317 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:36,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1615 transitions. [2024-10-11 04:40:36,320 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1615 transitions. Word has length 35 [2024-10-11 04:40:36,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:36,320 INFO L471 AbstractCegarLoop]: Abstraction has 877 states and 1615 transitions. [2024-10-11 04:40:36,320 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:36,320 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1615 transitions. [2024-10-11 04:40:36,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 04:40:36,321 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:36,321 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:36,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:40:36,321 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:36,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:36,321 INFO L85 PathProgramCache]: Analyzing trace with hash 2127458807, now seen corresponding path program 1 times [2024-10-11 04:40:36,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:36,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992793668] [2024-10-11 04:40:36,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:36,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:36,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:36,354 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:36,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:36,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992793668] [2024-10-11 04:40:36,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992793668] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:40:36,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:40:36,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:40:36,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652758075] [2024-10-11 04:40:36,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:40:36,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:40:36,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:36,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:40:36,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:40:36,356 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:36,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:36,383 INFO L93 Difference]: Finished difference Result 991 states and 1788 transitions. [2024-10-11 04:40:36,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:40:36,383 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:36,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:36,386 INFO L225 Difference]: With dead ends: 991 [2024-10-11 04:40:36,386 INFO L226 Difference]: Without dead ends: 931 [2024-10-11 04:40:36,387 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:36,387 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:36,387 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:36,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2024-10-11 04:40:36,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 929. [2024-10-11 04:40:36,399 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:36,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1692 transitions. [2024-10-11 04:40:36,401 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1692 transitions. Word has length 36 [2024-10-11 04:40:36,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:36,401 INFO L471 AbstractCegarLoop]: Abstraction has 929 states and 1692 transitions. [2024-10-11 04:40:36,402 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:36,402 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1692 transitions. [2024-10-11 04:40:36,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 04:40:36,402 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:36,402 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:36,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:40:36,403 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:36,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:36,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1501802743, now seen corresponding path program 1 times [2024-10-11 04:40:36,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:36,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365479827] [2024-10-11 04:40:36,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:36,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:36,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:36,433 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:36,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:36,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365479827] [2024-10-11 04:40:36,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365479827] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:40:36,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:40:36,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:40:36,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39481692] [2024-10-11 04:40:36,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:40:36,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:40:36,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:36,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:40:36,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:40:36,435 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:36,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:36,457 INFO L93 Difference]: Finished difference Result 1211 states and 2112 transitions. [2024-10-11 04:40:36,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:40:36,458 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:36,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:36,461 INFO L225 Difference]: With dead ends: 1211 [2024-10-11 04:40:36,461 INFO L226 Difference]: Without dead ends: 1058 [2024-10-11 04:40:36,461 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:36,462 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:36,462 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:36,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2024-10-11 04:40:36,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 1056. [2024-10-11 04:40:36,475 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:36,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1874 transitions. [2024-10-11 04:40:36,477 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1874 transitions. Word has length 36 [2024-10-11 04:40:36,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:36,478 INFO L471 AbstractCegarLoop]: Abstraction has 1056 states and 1874 transitions. [2024-10-11 04:40:36,478 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:36,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1874 transitions. [2024-10-11 04:40:36,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 04:40:36,478 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:36,478 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:36,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:40:36,479 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:36,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:36,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1904431113, now seen corresponding path program 1 times [2024-10-11 04:40:36,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:36,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15437293] [2024-10-11 04:40:36,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:36,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:36,506 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:36,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:36,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15437293] [2024-10-11 04:40:36,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15437293] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:40:36,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:40:36,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:40:36,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591711972] [2024-10-11 04:40:36,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:40:36,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:40:36,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:36,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:40:36,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:40:36,508 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:36,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:36,535 INFO L93 Difference]: Finished difference Result 1568 states and 2616 transitions. [2024-10-11 04:40:36,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:40:36,535 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:36,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:36,539 INFO L225 Difference]: With dead ends: 1568 [2024-10-11 04:40:36,539 INFO L226 Difference]: Without dead ends: 1288 [2024-10-11 04:40:36,540 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:36,541 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:36,542 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:36,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2024-10-11 04:40:36,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 1286. [2024-10-11 04:40:36,561 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:36,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 2190 transitions. [2024-10-11 04:40:36,565 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 2190 transitions. Word has length 36 [2024-10-11 04:40:36,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:36,565 INFO L471 AbstractCegarLoop]: Abstraction has 1286 states and 2190 transitions. [2024-10-11 04:40:36,566 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:36,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 2190 transitions. [2024-10-11 04:40:36,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 04:40:36,566 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:36,566 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:36,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:40:36,567 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:36,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:36,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1853448570, now seen corresponding path program 1 times [2024-10-11 04:40:36,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:36,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092777770] [2024-10-11 04:40:36,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:36,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:36,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:36,673 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:36,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:36,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092777770] [2024-10-11 04:40:36,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092777770] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:40:36,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:40:36,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:40:36,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469762099] [2024-10-11 04:40:36,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:40:36,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:40:36,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:36,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:40:36,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:40:36,677 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:36,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:36,772 INFO L93 Difference]: Finished difference Result 2794 states and 4342 transitions. [2024-10-11 04:40:36,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 04:40:36,772 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:36,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:36,781 INFO L225 Difference]: With dead ends: 2794 [2024-10-11 04:40:36,781 INFO L226 Difference]: Without dead ends: 2424 [2024-10-11 04:40:36,783 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:36,783 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.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:40:36,784 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.0s Time] [2024-10-11 04:40:36,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2424 states. [2024-10-11 04:40:36,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2424 to 1726. [2024-10-11 04:40:36,814 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:36,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 2810 transitions. [2024-10-11 04:40:36,818 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 2810 transitions. Word has length 50 [2024-10-11 04:40:36,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:36,819 INFO L471 AbstractCegarLoop]: Abstraction has 1726 states and 2810 transitions. [2024-10-11 04:40:36,819 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:36,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2810 transitions. [2024-10-11 04:40:36,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 04:40:36,820 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:36,820 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:36,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:40:36,820 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:36,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:36,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1815862662, now seen corresponding path program 1 times [2024-10-11 04:40:36,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:36,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218729287] [2024-10-11 04:40:36,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:36,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:36,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:36,930 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:36,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:36,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218729287] [2024-10-11 04:40:36,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218729287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:40:36,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:40:36,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:40:36,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045168795] [2024-10-11 04:40:36,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:40:36,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:40:36,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:36,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:40:36,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:40:36,932 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:37,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:37,039 INFO L93 Difference]: Finished difference Result 3302 states and 5062 transitions. [2024-10-11 04:40:37,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 04:40:37,040 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:37,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:37,048 INFO L225 Difference]: With dead ends: 3302 [2024-10-11 04:40:37,049 INFO L226 Difference]: Without dead ends: 2792 [2024-10-11 04:40:37,050 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:37,050 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.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:40:37,051 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.0s Time] [2024-10-11 04:40:37,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2792 states. [2024-10-11 04:40:37,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2792 to 2418. [2024-10-11 04:40:37,108 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:37,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 3782 transitions. [2024-10-11 04:40:37,114 INFO L78 Accepts]: Start accepts. Automaton has 2418 states and 3782 transitions. Word has length 50 [2024-10-11 04:40:37,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:37,115 INFO L471 AbstractCegarLoop]: Abstraction has 2418 states and 3782 transitions. [2024-10-11 04:40:37,115 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:37,116 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 3782 transitions. [2024-10-11 04:40:37,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 04:40:37,116 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:37,116 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:37,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:40:37,117 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:37,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:37,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1590371194, now seen corresponding path program 1 times [2024-10-11 04:40:37,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:37,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320886555] [2024-10-11 04:40:37,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:37,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:37,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:37,228 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:37,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:37,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320886555] [2024-10-11 04:40:37,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320886555] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:40:37,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:40:37,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:40:37,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355180692] [2024-10-11 04:40:37,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:40:37,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:40:37,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:37,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:40:37,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:40:37,230 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:37,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:37,326 INFO L93 Difference]: Finished difference Result 3810 states and 5778 transitions. [2024-10-11 04:40:37,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 04:40:37,327 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:37,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:37,336 INFO L225 Difference]: With dead ends: 3810 [2024-10-11 04:40:37,336 INFO L226 Difference]: Without dead ends: 3300 [2024-10-11 04:40:37,337 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:37,338 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.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:40:37,338 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.0s Time] [2024-10-11 04:40:37,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3300 states. [2024-10-11 04:40:37,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3300 to 2926. [2024-10-11 04:40:37,393 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:37,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2926 states to 2926 states and 4498 transitions. [2024-10-11 04:40:37,401 INFO L78 Accepts]: Start accepts. Automaton has 2926 states and 4498 transitions. Word has length 50 [2024-10-11 04:40:37,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:37,401 INFO L471 AbstractCegarLoop]: Abstraction has 2926 states and 4498 transitions. [2024-10-11 04:40:37,402 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:37,402 INFO L276 IsEmpty]: Start isEmpty. Operand 2926 states and 4498 transitions. [2024-10-11 04:40:37,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 04:40:37,402 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:37,403 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:37,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 04:40:37,404 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:37,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:37,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1183432324, now seen corresponding path program 1 times [2024-10-11 04:40:37,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:37,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157043033] [2024-10-11 04:40:37,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:37,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:37,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:37,466 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:37,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:37,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157043033] [2024-10-11 04:40:37,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157043033] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:40:37,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:40:37,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:40:37,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843861815] [2024-10-11 04:40:37,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:40:37,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:40:37,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:37,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:40:37,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:40:37,469 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:37,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:37,518 INFO L93 Difference]: Finished difference Result 5078 states and 7536 transitions. [2024-10-11 04:40:37,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:40:37,519 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:37,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:37,526 INFO L225 Difference]: With dead ends: 5078 [2024-10-11 04:40:37,526 INFO L226 Difference]: Without dead ends: 2928 [2024-10-11 04:40:37,529 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:37,530 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:37,531 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:37,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2024-10-11 04:40:37,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 2926. [2024-10-11 04:40:37,585 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:37,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2926 states to 2926 states and 4448 transitions. [2024-10-11 04:40:37,591 INFO L78 Accepts]: Start accepts. Automaton has 2926 states and 4448 transitions. Word has length 51 [2024-10-11 04:40:37,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:37,591 INFO L471 AbstractCegarLoop]: Abstraction has 2926 states and 4448 transitions. [2024-10-11 04:40:37,591 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:37,592 INFO L276 IsEmpty]: Start isEmpty. Operand 2926 states and 4448 transitions. [2024-10-11 04:40:37,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 04:40:37,592 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:37,592 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:37,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 04:40:37,592 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:37,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:37,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1165828046, now seen corresponding path program 1 times [2024-10-11 04:40:37,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:37,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220138520] [2024-10-11 04:40:37,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:37,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:37,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:37,663 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:37,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:37,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220138520] [2024-10-11 04:40:37,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220138520] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:40:37,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:40:37,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:40:37,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526293688] [2024-10-11 04:40:37,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:40:37,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:40:37,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:37,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:40:37,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:40:37,665 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:37,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:37,699 INFO L93 Difference]: Finished difference Result 3772 states and 5635 transitions. [2024-10-11 04:40:37,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:40:37,699 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:37,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:37,704 INFO L225 Difference]: With dead ends: 3772 [2024-10-11 04:40:37,704 INFO L226 Difference]: Without dead ends: 1622 [2024-10-11 04:40:37,706 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:37,707 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:37,707 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:37,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2024-10-11 04:40:37,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1615. [2024-10-11 04:40:37,734 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:37,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 2623 transitions. [2024-10-11 04:40:37,737 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 2623 transitions. Word has length 52 [2024-10-11 04:40:37,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:37,738 INFO L471 AbstractCegarLoop]: Abstraction has 1615 states and 2623 transitions. [2024-10-11 04:40:37,738 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:37,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2623 transitions. [2024-10-11 04:40:37,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 04:40:37,738 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:37,739 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:37,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 04:40:37,739 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:37,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:37,739 INFO L85 PathProgramCache]: Analyzing trace with hash 2138930058, now seen corresponding path program 1 times [2024-10-11 04:40:37,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:37,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148675006] [2024-10-11 04:40:37,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:37,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:37,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:37,791 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:37,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:37,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148675006] [2024-10-11 04:40:37,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148675006] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:40:37,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:40:37,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:40:37,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541017514] [2024-10-11 04:40:37,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:40:37,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:40:37,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:37,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:40:37,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:40:37,793 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:37,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:37,817 INFO L93 Difference]: Finished difference Result 2033 states and 3201 transitions. [2024-10-11 04:40:37,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:40:37,821 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:37,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:37,825 INFO L225 Difference]: With dead ends: 2033 [2024-10-11 04:40:37,828 INFO L226 Difference]: Without dead ends: 1203 [2024-10-11 04:40:37,829 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:37,829 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:37,829 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:37,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2024-10-11 04:40:37,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1201. [2024-10-11 04:40:37,846 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:37,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 1201 states and 2038 transitions. [2024-10-11 04:40:37,849 INFO L78 Accepts]: Start accepts. Automaton has 1201 states and 2038 transitions. Word has length 53 [2024-10-11 04:40:37,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:37,849 INFO L471 AbstractCegarLoop]: Abstraction has 1201 states and 2038 transitions. [2024-10-11 04:40:37,849 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:37,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 2038 transitions. [2024-10-11 04:40:37,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 04:40:37,850 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:37,850 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:37,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 04:40:37,851 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:37,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:37,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1489407768, now seen corresponding path program 1 times [2024-10-11 04:40:37,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:37,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719235707] [2024-10-11 04:40:37,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:37,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:37,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:39,365 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:39,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:39,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719235707] [2024-10-11 04:40:39,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719235707] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:40:39,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271520297] [2024-10-11 04:40:39,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:39,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:40:39,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:40:39,367 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:39,368 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:39,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:39,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 04:40:39,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:40:39,817 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:39,818 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:40:40,415 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:40,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271520297] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:40:40,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:40:40,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2024-10-11 04:40:40,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031767067] [2024-10-11 04:40:40,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:40:40,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-11 04:40:40,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:40,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-11 04:40:40,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2024-10-11 04:40:40,417 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:42,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:42,892 INFO L93 Difference]: Finished difference Result 2689 states and 4060 transitions. [2024-10-11 04:40:42,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-11 04:40:42,892 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:42,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:42,902 INFO L225 Difference]: With dead ends: 2689 [2024-10-11 04:40:42,902 INFO L226 Difference]: Without dead ends: 2273 [2024-10-11 04:40:42,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=813, Invalid=3093, Unknown=0, NotChecked=0, Total=3906 [2024-10-11 04:40:42,907 INFO L432 NwaCegarLoop]: 1477 mSDtfsCounter, 24395 mSDsluCounter, 6190 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2024-10-11 04:40:42,907 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.4s Time] [2024-10-11 04:40:42,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2273 states. [2024-10-11 04:40:42,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2273 to 2220. [2024-10-11 04:40:42,955 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:42,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2220 states to 2220 states and 3387 transitions. [2024-10-11 04:40:42,960 INFO L78 Accepts]: Start accepts. Automaton has 2220 states and 3387 transitions. Word has length 55 [2024-10-11 04:40:42,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:42,960 INFO L471 AbstractCegarLoop]: Abstraction has 2220 states and 3387 transitions. [2024-10-11 04:40:42,961 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:42,961 INFO L276 IsEmpty]: Start isEmpty. Operand 2220 states and 3387 transitions. [2024-10-11 04:40:42,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 04:40:42,961 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:42,961 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:42,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 04:40:43,165 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:43,166 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:43,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:43,167 INFO L85 PathProgramCache]: Analyzing trace with hash -294784256, now seen corresponding path program 1 times [2024-10-11 04:40:43,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:43,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424638192] [2024-10-11 04:40:43,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:43,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:43,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:43,377 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,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:43,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424638192] [2024-10-11 04:40:43,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424638192] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:40:43,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163299476] [2024-10-11 04:40:43,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:43,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:40:43,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:40:43,380 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:43,381 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:43,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:43,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 04:40:43,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:40:43,667 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,667 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:40:44,147 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:44,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163299476] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:40:44,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:40:44,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2024-10-11 04:40:44,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856649205] [2024-10-11 04:40:44,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:40:44,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 04:40:44,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:44,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 04:40:44,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2024-10-11 04:40:44,149 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:44,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:44,426 INFO L93 Difference]: Finished difference Result 4415 states and 6352 transitions. [2024-10-11 04:40:44,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 04:40:44,426 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:44,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:44,431 INFO L225 Difference]: With dead ends: 4415 [2024-10-11 04:40:44,431 INFO L226 Difference]: Without dead ends: 2980 [2024-10-11 04:40:44,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=238, Invalid=692, Unknown=0, NotChecked=0, Total=930 [2024-10-11 04:40:44,433 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:40:44,433 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.1s Time] [2024-10-11 04:40:44,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2980 states. [2024-10-11 04:40:44,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2980 to 2976. [2024-10-11 04:40:44,496 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,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2976 states to 2976 states and 4410 transitions. [2024-10-11 04:40:44,503 INFO L78 Accepts]: Start accepts. Automaton has 2976 states and 4410 transitions. Word has length 56 [2024-10-11 04:40:44,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:44,503 INFO L471 AbstractCegarLoop]: Abstraction has 2976 states and 4410 transitions. [2024-10-11 04:40:44,504 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,504 INFO L276 IsEmpty]: Start isEmpty. Operand 2976 states and 4410 transitions. [2024-10-11 04:40:44,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 04:40:44,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:44,504 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,519 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,705 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,705 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:44,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:44,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1035298560, now seen corresponding path program 1 times [2024-10-11 04:40:44,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:44,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970350758] [2024-10-11 04:40:44,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:44,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:44,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:44,932 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,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:44,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970350758] [2024-10-11 04:40:44,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970350758] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:40:44,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167543450] [2024-10-11 04:40:44,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:44,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:40:44,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:40:44,934 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,935 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:45,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:45,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 04:40:45,006 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:40:45,250 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,251 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:40:45,573 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,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167543450] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:40:45,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:40:45,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2024-10-11 04:40:45,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140764110] [2024-10-11 04:40:45,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:40:45,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 04:40:45,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:45,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 04:40:45,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2024-10-11 04:40:45,575 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,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:45,993 INFO L93 Difference]: Finished difference Result 6712 states and 9437 transitions. [2024-10-11 04:40:45,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 04:40:45,994 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,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:46,002 INFO L225 Difference]: With dead ends: 6712 [2024-10-11 04:40:46,002 INFO L226 Difference]: Without dead ends: 4534 [2024-10-11 04:40:46,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=268, Invalid=788, Unknown=0, NotChecked=0, Total=1056 [2024-10-11 04:40:46,005 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:40:46,005 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.1s Time] [2024-10-11 04:40:46,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4534 states. [2024-10-11 04:40:46,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4534 to 4242. [2024-10-11 04:40:46,146 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,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4242 states to 4242 states and 6073 transitions. [2024-10-11 04:40:46,152 INFO L78 Accepts]: Start accepts. Automaton has 4242 states and 6073 transitions. Word has length 56 [2024-10-11 04:40:46,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:46,153 INFO L471 AbstractCegarLoop]: Abstraction has 4242 states and 6073 transitions. [2024-10-11 04:40:46,153 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,153 INFO L276 IsEmpty]: Start isEmpty. Operand 4242 states and 6073 transitions. [2024-10-11 04:40:46,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 04:40:46,154 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:46,154 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,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 04:40:46,354 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,355 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:46,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:46,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1142870954, now seen corresponding path program 1 times [2024-10-11 04:40:46,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:46,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954761496] [2024-10-11 04:40:46,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:46,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:46,920 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:46,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:46,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954761496] [2024-10-11 04:40:46,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954761496] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:40:46,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447234053] [2024-10-11 04:40:46,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:46,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:40:46,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:40:46,923 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:46,925 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:46,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:46,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 04:40:46,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:40:47,446 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,447 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:40:47,958 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,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447234053] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:40:47,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:40:47,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 30 [2024-10-11 04:40:47,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145997336] [2024-10-11 04:40:47,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:40:47,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-11 04:40:47,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:47,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-11 04:40:47,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=756, Unknown=0, NotChecked=0, Total=870 [2024-10-11 04:40:47,960 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:48,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:48,853 INFO L93 Difference]: Finished difference Result 7033 states and 9776 transitions. [2024-10-11 04:40:48,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 04:40:48,854 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:48,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:48,863 INFO L225 Difference]: With dead ends: 7033 [2024-10-11 04:40:48,863 INFO L226 Difference]: Without dead ends: 5663 [2024-10-11 04:40:48,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=457, Invalid=1705, Unknown=0, NotChecked=0, Total=2162 [2024-10-11 04:40:48,867 INFO L432 NwaCegarLoop]: 1491 mSDtfsCounter, 12537 mSDsluCounter, 16375 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:40:48,867 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.3s Time] [2024-10-11 04:40:48,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5663 states. [2024-10-11 04:40:48,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5663 to 4259. [2024-10-11 04:40:48,962 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:48,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4259 states to 4259 states and 6076 transitions. [2024-10-11 04:40:48,967 INFO L78 Accepts]: Start accepts. Automaton has 4259 states and 6076 transitions. Word has length 57 [2024-10-11 04:40:48,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:48,968 INFO L471 AbstractCegarLoop]: Abstraction has 4259 states and 6076 transitions. [2024-10-11 04:40:48,968 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:48,968 INFO L276 IsEmpty]: Start isEmpty. Operand 4259 states and 6076 transitions. [2024-10-11 04:40:48,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 04:40:48,968 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:48,969 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:48,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 04:40:49,173 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:49,173 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:49,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:49,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1615101446, now seen corresponding path program 1 times [2024-10-11 04:40:49,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:49,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613326996] [2024-10-11 04:40:49,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:49,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:49,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:49,735 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:49,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:49,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613326996] [2024-10-11 04:40:49,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613326996] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:40:49,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846612464] [2024-10-11 04:40:49,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:49,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:40:49,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:40:49,738 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:49,739 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:49,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:49,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-11 04:40:49,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:40:50,934 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:50,934 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:40:52,589 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:52,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846612464] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:40:52,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:40:52,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 16] total 38 [2024-10-11 04:40:52,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834476997] [2024-10-11 04:40:52,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:40:52,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-11 04:40:52,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:52,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-11 04:40:52,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1236, Unknown=0, NotChecked=0, Total=1406 [2024-10-11 04:40:52,592 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:54,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:54,841 INFO L93 Difference]: Finished difference Result 6201 states and 8656 transitions. [2024-10-11 04:40:54,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-11 04:40:54,842 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:54,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:54,847 INFO L225 Difference]: With dead ends: 6201 [2024-10-11 04:40:54,848 INFO L226 Difference]: Without dead ends: 3627 [2024-10-11 04:40:54,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1017 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=985, Invalid=3845, Unknown=0, NotChecked=0, Total=4830 [2024-10-11 04:40:54,852 INFO L432 NwaCegarLoop]: 1475 mSDtfsCounter, 22285 mSDsluCounter, 20792 mSDsCounter, 0 mSdLazyCounter, 1001 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22285 SdHoareTripleChecker+Valid, 22267 SdHoareTripleChecker+Invalid, 1041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:40:54,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22285 Valid, 22267 Invalid, 1041 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [40 Valid, 1001 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 04:40:54,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3627 states. [2024-10-11 04:40:54,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3627 to 3317. [2024-10-11 04:40:54,970 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:54,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3317 states to 3317 states and 4842 transitions. [2024-10-11 04:40:54,975 INFO L78 Accepts]: Start accepts. Automaton has 3317 states and 4842 transitions. Word has length 57 [2024-10-11 04:40:54,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:54,975 INFO L471 AbstractCegarLoop]: Abstraction has 3317 states and 4842 transitions. [2024-10-11 04:40:54,975 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:54,975 INFO L276 IsEmpty]: Start isEmpty. Operand 3317 states and 4842 transitions. [2024-10-11 04:40:54,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 04:40:54,976 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:54,976 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:54,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 04:40:55,176 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:55,177 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:55,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:55,177 INFO L85 PathProgramCache]: Analyzing trace with hash -402890190, now seen corresponding path program 1 times [2024-10-11 04:40:55,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:55,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954567360] [2024-10-11 04:40:55,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:55,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:55,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:55,284 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:55,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:55,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954567360] [2024-10-11 04:40:55,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954567360] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:40:55,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80705984] [2024-10-11 04:40:55,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:55,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:40:55,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:40:55,287 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:55,288 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:55,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:55,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 04:40:55,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:40:55,441 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:55,441 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:40:55,584 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:55,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80705984] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:40:55,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:40:55,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 9 [2024-10-11 04:40:55,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73203747] [2024-10-11 04:40:55,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:40:55,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 04:40:55,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:55,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 04:40:55,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-11 04:40:55,587 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:55,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:55,808 INFO L93 Difference]: Finished difference Result 7145 states and 9796 transitions. [2024-10-11 04:40:55,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 04:40:55,809 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:55,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:55,815 INFO L225 Difference]: With dead ends: 7145 [2024-10-11 04:40:55,815 INFO L226 Difference]: Without dead ends: 4633 [2024-10-11 04:40:55,817 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:55,817 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:40:55,818 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.1s Time] [2024-10-11 04:40:55,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4633 states. [2024-10-11 04:40:55,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4633 to 4393. [2024-10-11 04:40:55,933 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:55,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4393 states to 4393 states and 6038 transitions. [2024-10-11 04:40:55,938 INFO L78 Accepts]: Start accepts. Automaton has 4393 states and 6038 transitions. Word has length 58 [2024-10-11 04:40:55,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:55,938 INFO L471 AbstractCegarLoop]: Abstraction has 4393 states and 6038 transitions. [2024-10-11 04:40:55,939 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:55,939 INFO L276 IsEmpty]: Start isEmpty. Operand 4393 states and 6038 transitions. [2024-10-11 04:40:55,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 04:40:55,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:55,941 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] [2024-10-11 04:40:55,954 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:56,141 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:56,142 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:56,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:56,142 INFO L85 PathProgramCache]: Analyzing trace with hash -2034672704, now seen corresponding path program 1 times [2024-10-11 04:40:56,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:56,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538785851] [2024-10-11 04:40:56,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:56,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:56,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:56,233 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:56,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:56,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538785851] [2024-10-11 04:40:56,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538785851] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:40:56,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:40:56,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:40:56,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371783121] [2024-10-11 04:40:56,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:40:56,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:40:56,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:56,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:40:56,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:40:56,235 INFO L87 Difference]: Start difference. First operand 4393 states and 6038 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 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:00,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:41:00,297 INFO L93 Difference]: Finished difference Result 6648 states and 10347 transitions. [2024-10-11 04:41:00,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:41:00,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 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 59 [2024-10-11 04:41:00,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:41:00,305 INFO L225 Difference]: With dead ends: 6648 [2024-10-11 04:41:00,305 INFO L226 Difference]: Without dead ends: 5895 [2024-10-11 04:41:00,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:41:00,310 INFO L432 NwaCegarLoop]: 756 mSDtfsCounter, 2332 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5157 mSolverCounterSat, 1245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2332 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 6402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1245 IncrementalHoareTripleChecker+Valid, 5157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-11 04:41:00,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2332 Valid, 774 Invalid, 6402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1245 Valid, 5157 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-11 04:41:00,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5895 states. [2024-10-11 04:41:00,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5895 to 5895. [2024-10-11 04:41:00,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5895 states, 5893 states have (on average 1.3599185474291533) internal successors, (8014), 5894 states have internal predecessors, (8014), 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:00,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5895 states to 5895 states and 8014 transitions. [2024-10-11 04:41:00,436 INFO L78 Accepts]: Start accepts. Automaton has 5895 states and 8014 transitions. Word has length 59 [2024-10-11 04:41:00,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:41:00,436 INFO L471 AbstractCegarLoop]: Abstraction has 5895 states and 8014 transitions. [2024-10-11 04:41:00,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 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:00,436 INFO L276 IsEmpty]: Start isEmpty. Operand 5895 states and 8014 transitions. [2024-10-11 04:41:00,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 04:41:00,438 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:41:00,438 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:00,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 04:41:00,438 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:41:00,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:41:00,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1874846004, now seen corresponding path program 1 times [2024-10-11 04:41:00,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:41:00,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848822822] [2024-10-11 04:41:00,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:41:00,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:41:00,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:41:00,989 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:00,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:41:00,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848822822] [2024-10-11 04:41:00,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848822822] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:41:00,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788898350] [2024-10-11 04:41:00,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:41:00,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:41:00,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:41:00,991 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:00,992 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:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:41:01,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-11 04:41:01,073 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:41:02,990 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:02,990 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:41:05,851 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:05,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788898350] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:41:05,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:41:05,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 22, 24] total 57 [2024-10-11 04:41:05,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785150473] [2024-10-11 04:41:05,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:41:05,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-10-11 04:41:05,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:41:05,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-10-11 04:41:05,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=400, Invalid=2792, Unknown=0, NotChecked=0, Total=3192 [2024-10-11 04:41:05,854 INFO L87 Difference]: Start difference. First operand 5895 states and 8014 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)