./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 308b0e1adc3ae7348985993203af7f0b3a83352e3d43ffbdb40ed727e63d4081 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 21:15:28,486 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 21:15:28,534 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 21:15:28,539 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 21:15:28,540 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 21:15:28,557 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 21:15:28,557 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 21:15:28,558 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 21:15:28,558 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 21:15:28,559 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 21:15:28,560 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 21:15:28,560 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 21:15:28,560 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 21:15:28,560 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 21:15:28,561 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 21:15:28,561 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 21:15:28,561 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 21:15:28,561 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 21:15:28,561 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 21:15:28,561 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 21:15:28,562 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 21:15:28,564 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 21:15:28,564 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 21:15:28,565 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 21:15:28,565 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 21:15:28,565 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 21:15:28,565 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 21:15:28,565 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 21:15:28,565 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 21:15:28,565 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 21:15:28,565 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 21:15:28,566 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 21:15:28,566 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:15:28,566 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 21:15:28,566 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 21:15:28,566 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 21:15:28,566 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 21:15:28,566 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 21:15:28,566 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 21:15:28,567 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 21:15:28,567 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 21:15:28,567 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 21:15:28,567 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 308b0e1adc3ae7348985993203af7f0b3a83352e3d43ffbdb40ed727e63d4081 [2024-11-11 21:15:28,785 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 21:15:28,801 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 21:15:28,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 21:15:28,805 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 21:15:28,805 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 21:15:28,806 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c [2024-11-11 21:15:30,056 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 21:15:30,219 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 21:15:30,220 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c [2024-11-11 21:15:30,229 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74aa9a453/6b6f83b3ca05472b992271a44c95475f/FLAGdd70e0ce5 [2024-11-11 21:15:30,607 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74aa9a453/6b6f83b3ca05472b992271a44c95475f [2024-11-11 21:15:30,610 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 21:15:30,611 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 21:15:30,613 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 21:15:30,613 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 21:15:30,618 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 21:15:30,618 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:15:30" (1/1) ... [2024-11-11 21:15:30,619 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@461732e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:15:30, skipping insertion in model container [2024-11-11 21:15:30,619 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:15:30" (1/1) ... [2024-11-11 21:15:30,645 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 21:15:30,837 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c[9433,9446] [2024-11-11 21:15:30,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:15:30,851 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 21:15:30,896 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c[9433,9446] [2024-11-11 21:15:30,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:15:30,915 INFO L204 MainTranslator]: Completed translation [2024-11-11 21:15:30,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:15:30 WrapperNode [2024-11-11 21:15:30,915 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 21:15:30,916 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 21:15:30,916 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 21:15:30,916 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 21:15:30,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:15:30" (1/1) ... [2024-11-11 21:15:30,931 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:15:30" (1/1) ... [2024-11-11 21:15:30,954 INFO L138 Inliner]: procedures = 22, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 316 [2024-11-11 21:15:30,955 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 21:15:30,956 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 21:15:30,956 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 21:15:30,956 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 21:15:30,967 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:15:30" (1/1) ... [2024-11-11 21:15:30,968 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:15:30" (1/1) ... [2024-11-11 21:15:30,979 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:15:30" (1/1) ... [2024-11-11 21:15:30,993 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-11-11 21:15:30,996 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:15:30" (1/1) ... [2024-11-11 21:15:30,996 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:15:30" (1/1) ... [2024-11-11 21:15:31,000 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:15:30" (1/1) ... [2024-11-11 21:15:31,004 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:15:30" (1/1) ... [2024-11-11 21:15:31,005 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:15:30" (1/1) ... [2024-11-11 21:15:31,006 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:15:30" (1/1) ... [2024-11-11 21:15:31,008 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 21:15:31,009 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 21:15:31,009 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 21:15:31,009 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 21:15:31,010 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:15:30" (1/1) ... [2024-11-11 21:15:31,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:15:31,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:15:31,041 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 21:15:31,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 21:15:31,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 21:15:31,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 21:15:31,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 21:15:31,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 21:15:31,189 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 21:15:31,190 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 21:15:31,501 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2024-11-11 21:15:31,501 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 21:15:31,514 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 21:15:31,515 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 21:15:31,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:15:31 BoogieIcfgContainer [2024-11-11 21:15:31,515 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 21:15:31,517 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 21:15:31,517 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 21:15:31,521 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 21:15:31,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 09:15:30" (1/3) ... [2024-11-11 21:15:31,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@692af7e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:15:31, skipping insertion in model container [2024-11-11 21:15:31,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:15:30" (2/3) ... [2024-11-11 21:15:31,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@692af7e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:15:31, skipping insertion in model container [2024-11-11 21:15:31,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:15:31" (3/3) ... [2024-11-11 21:15:31,524 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c [2024-11-11 21:15:31,536 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 21:15:31,537 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 21:15:31,590 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 21:15:31,596 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;@65a69976, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 21:15:31,596 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 21:15:31,605 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 82 states have (on average 1.7317073170731707) internal successors, (142), 83 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-11-11 21:15:31,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-11 21:15:31,613 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:31,614 INFO L218 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] [2024-11-11 21:15:31,614 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:31,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:31,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1469414718, now seen corresponding path program 1 times [2024-11-11 21:15:31,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:31,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092624693] [2024-11-11 21:15:31,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:31,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:31,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:31,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:31,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:31,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092624693] [2024-11-11 21:15:31,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092624693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:31,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:31,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 21:15:31,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119863024] [2024-11-11 21:15:31,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:31,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 21:15:31,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:31,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 21:15:31,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 21:15:31,892 INFO L87 Difference]: Start difference. First operand has 84 states, 82 states have (on average 1.7317073170731707) internal successors, (142), 83 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) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 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-11-11 21:15:31,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:31,908 INFO L93 Difference]: Finished difference Result 139 states and 230 transitions. [2024-11-11 21:15:31,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 21:15:31,909 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2024-11-11 21:15:31,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:31,916 INFO L225 Difference]: With dead ends: 139 [2024-11-11 21:15:31,916 INFO L226 Difference]: Without dead ends: 80 [2024-11-11 21:15:31,918 INFO L434 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-11-11 21:15:31,921 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:31,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:15:31,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-11 21:15:31,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-11 21:15:31,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.7088607594936709) internal successors, (135), 79 states have internal predecessors, (135), 0 states have call successors, (0), 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-11-11 21:15:31,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 135 transitions. [2024-11-11 21:15:31,950 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 135 transitions. Word has length 29 [2024-11-11 21:15:31,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:31,951 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 135 transitions. [2024-11-11 21:15:31,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 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-11-11 21:15:31,951 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 135 transitions. [2024-11-11 21:15:31,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-11 21:15:31,952 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:31,952 INFO L218 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] [2024-11-11 21:15:31,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 21:15:31,952 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:31,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:31,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1335401212, now seen corresponding path program 1 times [2024-11-11 21:15:31,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:31,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118707919] [2024-11-11 21:15:31,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:31,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:31,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:32,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:32,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:32,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118707919] [2024-11-11 21:15:32,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118707919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:32,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:32,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:15:32,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090315643] [2024-11-11 21:15:32,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:32,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:15:32,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:32,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:15:32,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:15:32,197 INFO L87 Difference]: Start difference. First operand 80 states and 135 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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-11-11 21:15:32,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:32,276 INFO L93 Difference]: Finished difference Result 184 states and 301 transitions. [2024-11-11 21:15:32,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:15:32,277 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2024-11-11 21:15:32,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:32,278 INFO L225 Difference]: With dead ends: 184 [2024-11-11 21:15:32,278 INFO L226 Difference]: Without dead ends: 130 [2024-11-11 21:15:32,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:15:32,279 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 80 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:32,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 494 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:15:32,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-11 21:15:32,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 80. [2024-11-11 21:15:32,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 0 states have call successors, (0), 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-11-11 21:15:32,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 111 transitions. [2024-11-11 21:15:32,292 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 111 transitions. Word has length 29 [2024-11-11 21:15:32,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:32,293 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 111 transitions. [2024-11-11 21:15:32,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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-11-11 21:15:32,293 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 111 transitions. [2024-11-11 21:15:32,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-11 21:15:32,294 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:32,294 INFO L218 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] [2024-11-11 21:15:32,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 21:15:32,295 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:32,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:32,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1970529547, now seen corresponding path program 1 times [2024-11-11 21:15:32,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:32,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225502956] [2024-11-11 21:15:32,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:32,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:32,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:32,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:32,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:32,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225502956] [2024-11-11 21:15:32,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225502956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:32,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:32,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:15:32,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793397456] [2024-11-11 21:15:32,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:32,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:15:32,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:32,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:15:32,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:15:32,418 INFO L87 Difference]: Start difference. First operand 80 states and 111 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-11-11 21:15:32,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:32,441 INFO L93 Difference]: Finished difference Result 172 states and 259 transitions. [2024-11-11 21:15:32,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:15:32,441 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-11-11 21:15:32,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:32,442 INFO L225 Difference]: With dead ends: 172 [2024-11-11 21:15:32,443 INFO L226 Difference]: Without dead ends: 122 [2024-11-11 21:15:32,443 INFO L434 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-11-11 21:15:32,444 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 65 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:32,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 239 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:15:32,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-11 21:15:32,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2024-11-11 21:15:32,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.4789915966386555) internal successors, (176), 119 states have internal predecessors, (176), 0 states have call successors, (0), 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-11-11 21:15:32,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 176 transitions. [2024-11-11 21:15:32,454 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 176 transitions. Word has length 52 [2024-11-11 21:15:32,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:32,455 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 176 transitions. [2024-11-11 21:15:32,455 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-11-11 21:15:32,455 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 176 transitions. [2024-11-11 21:15:32,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-11 21:15:32,456 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:32,456 INFO L218 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] [2024-11-11 21:15:32,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 21:15:32,456 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:32,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:32,457 INFO L85 PathProgramCache]: Analyzing trace with hash -792098890, now seen corresponding path program 1 times [2024-11-11 21:15:32,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:32,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704715600] [2024-11-11 21:15:32,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:32,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:32,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:32,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:32,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704715600] [2024-11-11 21:15:32,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704715600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:32,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:32,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:15:32,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396159771] [2024-11-11 21:15:32,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:32,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:15:32,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:32,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:15:32,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:15:32,547 INFO L87 Difference]: Start difference. First operand 120 states and 176 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-11-11 21:15:32,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:32,567 INFO L93 Difference]: Finished difference Result 284 states and 440 transitions. [2024-11-11 21:15:32,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:15:32,567 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-11-11 21:15:32,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:32,569 INFO L225 Difference]: With dead ends: 284 [2024-11-11 21:15:32,570 INFO L226 Difference]: Without dead ends: 194 [2024-11-11 21:15:32,571 INFO L434 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-11-11 21:15:32,572 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 61 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:32,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 236 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:15:32,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-11 21:15:32,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2024-11-11 21:15:32,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 1.5235602094240839) internal successors, (291), 191 states have internal predecessors, (291), 0 states have call successors, (0), 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-11-11 21:15:32,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 291 transitions. [2024-11-11 21:15:32,586 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 291 transitions. Word has length 52 [2024-11-11 21:15:32,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:32,586 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 291 transitions. [2024-11-11 21:15:32,586 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-11-11 21:15:32,587 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 291 transitions. [2024-11-11 21:15:32,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-11 21:15:32,591 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:32,591 INFO L218 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] [2024-11-11 21:15:32,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 21:15:32,591 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:32,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:32,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1685421303, now seen corresponding path program 1 times [2024-11-11 21:15:32,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:32,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120512044] [2024-11-11 21:15:32,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:32,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:32,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:32,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:32,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:32,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120512044] [2024-11-11 21:15:32,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120512044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:32,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:32,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:15:32,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549094771] [2024-11-11 21:15:32,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:32,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:15:32,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:32,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:15:32,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:15:32,722 INFO L87 Difference]: Start difference. First operand 192 states and 291 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 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-11-11 21:15:32,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:32,822 INFO L93 Difference]: Finished difference Result 1002 states and 1596 transitions. [2024-11-11 21:15:32,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 21:15:32,823 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 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-11-11 21:15:32,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:32,830 INFO L225 Difference]: With dead ends: 1002 [2024-11-11 21:15:32,830 INFO L226 Difference]: Without dead ends: 840 [2024-11-11 21:15:32,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:15:32,833 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 745 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:32,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 680 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:15:32,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2024-11-11 21:15:32,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 352. [2024-11-11 21:15:32,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 351 states have (on average 1.547008547008547) internal successors, (543), 351 states have internal predecessors, (543), 0 states have call successors, (0), 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-11-11 21:15:32,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 543 transitions. [2024-11-11 21:15:32,866 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 543 transitions. Word has length 52 [2024-11-11 21:15:32,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:32,866 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 543 transitions. [2024-11-11 21:15:32,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 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-11-11 21:15:32,867 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 543 transitions. [2024-11-11 21:15:32,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-11 21:15:32,867 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:32,867 INFO L218 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] [2024-11-11 21:15:32,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 21:15:32,868 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:32,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:32,868 INFO L85 PathProgramCache]: Analyzing trace with hash 325129465, now seen corresponding path program 1 times [2024-11-11 21:15:32,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:32,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660883887] [2024-11-11 21:15:32,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:32,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:32,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:33,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:33,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:33,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660883887] [2024-11-11 21:15:33,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660883887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:33,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:33,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:15:33,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365112942] [2024-11-11 21:15:33,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:33,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 21:15:33,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:33,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 21:15:33,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:15:33,069 INFO L87 Difference]: Start difference. First operand 352 states and 543 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 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-11-11 21:15:33,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:33,108 INFO L93 Difference]: Finished difference Result 378 states and 576 transitions. [2024-11-11 21:15:33,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 21:15:33,110 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 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-11-11 21:15:33,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:33,116 INFO L225 Difference]: With dead ends: 378 [2024-11-11 21:15:33,116 INFO L226 Difference]: Without dead ends: 376 [2024-11-11 21:15:33,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:15:33,117 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:33,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 720 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:15:33,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2024-11-11 21:15:33,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2024-11-11 21:15:33,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 375 states have (on average 1.512) internal successors, (567), 375 states have internal predecessors, (567), 0 states have call successors, (0), 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-11-11 21:15:33,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 567 transitions. [2024-11-11 21:15:33,132 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 567 transitions. Word has length 53 [2024-11-11 21:15:33,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:33,132 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 567 transitions. [2024-11-11 21:15:33,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 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-11-11 21:15:33,133 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 567 transitions. [2024-11-11 21:15:33,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-11 21:15:33,133 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:33,133 INFO L218 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] [2024-11-11 21:15:33,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 21:15:33,134 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:33,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:33,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1541657359, now seen corresponding path program 1 times [2024-11-11 21:15:33,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:33,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135087677] [2024-11-11 21:15:33,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:33,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:33,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:33,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:33,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135087677] [2024-11-11 21:15:33,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135087677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:33,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:33,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:15:33,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490122936] [2024-11-11 21:15:33,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:33,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:15:33,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:33,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:15:33,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:15:33,204 INFO L87 Difference]: Start difference. First operand 376 states and 567 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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-11-11 21:15:33,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:33,221 INFO L93 Difference]: Finished difference Result 1008 states and 1541 transitions. [2024-11-11 21:15:33,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:15:33,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2024-11-11 21:15:33,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:33,225 INFO L225 Difference]: With dead ends: 1008 [2024-11-11 21:15:33,225 INFO L226 Difference]: Without dead ends: 662 [2024-11-11 21:15:33,225 INFO L434 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-11-11 21:15:33,226 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 50 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:33,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 189 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:15:33,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2024-11-11 21:15:33,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 660. [2024-11-11 21:15:33,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 659 states have (on average 1.5098634294385433) internal successors, (995), 659 states have internal predecessors, (995), 0 states have call successors, (0), 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-11-11 21:15:33,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 995 transitions. [2024-11-11 21:15:33,248 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 995 transitions. Word has length 54 [2024-11-11 21:15:33,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:33,248 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 995 transitions. [2024-11-11 21:15:33,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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-11-11 21:15:33,248 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 995 transitions. [2024-11-11 21:15:33,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-11 21:15:33,251 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:33,251 INFO L218 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] [2024-11-11 21:15:33,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 21:15:33,252 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:33,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:33,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1960098574, now seen corresponding path program 1 times [2024-11-11 21:15:33,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:33,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683532016] [2024-11-11 21:15:33,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:33,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:33,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:33,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:33,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:33,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683532016] [2024-11-11 21:15:33,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683532016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:33,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:33,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:15:33,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977979090] [2024-11-11 21:15:33,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:33,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:15:33,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:33,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:15:33,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:15:33,304 INFO L87 Difference]: Start difference. First operand 660 states and 995 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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-11-11 21:15:33,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:33,329 INFO L93 Difference]: Finished difference Result 1290 states and 1960 transitions. [2024-11-11 21:15:33,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:15:33,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2024-11-11 21:15:33,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:33,333 INFO L225 Difference]: With dead ends: 1290 [2024-11-11 21:15:33,333 INFO L226 Difference]: Without dead ends: 944 [2024-11-11 21:15:33,333 INFO L434 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-11-11 21:15:33,334 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 69 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:33,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 249 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:15:33,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2024-11-11 21:15:33,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 942. [2024-11-11 21:15:33,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 941 states have (on average 1.5015940488841657) internal successors, (1413), 941 states have internal predecessors, (1413), 0 states have call successors, (0), 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-11-11 21:15:33,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1413 transitions. [2024-11-11 21:15:33,354 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1413 transitions. Word has length 54 [2024-11-11 21:15:33,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:33,354 INFO L471 AbstractCegarLoop]: Abstraction has 942 states and 1413 transitions. [2024-11-11 21:15:33,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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-11-11 21:15:33,355 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1413 transitions. [2024-11-11 21:15:33,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-11 21:15:33,356 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:33,356 INFO L218 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] [2024-11-11 21:15:33,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 21:15:33,357 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:33,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:33,357 INFO L85 PathProgramCache]: Analyzing trace with hash -487372750, now seen corresponding path program 1 times [2024-11-11 21:15:33,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:33,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615188323] [2024-11-11 21:15:33,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:33,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:33,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:33,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:33,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:33,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615188323] [2024-11-11 21:15:33,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615188323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:33,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:33,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:15:33,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861342864] [2024-11-11 21:15:33,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:33,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:15:33,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:33,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:15:33,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:15:33,401 INFO L87 Difference]: Start difference. First operand 942 states and 1413 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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-11-11 21:15:33,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:33,432 INFO L93 Difference]: Finished difference Result 2570 states and 3839 transitions. [2024-11-11 21:15:33,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:15:33,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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-11-11 21:15:33,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:33,437 INFO L225 Difference]: With dead ends: 2570 [2024-11-11 21:15:33,437 INFO L226 Difference]: Without dead ends: 1660 [2024-11-11 21:15:33,438 INFO L434 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-11-11 21:15:33,439 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 57 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:33,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 243 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:15:33,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2024-11-11 21:15:33,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 1658. [2024-11-11 21:15:33,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1658 states, 1657 states have (on average 1.468316234158117) internal successors, (2433), 1657 states have internal predecessors, (2433), 0 states have call successors, (0), 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-11-11 21:15:33,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 2433 transitions. [2024-11-11 21:15:33,489 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 2433 transitions. Word has length 55 [2024-11-11 21:15:33,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:33,489 INFO L471 AbstractCegarLoop]: Abstraction has 1658 states and 2433 transitions. [2024-11-11 21:15:33,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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-11-11 21:15:33,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2433 transitions. [2024-11-11 21:15:33,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-11 21:15:33,490 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:33,490 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:15:33,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 21:15:33,490 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:33,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:33,491 INFO L85 PathProgramCache]: Analyzing trace with hash 487430426, now seen corresponding path program 1 times [2024-11-11 21:15:33,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:33,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417752399] [2024-11-11 21:15:33,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:33,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:33,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:33,574 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:33,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:33,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417752399] [2024-11-11 21:15:33,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417752399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:33,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:33,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:15:33,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372160584] [2024-11-11 21:15:33,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:33,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:15:33,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:33,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:15:33,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:15:33,576 INFO L87 Difference]: Start difference. First operand 1658 states and 2433 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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-11-11 21:15:33,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:33,607 INFO L93 Difference]: Finished difference Result 3286 states and 4835 transitions. [2024-11-11 21:15:33,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:15:33,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-11-11 21:15:33,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:33,612 INFO L225 Difference]: With dead ends: 3286 [2024-11-11 21:15:33,612 INFO L226 Difference]: Without dead ends: 1660 [2024-11-11 21:15:33,613 INFO L434 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-11-11 21:15:33,614 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 54 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:33,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 234 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:15:33,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2024-11-11 21:15:33,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 1658. [2024-11-11 21:15:33,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1658 states, 1657 states have (on average 1.4538322269161135) internal successors, (2409), 1657 states have internal predecessors, (2409), 0 states have call successors, (0), 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-11-11 21:15:33,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 2409 transitions. [2024-11-11 21:15:33,647 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 2409 transitions. Word has length 77 [2024-11-11 21:15:33,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:33,648 INFO L471 AbstractCegarLoop]: Abstraction has 1658 states and 2409 transitions. [2024-11-11 21:15:33,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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-11-11 21:15:33,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2409 transitions. [2024-11-11 21:15:33,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-11 21:15:33,650 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:33,650 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:15:33,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 21:15:33,650 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:33,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:33,651 INFO L85 PathProgramCache]: Analyzing trace with hash 873678745, now seen corresponding path program 1 times [2024-11-11 21:15:33,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:33,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779150391] [2024-11-11 21:15:33,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:33,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:33,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:33,823 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 21:15:33,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:33,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779150391] [2024-11-11 21:15:33,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779150391] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:15:33,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054848356] [2024-11-11 21:15:33,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:33,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:15:33,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:15:33,827 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:15:33,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 21:15:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:33,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-11 21:15:33,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:15:34,567 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:34,567 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:15:35,200 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:35,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054848356] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:15:35,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:15:35,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 9, 8] total 16 [2024-11-11 21:15:35,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230035378] [2024-11-11 21:15:35,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:15:35,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-11 21:15:35,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:35,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-11 21:15:35,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2024-11-11 21:15:35,202 INFO L87 Difference]: Start difference. First operand 1658 states and 2409 transitions. Second operand has 16 states, 16 states have (on average 12.5) internal successors, (200), 16 states have internal predecessors, (200), 0 states have call successors, (0), 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-11-11 21:15:36,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:36,149 INFO L93 Difference]: Finished difference Result 8423 states and 12075 transitions. [2024-11-11 21:15:36,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-11 21:15:36,150 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 12.5) internal successors, (200), 16 states have internal predecessors, (200), 0 states have call successors, (0), 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 77 [2024-11-11 21:15:36,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:36,165 INFO L225 Difference]: With dead ends: 8423 [2024-11-11 21:15:36,166 INFO L226 Difference]: Without dead ends: 6797 [2024-11-11 21:15:36,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=334, Invalid=788, Unknown=0, NotChecked=0, Total=1122 [2024-11-11 21:15:36,169 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 2116 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2116 SdHoareTripleChecker+Valid, 1237 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:36,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2116 Valid, 1237 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 21:15:36,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6797 states. [2024-11-11 21:15:36,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6797 to 5983. [2024-11-11 21:15:36,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5983 states, 5982 states have (on average 1.4182547642928787) internal successors, (8484), 5982 states have internal predecessors, (8484), 0 states have call successors, (0), 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-11-11 21:15:36,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5983 states to 5983 states and 8484 transitions. [2024-11-11 21:15:36,334 INFO L78 Accepts]: Start accepts. Automaton has 5983 states and 8484 transitions. Word has length 77 [2024-11-11 21:15:36,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:36,334 INFO L471 AbstractCegarLoop]: Abstraction has 5983 states and 8484 transitions. [2024-11-11 21:15:36,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 12.5) internal successors, (200), 16 states have internal predecessors, (200), 0 states have call successors, (0), 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-11-11 21:15:36,335 INFO L276 IsEmpty]: Start isEmpty. Operand 5983 states and 8484 transitions. [2024-11-11 21:15:36,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-11 21:15:36,335 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:36,336 INFO L218 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, 1, 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-11-11 21:15:36,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-11 21:15:36,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-11 21:15:36,536 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:36,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:36,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1715995457, now seen corresponding path program 1 times [2024-11-11 21:15:36,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:36,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809197368] [2024-11-11 21:15:36,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:36,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:36,628 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 21:15:36,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:36,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809197368] [2024-11-11 21:15:36,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809197368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:36,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:36,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:15:36,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427416941] [2024-11-11 21:15:36,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:36,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:15:36,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:36,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:15:36,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:15:36,631 INFO L87 Difference]: Start difference. First operand 5983 states and 8484 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 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-11-11 21:15:36,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:36,890 INFO L93 Difference]: Finished difference Result 18150 states and 25893 transitions. [2024-11-11 21:15:36,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 21:15:36,891 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-11 21:15:36,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:36,931 INFO L225 Difference]: With dead ends: 18150 [2024-11-11 21:15:36,931 INFO L226 Difference]: Without dead ends: 15076 [2024-11-11 21:15:36,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:15:36,940 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 460 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:36,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 731 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:15:36,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15076 states. [2024-11-11 21:15:37,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15076 to 8917. [2024-11-11 21:15:37,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8917 states, 8916 states have (on average 1.4119560340960071) internal successors, (12589), 8916 states have internal predecessors, (12589), 0 states have call successors, (0), 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-11-11 21:15:37,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8917 states to 8917 states and 12589 transitions. [2024-11-11 21:15:37,203 INFO L78 Accepts]: Start accepts. Automaton has 8917 states and 12589 transitions. Word has length 78 [2024-11-11 21:15:37,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:37,203 INFO L471 AbstractCegarLoop]: Abstraction has 8917 states and 12589 transitions. [2024-11-11 21:15:37,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 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-11-11 21:15:37,203 INFO L276 IsEmpty]: Start isEmpty. Operand 8917 states and 12589 transitions. [2024-11-11 21:15:37,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-11 21:15:37,204 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:37,204 INFO L218 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, 1, 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-11-11 21:15:37,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 21:15:37,204 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:37,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:37,205 INFO L85 PathProgramCache]: Analyzing trace with hash -898712317, now seen corresponding path program 1 times [2024-11-11 21:15:37,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:37,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729535991] [2024-11-11 21:15:37,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:37,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:37,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:37,329 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 21:15:37,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:37,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729535991] [2024-11-11 21:15:37,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729535991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:37,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:37,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:15:37,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780100707] [2024-11-11 21:15:37,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:37,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:15:37,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:37,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:15:37,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:15:37,331 INFO L87 Difference]: Start difference. First operand 8917 states and 12589 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:15:37,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:37,707 INFO L93 Difference]: Finished difference Result 21084 states and 29998 transitions. [2024-11-11 21:15:37,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 21:15:37,708 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-11 21:15:37,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:37,736 INFO L225 Difference]: With dead ends: 21084 [2024-11-11 21:15:37,736 INFO L226 Difference]: Without dead ends: 18010 [2024-11-11 21:15:37,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:15:37,743 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 460 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:37,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 699 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:15:37,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18010 states. [2024-11-11 21:15:38,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18010 to 11844. [2024-11-11 21:15:38,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11844 states, 11843 states have (on average 1.4086802330490584) internal successors, (16683), 11843 states have internal predecessors, (16683), 0 states have call successors, (0), 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-11-11 21:15:38,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11844 states to 11844 states and 16683 transitions. [2024-11-11 21:15:38,038 INFO L78 Accepts]: Start accepts. Automaton has 11844 states and 16683 transitions. Word has length 78 [2024-11-11 21:15:38,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:38,038 INFO L471 AbstractCegarLoop]: Abstraction has 11844 states and 16683 transitions. [2024-11-11 21:15:38,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:15:38,038 INFO L276 IsEmpty]: Start isEmpty. Operand 11844 states and 16683 transitions. [2024-11-11 21:15:38,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-11 21:15:38,039 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:38,039 INFO L218 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, 1, 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-11-11 21:15:38,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 21:15:38,039 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:38,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:38,040 INFO L85 PathProgramCache]: Analyzing trace with hash -924014651, now seen corresponding path program 1 times [2024-11-11 21:15:38,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:38,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479512971] [2024-11-11 21:15:38,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:38,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:38,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:38,126 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-11 21:15:38,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:38,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479512971] [2024-11-11 21:15:38,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479512971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:38,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:38,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:15:38,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239128099] [2024-11-11 21:15:38,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:38,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:15:38,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:38,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:15:38,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:15:38,128 INFO L87 Difference]: Start difference. First operand 11844 states and 16683 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 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-11-11 21:15:38,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:38,490 INFO L93 Difference]: Finished difference Result 23995 states and 34065 transitions. [2024-11-11 21:15:38,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 21:15:38,491 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-11 21:15:38,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:38,524 INFO L225 Difference]: With dead ends: 23995 [2024-11-11 21:15:38,525 INFO L226 Difference]: Without dead ends: 20921 [2024-11-11 21:15:38,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:15:38,529 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 505 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:38,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 669 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:15:38,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20921 states. [2024-11-11 21:15:38,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20921 to 14762. [2024-11-11 21:15:38,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14762 states, 14761 states have (on average 1.4064765259806247) internal successors, (20761), 14761 states have internal predecessors, (20761), 0 states have call successors, (0), 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-11-11 21:15:38,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14762 states to 14762 states and 20761 transitions. [2024-11-11 21:15:38,938 INFO L78 Accepts]: Start accepts. Automaton has 14762 states and 20761 transitions. Word has length 78 [2024-11-11 21:15:38,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:38,939 INFO L471 AbstractCegarLoop]: Abstraction has 14762 states and 20761 transitions. [2024-11-11 21:15:38,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 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-11-11 21:15:38,939 INFO L276 IsEmpty]: Start isEmpty. Operand 14762 states and 20761 transitions. [2024-11-11 21:15:38,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-11 21:15:38,940 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:38,941 INFO L218 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, 1, 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-11-11 21:15:38,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 21:15:38,941 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:38,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:38,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1191330695, now seen corresponding path program 1 times [2024-11-11 21:15:38,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:38,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866038543] [2024-11-11 21:15:38,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:38,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:38,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:39,052 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-11 21:15:39,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:39,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866038543] [2024-11-11 21:15:39,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866038543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:39,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:39,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:15:39,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277580332] [2024-11-11 21:15:39,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:39,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:15:39,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:39,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:15:39,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:15:39,056 INFO L87 Difference]: Start difference. First operand 14762 states and 20761 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 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-11-11 21:15:39,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:39,548 INFO L93 Difference]: Finished difference Result 26899 states and 38121 transitions. [2024-11-11 21:15:39,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 21:15:39,549 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-11 21:15:39,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:39,577 INFO L225 Difference]: With dead ends: 26899 [2024-11-11 21:15:39,578 INFO L226 Difference]: Without dead ends: 23825 [2024-11-11 21:15:39,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:15:39,584 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 471 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:39,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 738 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:15:39,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23825 states. [2024-11-11 21:15:40,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23825 to 17666. [2024-11-11 21:15:40,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17666 states, 17665 states have (on average 1.4048683838097933) internal successors, (24817), 17665 states have internal predecessors, (24817), 0 states have call successors, (0), 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-11-11 21:15:40,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17666 states to 17666 states and 24817 transitions. [2024-11-11 21:15:40,049 INFO L78 Accepts]: Start accepts. Automaton has 17666 states and 24817 transitions. Word has length 78 [2024-11-11 21:15:40,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:40,050 INFO L471 AbstractCegarLoop]: Abstraction has 17666 states and 24817 transitions. [2024-11-11 21:15:40,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 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-11-11 21:15:40,050 INFO L276 IsEmpty]: Start isEmpty. Operand 17666 states and 24817 transitions. [2024-11-11 21:15:40,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-11 21:15:40,051 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:40,051 INFO L218 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, 1, 1, 1, 1, 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-11-11 21:15:40,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 21:15:40,051 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:40,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:40,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1364656701, now seen corresponding path program 1 times [2024-11-11 21:15:40,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:40,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825844530] [2024-11-11 21:15:40,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:40,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:40,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:40,358 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:40,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:40,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825844530] [2024-11-11 21:15:40,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825844530] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:15:40,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20094861] [2024-11-11 21:15:40,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:40,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:15:40,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:15:40,361 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:15:40,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 21:15:40,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:40,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-11 21:15:40,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:15:40,829 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:40,829 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:15:41,435 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:41,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20094861] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:15:41,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:15:41,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2024-11-11 21:15:41,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937546883] [2024-11-11 21:15:41,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:15:41,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-11 21:15:41,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:41,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-11 21:15:41,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2024-11-11 21:15:41,437 INFO L87 Difference]: Start difference. First operand 17666 states and 24817 transitions. Second operand has 21 states, 21 states have (on average 8.571428571428571) internal successors, (180), 20 states have internal predecessors, (180), 0 states have call successors, (0), 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-11-11 21:15:42,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:42,919 INFO L93 Difference]: Finished difference Result 74604 states and 105976 transitions. [2024-11-11 21:15:42,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-11 21:15:42,919 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 8.571428571428571) internal successors, (180), 20 states have internal predecessors, (180), 0 states have call successors, (0), 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 81 [2024-11-11 21:15:42,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:42,989 INFO L225 Difference]: With dead ends: 74604 [2024-11-11 21:15:42,989 INFO L226 Difference]: Without dead ends: 57136 [2024-11-11 21:15:43,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=349, Invalid=983, Unknown=0, NotChecked=0, Total=1332 [2024-11-11 21:15:43,012 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 1850 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1850 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:43,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1850 Valid, 799 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 21:15:43,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57136 states. [2024-11-11 21:15:44,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57136 to 41794. [2024-11-11 21:15:44,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41794 states, 41793 states have (on average 1.4010240949441295) internal successors, (58553), 41793 states have internal predecessors, (58553), 0 states have call successors, (0), 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-11-11 21:15:44,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41794 states to 41794 states and 58553 transitions. [2024-11-11 21:15:44,310 INFO L78 Accepts]: Start accepts. Automaton has 41794 states and 58553 transitions. Word has length 81 [2024-11-11 21:15:44,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:44,310 INFO L471 AbstractCegarLoop]: Abstraction has 41794 states and 58553 transitions. [2024-11-11 21:15:44,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 8.571428571428571) internal successors, (180), 20 states have internal predecessors, (180), 0 states have call successors, (0), 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-11-11 21:15:44,311 INFO L276 IsEmpty]: Start isEmpty. Operand 41794 states and 58553 transitions. [2024-11-11 21:15:44,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-11 21:15:44,312 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:44,312 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:15:44,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 21:15:44,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-11 21:15:44,513 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:44,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:44,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1112863492, now seen corresponding path program 1 times [2024-11-11 21:15:44,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:44,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871655514] [2024-11-11 21:15:44,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:44,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:44,581 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:44,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:44,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871655514] [2024-11-11 21:15:44,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871655514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:44,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:44,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:15:44,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387627781] [2024-11-11 21:15:44,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:44,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:15:44,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:44,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:15:44,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:15:44,583 INFO L87 Difference]: Start difference. First operand 41794 states and 58553 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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-11-11 21:15:44,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:44,939 INFO L93 Difference]: Finished difference Result 62414 states and 87367 transitions. [2024-11-11 21:15:44,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:15:44,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-11-11 21:15:44,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:44,966 INFO L225 Difference]: With dead ends: 62414 [2024-11-11 21:15:44,966 INFO L226 Difference]: Without dead ends: 20934 [2024-11-11 21:15:44,995 INFO L434 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-11-11 21:15:44,996 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 38 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:44,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 221 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:15:45,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20934 states. [2024-11-11 21:15:45,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20934 to 20596. [2024-11-11 21:15:45,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20596 states, 20595 states have (on average 1.3793153678077203) internal successors, (28407), 20595 states have internal predecessors, (28407), 0 states have call successors, (0), 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-11-11 21:15:45,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20596 states to 20596 states and 28407 transitions. [2024-11-11 21:15:45,563 INFO L78 Accepts]: Start accepts. Automaton has 20596 states and 28407 transitions. Word has length 81 [2024-11-11 21:15:45,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:45,563 INFO L471 AbstractCegarLoop]: Abstraction has 20596 states and 28407 transitions. [2024-11-11 21:15:45,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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-11-11 21:15:45,563 INFO L276 IsEmpty]: Start isEmpty. Operand 20596 states and 28407 transitions. [2024-11-11 21:15:45,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-11 21:15:45,564 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:45,565 INFO L218 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, 1, 1, 1, 1, 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-11-11 21:15:45,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 21:15:45,565 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:45,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:45,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1389959035, now seen corresponding path program 1 times [2024-11-11 21:15:45,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:45,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660858036] [2024-11-11 21:15:45,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:45,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:45,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:46,910 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:46,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:46,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660858036] [2024-11-11 21:15:46,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660858036] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:15:46,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882249736] [2024-11-11 21:15:46,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:46,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:15:46,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:15:46,912 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:15:46,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 21:15:47,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:47,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-11 21:15:47,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:15:47,357 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:47,357 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:15:47,965 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:47,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882249736] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:15:47,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:15:47,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2024-11-11 21:15:47,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142299724] [2024-11-11 21:15:47,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:15:47,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-11 21:15:47,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:47,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-11 21:15:47,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2024-11-11 21:15:47,967 INFO L87 Difference]: Start difference. First operand 20596 states and 28407 transitions. Second operand has 28 states, 28 states have (on average 7.75) internal successors, (217), 27 states have internal predecessors, (217), 0 states have call successors, (0), 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-11-11 21:15:56,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:56,552 INFO L93 Difference]: Finished difference Result 202297 states and 280176 transitions. [2024-11-11 21:15:56,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2024-11-11 21:15:56,553 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 7.75) internal successors, (217), 27 states have internal predecessors, (217), 0 states have call successors, (0), 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 81 [2024-11-11 21:15:56,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:56,761 INFO L225 Difference]: With dead ends: 202297 [2024-11-11 21:15:56,761 INFO L226 Difference]: Without dead ends: 181953 [2024-11-11 21:15:56,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5511 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=2802, Invalid=13454, Unknown=0, NotChecked=0, Total=16256 [2024-11-11 21:15:56,809 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 4386 mSDsluCounter, 1944 mSDsCounter, 0 mSdLazyCounter, 2757 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4386 SdHoareTripleChecker+Valid, 2147 SdHoareTripleChecker+Invalid, 2832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 2757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:56,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4386 Valid, 2147 Invalid, 2832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 2757 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-11 21:15:56,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181953 states. [2024-11-11 21:16:00,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181953 to 112767. [2024-11-11 21:16:00,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112767 states, 112766 states have (on average 1.3694021247539152) internal successors, (154422), 112766 states have internal predecessors, (154422), 0 states have call successors, (0), 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-11-11 21:16:00,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112767 states to 112767 states and 154422 transitions. [2024-11-11 21:16:00,730 INFO L78 Accepts]: Start accepts. Automaton has 112767 states and 154422 transitions. Word has length 81 [2024-11-11 21:16:00,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:16:00,731 INFO L471 AbstractCegarLoop]: Abstraction has 112767 states and 154422 transitions. [2024-11-11 21:16:00,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 7.75) internal successors, (217), 27 states have internal predecessors, (217), 0 states have call successors, (0), 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-11-11 21:16:00,731 INFO L276 IsEmpty]: Start isEmpty. Operand 112767 states and 154422 transitions. [2024-11-11 21:16:00,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-11 21:16:00,734 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:16:00,734 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:16:00,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 21:16:00,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-11 21:16:00,939 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:16:00,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:16:00,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1824933852, now seen corresponding path program 1 times [2024-11-11 21:16:00,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:16:00,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585867828] [2024-11-11 21:16:00,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:00,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:16:00,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:01,020 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:16:01,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:16:01,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585867828] [2024-11-11 21:16:01,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585867828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:16:01,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:16:01,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:16:01,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773332650] [2024-11-11 21:16:01,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:16:01,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:16:01,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:16:01,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:16:01,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:16:01,023 INFO L87 Difference]: Start difference. First operand 112767 states and 154422 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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-11-11 21:16:02,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:16:02,725 INFO L93 Difference]: Finished difference Result 178615 states and 244060 transitions. [2024-11-11 21:16:02,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:16:02,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-11-11 21:16:02,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:16:02,809 INFO L225 Difference]: With dead ends: 178615 [2024-11-11 21:16:02,809 INFO L226 Difference]: Without dead ends: 66596 [2024-11-11 21:16:02,860 INFO L434 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-11-11 21:16:02,864 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 31 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:16:02,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 208 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:16:02,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66596 states. [2024-11-11 21:16:04,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66596 to 65298. [2024-11-11 21:16:05,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65298 states, 65297 states have (on average 1.3375652786498613) internal successors, (87339), 65297 states have internal predecessors, (87339), 0 states have call successors, (0), 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-11-11 21:16:05,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65298 states to 65298 states and 87339 transitions. [2024-11-11 21:16:05,110 INFO L78 Accepts]: Start accepts. Automaton has 65298 states and 87339 transitions. Word has length 81 [2024-11-11 21:16:05,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:16:05,110 INFO L471 AbstractCegarLoop]: Abstraction has 65298 states and 87339 transitions. [2024-11-11 21:16:05,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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-11-11 21:16:05,111 INFO L276 IsEmpty]: Start isEmpty. Operand 65298 states and 87339 transitions. [2024-11-11 21:16:05,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-11 21:16:05,113 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:16:05,113 INFO L218 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, 1, 1, 1, 1, 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-11-11 21:16:05,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 21:16:05,113 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:16:05,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:16:05,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1672593283, now seen corresponding path program 1 times [2024-11-11 21:16:05,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:16:05,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398443372] [2024-11-11 21:16:05,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:05,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:16:05,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:05,586 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:16:05,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:16:05,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398443372] [2024-11-11 21:16:05,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398443372] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:16:05,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307456573] [2024-11-11 21:16:05,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:05,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:16:05,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:16:05,589 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:16:05,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 21:16:05,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:05,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-11 21:16:05,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:16:05,955 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:16:05,955 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:16:06,629 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:16:06,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307456573] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:16:06,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:16:06,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2024-11-11 21:16:06,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745503147] [2024-11-11 21:16:06,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:16:06,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-11 21:16:06,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:16:06,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-11 21:16:06,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2024-11-11 21:16:06,631 INFO L87 Difference]: Start difference. First operand 65298 states and 87339 transitions. Second operand has 21 states, 21 states have (on average 7.904761904761905) internal successors, (166), 20 states have internal predecessors, (166), 0 states have call successors, (0), 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-11-11 21:16:10,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:16:10,082 INFO L93 Difference]: Finished difference Result 206360 states and 275860 transitions. [2024-11-11 21:16:10,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 21:16:10,082 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 7.904761904761905) internal successors, (166), 20 states have internal predecessors, (166), 0 states have call successors, (0), 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 81 [2024-11-11 21:16:10,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:16:10,361 INFO L225 Difference]: With dead ends: 206360 [2024-11-11 21:16:10,361 INFO L226 Difference]: Without dead ends: 141609 [2024-11-11 21:16:10,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=224, Invalid=646, Unknown=0, NotChecked=0, Total=870 [2024-11-11 21:16:10,404 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 989 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 989 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:16:10,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [989 Valid, 754 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:16:10,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141609 states. [2024-11-11 21:16:14,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141609 to 132281. [2024-11-11 21:16:14,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132281 states, 132280 states have (on average 1.3330662231629875) internal successors, (176338), 132280 states have internal predecessors, (176338), 0 states have call successors, (0), 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-11-11 21:16:14,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132281 states to 132281 states and 176338 transitions. [2024-11-11 21:16:14,632 INFO L78 Accepts]: Start accepts. Automaton has 132281 states and 176338 transitions. Word has length 81 [2024-11-11 21:16:14,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:16:14,633 INFO L471 AbstractCegarLoop]: Abstraction has 132281 states and 176338 transitions. [2024-11-11 21:16:14,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 7.904761904761905) internal successors, (166), 20 states have internal predecessors, (166), 0 states have call successors, (0), 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-11-11 21:16:14,633 INFO L276 IsEmpty]: Start isEmpty. Operand 132281 states and 176338 transitions. [2024-11-11 21:16:14,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-11 21:16:14,635 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:16:14,635 INFO L218 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, 1, 1, 1, 1, 1, 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-11-11 21:16:14,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-11 21:16:14,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:16:14,836 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:16:14,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:16:14,839 INFO L85 PathProgramCache]: Analyzing trace with hash 2083572889, now seen corresponding path program 1 times [2024-11-11 21:16:14,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:16:14,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827591754] [2024-11-11 21:16:14,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:14,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:16:14,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:14,883 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:16:14,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:16:14,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827591754] [2024-11-11 21:16:14,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827591754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:16:14,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:16:14,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:16:14,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407023717] [2024-11-11 21:16:14,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:16:14,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:16:14,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:16:14,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:16:14,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:16:14,885 INFO L87 Difference]: Start difference. First operand 132281 states and 176338 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)