./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.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 d0cee5b1964cd71f7406ad577c9568bfea84778de80728dfc08113baa4a027fc --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 22:26:58,044 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 22:26:58,099 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 22:26:58,105 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 22:26:58,105 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 22:26:58,126 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 22:26:58,127 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 22:26:58,128 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 22:26:58,128 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 22:26:58,131 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 22:26:58,131 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 22:26:58,131 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 22:26:58,132 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 22:26:58,132 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 22:26:58,132 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 22:26:58,132 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 22:26:58,133 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 22:26:58,133 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 22:26:58,133 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 22:26:58,133 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 22:26:58,133 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 22:26:58,135 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 22:26:58,136 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 22:26:58,136 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 22:26:58,136 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 22:26:58,136 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 22:26:58,136 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 22:26:58,137 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 22:26:58,137 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 22:26:58,137 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 22:26:58,137 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 22:26:58,137 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 22:26:58,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:26:58,138 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 22:26:58,139 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 22:26:58,139 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 22:26:58,139 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 22:26:58,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 22:26:58,140 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 22:26:58,140 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 22:26:58,140 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 22:26:58,140 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 22:26:58,140 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 -> d0cee5b1964cd71f7406ad577c9568bfea84778de80728dfc08113baa4a027fc [2024-11-19 22:26:58,330 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 22:26:58,348 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 22:26:58,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 22:26:58,351 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 22:26:58,351 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 22:26:58,352 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c [2024-11-19 22:26:59,534 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 22:26:59,690 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 22:26:59,691 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c [2024-11-19 22:26:59,700 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55d638cf6/ff819753d9e240f6b92f7431d12f01ed/FLAG0d59d2b98 [2024-11-19 22:27:00,089 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55d638cf6/ff819753d9e240f6b92f7431d12f01ed [2024-11-19 22:27:00,091 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 22:27:00,092 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 22:27:00,093 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 22:27:00,093 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 22:27:00,098 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 22:27:00,098 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:27:00" (1/1) ... [2024-11-19 22:27:00,099 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e76407d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:27:00, skipping insertion in model container [2024-11-19 22:27:00,099 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:27:00" (1/1) ... [2024-11-19 22:27:00,125 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 22:27:00,319 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.3.1.ufo.UNBOUNDED.pals.c[6940,6953] [2024-11-19 22:27:00,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:27:00,335 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 22:27:00,367 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.3.1.ufo.UNBOUNDED.pals.c[6940,6953] [2024-11-19 22:27:00,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:27:00,383 INFO L204 MainTranslator]: Completed translation [2024-11-19 22:27:00,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:27:00 WrapperNode [2024-11-19 22:27:00,383 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 22:27:00,384 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 22:27:00,384 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 22:27:00,384 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 22:27:00,389 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:27:00" (1/1) ... [2024-11-19 22:27:00,395 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:27:00" (1/1) ... [2024-11-19 22:27:00,413 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 250 [2024-11-19 22:27:00,413 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 22:27:00,414 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 22:27:00,414 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 22:27:00,414 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 22:27:00,422 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:27:00" (1/1) ... [2024-11-19 22:27:00,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:27:00" (1/1) ... [2024-11-19 22:27:00,424 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:27:00" (1/1) ... [2024-11-19 22:27:00,433 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-19 22:27:00,433 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:27:00" (1/1) ... [2024-11-19 22:27:00,433 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:27:00" (1/1) ... [2024-11-19 22:27:00,442 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:27:00" (1/1) ... [2024-11-19 22:27:00,445 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:27:00" (1/1) ... [2024-11-19 22:27:00,447 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:27:00" (1/1) ... [2024-11-19 22:27:00,451 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:27:00" (1/1) ... [2024-11-19 22:27:00,453 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 22:27:00,456 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 22:27:00,456 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 22:27:00,456 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 22:27:00,457 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:27:00" (1/1) ... [2024-11-19 22:27:00,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:27:00,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:27:00,522 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-19 22:27:00,524 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-19 22:27:00,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 22:27:00,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 22:27:00,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 22:27:00,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 22:27:00,623 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 22:27:00,626 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 22:27:00,934 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2024-11-19 22:27:00,934 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 22:27:00,948 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 22:27:00,948 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 22:27:00,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:27:00 BoogieIcfgContainer [2024-11-19 22:27:00,949 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 22:27:00,951 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 22:27:00,952 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 22:27:00,955 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 22:27:00,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:27:00" (1/3) ... [2024-11-19 22:27:00,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35d6eec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:27:00, skipping insertion in model container [2024-11-19 22:27:00,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:27:00" (2/3) ... [2024-11-19 22:27:00,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35d6eec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:27:00, skipping insertion in model container [2024-11-19 22:27:00,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:27:00" (3/3) ... [2024-11-19 22:27:00,959 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c [2024-11-19 22:27:00,973 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 22:27:00,973 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 22:27:01,023 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 22:27:01,028 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;@348b4e75, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 22:27:01,028 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 22:27:01,032 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 67 states have (on average 1.7014925373134329) internal successors, (114), 68 states have internal predecessors, (114), 0 states have call successors, (0), 0 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-19 22:27:01,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 22:27:01,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:27:01,037 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:27:01,037 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:27:01,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:27:01,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1425545932, now seen corresponding path program 1 times [2024-11-19 22:27:01,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:27:01,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521801671] [2024-11-19 22:27:01,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:27:01,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:27:01,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:27:01,365 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-19 22:27:01,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:27:01,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521801671] [2024-11-19 22:27:01,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521801671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:27:01,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:27:01,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:27:01,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118702084] [2024-11-19 22:27:01,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:27:01,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:27:01,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:27:01,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:27:01,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:27:01,389 INFO L87 Difference]: Start difference. First operand has 69 states, 67 states have (on average 1.7014925373134329) internal successors, (114), 68 states have internal predecessors, (114), 0 states have call successors, (0), 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 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 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-19 22:27:01,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:27:01,447 INFO L93 Difference]: Finished difference Result 115 states and 189 transitions. [2024-11-19 22:27:01,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:27:01,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2024-11-19 22:27:01,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:27:01,456 INFO L225 Difference]: With dead ends: 115 [2024-11-19 22:27:01,456 INFO L226 Difference]: Without dead ends: 65 [2024-11-19 22:27:01,458 INFO L431 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-19 22:27:01,461 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:27:01,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 398 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:27:01,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-19 22:27:01,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-19 22:27:01,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.40625) internal successors, (90), 64 states have internal predecessors, (90), 0 states have call successors, (0), 0 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-19 22:27:01,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 90 transitions. [2024-11-19 22:27:01,491 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 90 transitions. Word has length 25 [2024-11-19 22:27:01,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:27:01,492 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 90 transitions. [2024-11-19 22:27:01,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 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-19 22:27:01,492 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 90 transitions. [2024-11-19 22:27:01,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-19 22:27:01,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:27:01,493 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:27:01,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 22:27:01,494 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:27:01,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:27:01,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1477219222, now seen corresponding path program 1 times [2024-11-19 22:27:01,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:27:01,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484795747] [2024-11-19 22:27:01,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:27:01,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:27:01,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:27:01,602 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-19 22:27:01,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:27:01,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484795747] [2024-11-19 22:27:01,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484795747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:27:01,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:27:01,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:27:01,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587812109] [2024-11-19 22:27:01,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:27:01,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:27:01,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:27:01,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:27:01,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:27:01,608 INFO L87 Difference]: Start difference. First operand 65 states and 90 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 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-19 22:27:01,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:27:01,630 INFO L93 Difference]: Finished difference Result 141 states and 210 transitions. [2024-11-19 22:27:01,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:27:01,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2024-11-19 22:27:01,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:27:01,632 INFO L225 Difference]: With dead ends: 141 [2024-11-19 22:27:01,632 INFO L226 Difference]: Without dead ends: 99 [2024-11-19 22:27:01,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:27:01,635 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 51 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 187 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-19 22:27:01,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 187 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:27:01,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-19 22:27:01,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2024-11-19 22:27:01,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.46875) internal successors, (141), 96 states have internal predecessors, (141), 0 states have call successors, (0), 0 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-19 22:27:01,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 141 transitions. [2024-11-19 22:27:01,662 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 141 transitions. Word has length 41 [2024-11-19 22:27:01,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:27:01,663 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 141 transitions. [2024-11-19 22:27:01,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 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-19 22:27:01,663 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 141 transitions. [2024-11-19 22:27:01,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-19 22:27:01,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:27:01,664 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:27:01,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 22:27:01,664 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:27:01,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:27:01,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1000300971, now seen corresponding path program 1 times [2024-11-19 22:27:01,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:27:01,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176106189] [2024-11-19 22:27:01,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:27:01,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:27:01,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:27:01,787 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-19 22:27:01,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:27:01,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176106189] [2024-11-19 22:27:01,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176106189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:27:01,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:27:01,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:27:01,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316191704] [2024-11-19 22:27:01,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:27:01,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:27:01,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:27:01,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:27:01,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:27:01,791 INFO L87 Difference]: Start difference. First operand 97 states and 141 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 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-19 22:27:01,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:27:01,864 INFO L93 Difference]: Finished difference Result 393 states and 613 transitions. [2024-11-19 22:27:01,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:27:01,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2024-11-19 22:27:01,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:27:01,870 INFO L225 Difference]: With dead ends: 393 [2024-11-19 22:27:01,870 INFO L226 Difference]: Without dead ends: 319 [2024-11-19 22:27:01,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:27:01,872 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 397 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:27:01,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 370 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:27:01,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-19 22:27:01,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 169. [2024-11-19 22:27:01,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 1.5119047619047619) internal successors, (254), 168 states have internal predecessors, (254), 0 states have call successors, (0), 0 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-19 22:27:01,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 254 transitions. [2024-11-19 22:27:01,894 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 254 transitions. Word has length 41 [2024-11-19 22:27:01,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:27:01,894 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 254 transitions. [2024-11-19 22:27:01,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 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-19 22:27:01,895 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 254 transitions. [2024-11-19 22:27:01,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-19 22:27:01,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:27:01,896 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:27:01,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 22:27:01,896 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:27:01,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:27:01,896 INFO L85 PathProgramCache]: Analyzing trace with hash 561235574, now seen corresponding path program 1 times [2024-11-19 22:27:01,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:27:01,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238548443] [2024-11-19 22:27:01,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:27:01,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:27:01,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:27:02,079 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-19 22:27:02,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:27:02,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238548443] [2024-11-19 22:27:02,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238548443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:27:02,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:27:02,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:27:02,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661404471] [2024-11-19 22:27:02,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:27:02,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:27:02,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:27:02,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:27:02,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:27:02,081 INFO L87 Difference]: Start difference. First operand 169 states and 254 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 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-19 22:27:02,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:27:02,098 INFO L93 Difference]: Finished difference Result 183 states and 271 transitions. [2024-11-19 22:27:02,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:27:02,099 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2024-11-19 22:27:02,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:27:02,100 INFO L225 Difference]: With dead ends: 183 [2024-11-19 22:27:02,100 INFO L226 Difference]: Without dead ends: 181 [2024-11-19 22:27:02,100 INFO L431 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-19 22:27:02,101 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:27:02,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 340 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:27:02,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-19 22:27:02,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2024-11-19 22:27:02,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.4777777777777779) internal successors, (266), 180 states have internal predecessors, (266), 0 states have call successors, (0), 0 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-19 22:27:02,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 266 transitions. [2024-11-19 22:27:02,108 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 266 transitions. Word has length 42 [2024-11-19 22:27:02,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:27:02,108 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 266 transitions. [2024-11-19 22:27:02,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 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-19 22:27:02,108 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 266 transitions. [2024-11-19 22:27:02,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-19 22:27:02,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:27:02,109 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:27:02,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 22:27:02,110 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:27:02,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:27:02,110 INFO L85 PathProgramCache]: Analyzing trace with hash 271012067, now seen corresponding path program 1 times [2024-11-19 22:27:02,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:27:02,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450177207] [2024-11-19 22:27:02,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:27:02,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:27:02,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:27:02,167 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-19 22:27:02,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:27:02,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450177207] [2024-11-19 22:27:02,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450177207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:27:02,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:27:02,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:27:02,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435770319] [2024-11-19 22:27:02,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:27:02,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:27:02,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:27:02,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:27:02,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:27:02,169 INFO L87 Difference]: Start difference. First operand 181 states and 266 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 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-19 22:27:02,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:27:02,184 INFO L93 Difference]: Finished difference Result 467 states and 702 transitions. [2024-11-19 22:27:02,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:27:02,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2024-11-19 22:27:02,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:27:02,185 INFO L225 Difference]: With dead ends: 467 [2024-11-19 22:27:02,185 INFO L226 Difference]: Without dead ends: 309 [2024-11-19 22:27:02,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:27:02,186 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 39 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:27:02,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 149 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:27:02,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-11-19 22:27:02,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 303. [2024-11-19 22:27:02,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 1.4768211920529801) internal successors, (446), 302 states have internal predecessors, (446), 0 states have call successors, (0), 0 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-19 22:27:02,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 446 transitions. [2024-11-19 22:27:02,207 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 446 transitions. Word has length 43 [2024-11-19 22:27:02,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:27:02,207 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 446 transitions. [2024-11-19 22:27:02,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 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-19 22:27:02,207 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 446 transitions. [2024-11-19 22:27:02,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-19 22:27:02,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:27:02,208 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:27:02,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 22:27:02,208 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:27:02,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:27:02,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1222671217, now seen corresponding path program 1 times [2024-11-19 22:27:02,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:27:02,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437719896] [2024-11-19 22:27:02,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:27:02,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:27:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:27:02,264 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-19 22:27:02,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:27:02,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437719896] [2024-11-19 22:27:02,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437719896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:27:02,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:27:02,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:27:02,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567798118] [2024-11-19 22:27:02,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:27:02,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:27:02,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:27:02,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:27:02,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:27:02,266 INFO L87 Difference]: Start difference. First operand 303 states and 446 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 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-19 22:27:02,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:27:02,288 INFO L93 Difference]: Finished difference Result 799 states and 1180 transitions. [2024-11-19 22:27:02,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:27:02,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2024-11-19 22:27:02,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:27:02,291 INFO L225 Difference]: With dead ends: 799 [2024-11-19 22:27:02,291 INFO L226 Difference]: Without dead ends: 519 [2024-11-19 22:27:02,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:27:02,293 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 47 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 185 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-19 22:27:02,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 185 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:27:02,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2024-11-19 22:27:02,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 517. [2024-11-19 22:27:02,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 516 states have (on average 1.449612403100775) internal successors, (748), 516 states have internal predecessors, (748), 0 states have call successors, (0), 0 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-19 22:27:02,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 748 transitions. [2024-11-19 22:27:02,308 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 748 transitions. Word has length 44 [2024-11-19 22:27:02,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:27:02,308 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 748 transitions. [2024-11-19 22:27:02,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 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-19 22:27:02,308 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 748 transitions. [2024-11-19 22:27:02,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-19 22:27:02,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:27:02,309 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:27:02,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 22:27:02,309 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:27:02,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:27:02,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1273029565, now seen corresponding path program 1 times [2024-11-19 22:27:02,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:27:02,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793706071] [2024-11-19 22:27:02,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:27:02,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:27:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:27:02,369 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-19 22:27:02,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:27:02,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793706071] [2024-11-19 22:27:02,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793706071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:27:02,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:27:02,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:27:02,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372628170] [2024-11-19 22:27:02,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:27:02,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:27:02,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:27:02,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:27:02,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:27:02,373 INFO L87 Difference]: Start difference. First operand 517 states and 748 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:27:02,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:27:02,394 INFO L93 Difference]: Finished difference Result 1004 states and 1466 transitions. [2024-11-19 22:27:02,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:27:02,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-11-19 22:27:02,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:27:02,398 INFO L225 Difference]: With dead ends: 1004 [2024-11-19 22:27:02,398 INFO L226 Difference]: Without dead ends: 721 [2024-11-19 22:27:02,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:27:02,400 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 52 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 197 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-19 22:27:02,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 197 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:27:02,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2024-11-19 22:27:02,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 719. [2024-11-19 22:27:02,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 718 states have (on average 1.434540389972145) internal successors, (1030), 718 states have internal predecessors, (1030), 0 states have call successors, (0), 0 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-19 22:27:02,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1030 transitions. [2024-11-19 22:27:02,422 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1030 transitions. Word has length 45 [2024-11-19 22:27:02,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:27:02,422 INFO L471 AbstractCegarLoop]: Abstraction has 719 states and 1030 transitions. [2024-11-19 22:27:02,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:27:02,423 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1030 transitions. [2024-11-19 22:27:02,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-19 22:27:02,424 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:27:02,424 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:27:02,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 22:27:02,425 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:27:02,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:27:02,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1258504631, now seen corresponding path program 1 times [2024-11-19 22:27:02,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:27:02,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400558400] [2024-11-19 22:27:02,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:27:02,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:27:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:27:02,565 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 22:27:02,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:27:02,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400558400] [2024-11-19 22:27:02,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400558400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:27:02,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:27:02,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:27:02,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652762739] [2024-11-19 22:27:02,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:27:02,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:27:02,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:27:02,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:27:02,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:27:02,567 INFO L87 Difference]: Start difference. First operand 719 states and 1030 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 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-19 22:27:02,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:27:02,629 INFO L93 Difference]: Finished difference Result 1659 states and 2418 transitions. [2024-11-19 22:27:02,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:27:02,630 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 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 63 [2024-11-19 22:27:02,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:27:02,636 INFO L225 Difference]: With dead ends: 1659 [2024-11-19 22:27:02,636 INFO L226 Difference]: Without dead ends: 1305 [2024-11-19 22:27:02,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:27:02,637 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 236 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:27:02,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 392 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:27:02,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2024-11-19 22:27:02,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 1059. [2024-11-19 22:27:02,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1059 states, 1058 states have (on average 1.438563327032136) internal successors, (1522), 1058 states have internal predecessors, (1522), 0 states have call successors, (0), 0 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-19 22:27:02,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1522 transitions. [2024-11-19 22:27:02,668 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1522 transitions. Word has length 63 [2024-11-19 22:27:02,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:27:02,669 INFO L471 AbstractCegarLoop]: Abstraction has 1059 states and 1522 transitions. [2024-11-19 22:27:02,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 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-19 22:27:02,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1522 transitions. [2024-11-19 22:27:02,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-19 22:27:02,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:27:02,672 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:27:02,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 22:27:02,673 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:27:02,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:27:02,673 INFO L85 PathProgramCache]: Analyzing trace with hash -26861640, now seen corresponding path program 1 times [2024-11-19 22:27:02,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:27:02,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017971076] [2024-11-19 22:27:02,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:27:02,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:27:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:27:02,780 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-19 22:27:02,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:27:02,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017971076] [2024-11-19 22:27:02,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017971076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:27:02,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:27:02,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:27:02,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147660048] [2024-11-19 22:27:02,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:27:02,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:27:02,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:27:02,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:27:02,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:27:02,784 INFO L87 Difference]: Start difference. First operand 1059 states and 1522 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 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-19 22:27:02,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:27:02,854 INFO L93 Difference]: Finished difference Result 1999 states and 2910 transitions. [2024-11-19 22:27:02,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:27:02,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 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 63 [2024-11-19 22:27:02,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:27:02,859 INFO L225 Difference]: With dead ends: 1999 [2024-11-19 22:27:02,859 INFO L226 Difference]: Without dead ends: 1645 [2024-11-19 22:27:02,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:27:02,870 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 241 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:27:02,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 381 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:27:02,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1645 states. [2024-11-19 22:27:02,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1645 to 1399. [2024-11-19 22:27:02,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1399 states, 1398 states have (on average 1.4406294706723892) internal successors, (2014), 1398 states have internal predecessors, (2014), 0 states have call successors, (0), 0 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-19 22:27:02,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 1399 states and 2014 transitions. [2024-11-19 22:27:02,897 INFO L78 Accepts]: Start accepts. Automaton has 1399 states and 2014 transitions. Word has length 63 [2024-11-19 22:27:02,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:27:02,897 INFO L471 AbstractCegarLoop]: Abstraction has 1399 states and 2014 transitions. [2024-11-19 22:27:02,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 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-19 22:27:02,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1399 states and 2014 transitions. [2024-11-19 22:27:02,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-19 22:27:02,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:27:02,898 INFO L215 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] [2024-11-19 22:27:02,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 22:27:02,898 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:27:02,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:27:02,899 INFO L85 PathProgramCache]: Analyzing trace with hash -618172044, now seen corresponding path program 1 times [2024-11-19 22:27:02,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:27:02,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136574585] [2024-11-19 22:27:02,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:27:02,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:27:02,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:27:02,981 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:27:02,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:27:02,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136574585] [2024-11-19 22:27:02,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136574585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:27:02,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:27:02,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:27:02,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705565423] [2024-11-19 22:27:02,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:27:02,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:27:02,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:27:02,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:27:02,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:27:02,982 INFO L87 Difference]: Start difference. First operand 1399 states and 2014 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 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-19 22:27:03,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:27:03,007 INFO L93 Difference]: Finished difference Result 2775 states and 4004 transitions. [2024-11-19 22:27:03,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:27:03,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2024-11-19 22:27:03,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:27:03,012 INFO L225 Difference]: With dead ends: 2775 [2024-11-19 22:27:03,012 INFO L226 Difference]: Without dead ends: 1401 [2024-11-19 22:27:03,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:27:03,014 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 42 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 185 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-19 22:27:03,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 185 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:27:03,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2024-11-19 22:27:03,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 1399. [2024-11-19 22:27:03,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1399 states, 1398 states have (on average 1.4234620886981402) internal successors, (1990), 1398 states have internal predecessors, (1990), 0 states have call successors, (0), 0 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-19 22:27:03,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 1399 states and 1990 transitions. [2024-11-19 22:27:03,038 INFO L78 Accepts]: Start accepts. Automaton has 1399 states and 1990 transitions. Word has length 64 [2024-11-19 22:27:03,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:27:03,039 INFO L471 AbstractCegarLoop]: Abstraction has 1399 states and 1990 transitions. [2024-11-19 22:27:03,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 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-19 22:27:03,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1399 states and 1990 transitions. [2024-11-19 22:27:03,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-19 22:27:03,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:27:03,039 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:27:03,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 22:27:03,040 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:27:03,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:27:03,040 INFO L85 PathProgramCache]: Analyzing trace with hash -231923725, now seen corresponding path program 1 times [2024-11-19 22:27:03,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:27:03,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420288697] [2024-11-19 22:27:03,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:27:03,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:27:03,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:27:03,371 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:27:03,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:27:03,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420288697] [2024-11-19 22:27:03,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420288697] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:27:03,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904784610] [2024-11-19 22:27:03,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:27:03,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:27:03,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:27:03,374 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-19 22:27:03,375 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-19 22:27:03,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:27:03,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 22:27:03,463 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:27:04,027 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:27:04,027 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:27:04,517 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:27:04,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904784610] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:27:04,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 22:27:04,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 25 [2024-11-19 22:27:04,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576444729] [2024-11-19 22:27:04,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 22:27:04,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-19 22:27:04,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:27:04,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-19 22:27:04,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2024-11-19 22:27:04,520 INFO L87 Difference]: Start difference. First operand 1399 states and 1990 transitions. Second operand has 25 states, 25 states have (on average 7.24) internal successors, (181), 25 states have internal predecessors, (181), 0 states have call successors, (0), 0 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-19 22:27:11,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:27:11,147 INFO L93 Difference]: Finished difference Result 17149 states and 23946 transitions. [2024-11-19 22:27:11,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2024-11-19 22:27:11,147 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 7.24) internal successors, (181), 25 states have internal predecessors, (181), 0 states have call successors, (0), 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 64 [2024-11-19 22:27:11,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:27:11,190 INFO L225 Difference]: With dead ends: 17149 [2024-11-19 22:27:11,190 INFO L226 Difference]: Without dead ends: 15775 [2024-11-19 22:27:11,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7550 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=3812, Invalid=16780, Unknown=0, NotChecked=0, Total=20592 [2024-11-19 22:27:11,199 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 4712 mSDsluCounter, 1348 mSDsCounter, 0 mSdLazyCounter, 1718 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4712 SdHoareTripleChecker+Valid, 1452 SdHoareTripleChecker+Invalid, 1846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:27:11,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4712 Valid, 1452 Invalid, 1846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1718 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 22:27:11,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15775 states. [2024-11-19 22:27:11,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15775 to 12189. [2024-11-19 22:27:11,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12189 states, 12188 states have (on average 1.3757794552018379) internal successors, (16768), 12188 states have internal predecessors, (16768), 0 states have call successors, (0), 0 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-19 22:27:11,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12189 states to 12189 states and 16768 transitions. [2024-11-19 22:27:11,556 INFO L78 Accepts]: Start accepts. Automaton has 12189 states and 16768 transitions. Word has length 64 [2024-11-19 22:27:11,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:27:11,557 INFO L471 AbstractCegarLoop]: Abstraction has 12189 states and 16768 transitions. [2024-11-19 22:27:11,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 7.24) internal successors, (181), 25 states have internal predecessors, (181), 0 states have call successors, (0), 0 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-19 22:27:11,557 INFO L276 IsEmpty]: Start isEmpty. Operand 12189 states and 16768 transitions. [2024-11-19 22:27:11,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-19 22:27:11,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:27:11,557 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:27:11,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 22:27:11,758 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-19 22:27:11,759 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:27:11,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:27:11,759 INFO L85 PathProgramCache]: Analyzing trace with hash -812650598, now seen corresponding path program 1 times [2024-11-19 22:27:11,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:27:11,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242029133] [2024-11-19 22:27:11,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:27:11,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:27:11,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:27:11,831 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 22:27:11,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:27:11,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242029133] [2024-11-19 22:27:11,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242029133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:27:11,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:27:11,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:27:11,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023554598] [2024-11-19 22:27:11,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:27:11,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:27:11,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:27:11,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:27:11,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:27:11,834 INFO L87 Difference]: Start difference. First operand 12189 states and 16768 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 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-19 22:27:12,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:27:12,159 INFO L93 Difference]: Finished difference Result 21604 states and 30003 transitions. [2024-11-19 22:27:12,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:27:12,160 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 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 65 [2024-11-19 22:27:12,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:27:12,192 INFO L225 Difference]: With dead ends: 21604 [2024-11-19 22:27:12,193 INFO L226 Difference]: Without dead ends: 18402 [2024-11-19 22:27:12,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:27:12,198 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 228 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:27:12,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 434 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:27:12,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18402 states. [2024-11-19 22:27:12,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18402 to 15207. [2024-11-19 22:27:12,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15207 states, 15206 states have (on average 1.3736682888333553) internal successors, (20888), 15206 states have internal predecessors, (20888), 0 states have call successors, (0), 0 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-19 22:27:12,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15207 states to 15207 states and 20888 transitions. [2024-11-19 22:27:12,617 INFO L78 Accepts]: Start accepts. Automaton has 15207 states and 20888 transitions. Word has length 65 [2024-11-19 22:27:12,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:27:12,617 INFO L471 AbstractCegarLoop]: Abstraction has 15207 states and 20888 transitions. [2024-11-19 22:27:12,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 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-19 22:27:12,618 INFO L276 IsEmpty]: Start isEmpty. Operand 15207 states and 20888 transitions. [2024-11-19 22:27:12,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-19 22:27:12,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:27:12,620 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:27:12,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 22:27:12,621 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:27:12,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:27:12,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1441709853, now seen corresponding path program 1 times [2024-11-19 22:27:12,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:27:12,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314074034] [2024-11-19 22:27:12,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:27:12,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:27:12,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:27:12,954 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:27:12,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:27:12,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314074034] [2024-11-19 22:27:12,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314074034] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:27:12,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336466764] [2024-11-19 22:27:12,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:27:12,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:27:12,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:27:12,956 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-19 22:27:12,958 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-19 22:27:13,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:27:13,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-19 22:27:13,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:27:13,640 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:27:13,640 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:27:14,451 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:27:14,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336466764] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:27:14,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 22:27:14,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 32 [2024-11-19 22:27:14,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014302494] [2024-11-19 22:27:14,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 22:27:14,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-19 22:27:14,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:27:14,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-19 22:27:14,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=887, Unknown=0, NotChecked=0, Total=992 [2024-11-19 22:27:14,455 INFO L87 Difference]: Start difference. First operand 15207 states and 20888 transitions. Second operand has 32 states, 32 states have (on average 5.78125) internal successors, (185), 32 states have internal predecessors, (185), 0 states have call successors, (0), 0 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-19 22:27:50,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:27:50,470 INFO L93 Difference]: Finished difference Result 655304 states and 923146 transitions. [2024-11-19 22:27:50,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 570 states. [2024-11-19 22:27:50,471 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 5.78125) internal successors, (185), 32 states have internal predecessors, (185), 0 states have call successors, (0), 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 68 [2024-11-19 22:27:50,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:27:51,716 INFO L225 Difference]: With dead ends: 655304 [2024-11-19 22:27:51,716 INFO L226 Difference]: Without dead ends: 640124 [2024-11-19 22:27:51,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 712 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 598 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173613 ImplicationChecksByTransitivity, 23.9s TimeCoverageRelationStatistics Valid=34069, Invalid=325331, Unknown=0, NotChecked=0, Total=359400 [2024-11-19 22:27:51,871 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 11022 mSDsluCounter, 4538 mSDsCounter, 0 mSdLazyCounter, 6005 mSolverCounterSat, 296 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11022 SdHoareTripleChecker+Valid, 4715 SdHoareTripleChecker+Invalid, 6301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 6005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-19 22:27:51,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11022 Valid, 4715 Invalid, 6301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [296 Valid, 6005 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-19 22:27:52,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640124 states. [2024-11-19 22:27:58,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640124 to 143844. [2024-11-19 22:27:59,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143844 states, 143843 states have (on average 1.3768970335713242) internal successors, (198057), 143843 states have internal predecessors, (198057), 0 states have call successors, (0), 0 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-19 22:27:59,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143844 states to 143844 states and 198057 transitions. [2024-11-19 22:27:59,234 INFO L78 Accepts]: Start accepts. Automaton has 143844 states and 198057 transitions. Word has length 68 [2024-11-19 22:27:59,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:27:59,235 INFO L471 AbstractCegarLoop]: Abstraction has 143844 states and 198057 transitions. [2024-11-19 22:27:59,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.78125) internal successors, (185), 32 states have internal predecessors, (185), 0 states have call successors, (0), 0 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-19 22:27:59,235 INFO L276 IsEmpty]: Start isEmpty. Operand 143844 states and 198057 transitions. [2024-11-19 22:27:59,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-19 22:27:59,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:27:59,236 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:27:59,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 22:27:59,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-19 22:27:59,436 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:27:59,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:27:59,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1946824194, now seen corresponding path program 1 times [2024-11-19 22:27:59,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:27:59,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019849694] [2024-11-19 22:27:59,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:27:59,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:27:59,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:27:59,488 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-19 22:27:59,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:27:59,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019849694] [2024-11-19 22:27:59,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019849694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:27:59,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:27:59,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:27:59,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215861831] [2024-11-19 22:27:59,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:27:59,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:27:59,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:27:59,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:27:59,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:27:59,490 INFO L87 Difference]: Start difference. First operand 143844 states and 198057 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 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-19 22:28:01,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:28:01,520 INFO L93 Difference]: Finished difference Result 220908 states and 303715 transitions. [2024-11-19 22:28:01,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:28:01,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2024-11-19 22:28:01,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:28:01,621 INFO L225 Difference]: With dead ends: 220908 [2024-11-19 22:28:01,621 INFO L226 Difference]: Without dead ends: 77567 [2024-11-19 22:28:01,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:28:01,686 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 29 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 172 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.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:28:01,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 172 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:28:01,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77567 states. [2024-11-19 22:28:03,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77567 to 75309. [2024-11-19 22:28:03,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75309 states, 75308 states have (on average 1.3439076857704362) internal successors, (101207), 75308 states have internal predecessors, (101207), 0 states have call successors, (0), 0 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-19 22:28:03,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75309 states to 75309 states and 101207 transitions. [2024-11-19 22:28:03,865 INFO L78 Accepts]: Start accepts. Automaton has 75309 states and 101207 transitions. Word has length 68 [2024-11-19 22:28:03,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:28:03,865 INFO L471 AbstractCegarLoop]: Abstraction has 75309 states and 101207 transitions. [2024-11-19 22:28:03,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 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-19 22:28:03,865 INFO L276 IsEmpty]: Start isEmpty. Operand 75309 states and 101207 transitions. [2024-11-19 22:28:03,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-19 22:28:03,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:28:03,866 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:28:03,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 22:28:03,866 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:28:03,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:28:03,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1554454534, now seen corresponding path program 1 times [2024-11-19 22:28:03,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:28:03,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894890344] [2024-11-19 22:28:03,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:28:03,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:28:03,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:28:03,900 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:28:03,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:28:03,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894890344] [2024-11-19 22:28:03,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894890344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:28:03,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:28:03,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:28:03,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204246371] [2024-11-19 22:28:03,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:28:03,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:28:03,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:28:03,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:28:03,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:28:03,901 INFO L87 Difference]: Start difference. First operand 75309 states and 101207 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 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-19 22:28:05,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:28:05,914 INFO L93 Difference]: Finished difference Result 160423 states and 215409 transitions. [2024-11-19 22:28:05,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:28:05,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2024-11-19 22:28:05,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:28:06,001 INFO L225 Difference]: With dead ends: 160423 [2024-11-19 22:28:06,001 INFO L226 Difference]: Without dead ends: 85389 [2024-11-19 22:28:06,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:28:06,033 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 38 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:28:06,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 179 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:28:06,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85389 states. [2024-11-19 22:28:08,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85389 to 83975. [2024-11-19 22:28:08,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83975 states, 83974 states have (on average 1.3163002834210589) internal successors, (110535), 83974 states have internal predecessors, (110535), 0 states have call successors, (0), 0 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-19 22:28:08,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83975 states to 83975 states and 110535 transitions. [2024-11-19 22:28:08,797 INFO L78 Accepts]: Start accepts. Automaton has 83975 states and 110535 transitions. Word has length 69 [2024-11-19 22:28:08,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:28:08,797 INFO L471 AbstractCegarLoop]: Abstraction has 83975 states and 110535 transitions. [2024-11-19 22:28:08,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 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-19 22:28:08,798 INFO L276 IsEmpty]: Start isEmpty. Operand 83975 states and 110535 transitions. [2024-11-19 22:28:08,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-19 22:28:08,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:28:08,799 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:28:08,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 22:28:08,799 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:28:08,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:28:08,802 INFO L85 PathProgramCache]: Analyzing trace with hash -275378682, now seen corresponding path program 1 times [2024-11-19 22:28:08,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:28:08,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223716160] [2024-11-19 22:28:08,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:28:08,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:28:08,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:28:08,833 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:28:08,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:28:08,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223716160] [2024-11-19 22:28:08,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223716160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:28:08,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:28:08,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:28:08,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460902456] [2024-11-19 22:28:08,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:28:08,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:28:08,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:28:08,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:28:08,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:28:08,835 INFO L87 Difference]: Start difference. First operand 83975 states and 110535 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 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-19 22:28:10,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:28:10,911 INFO L93 Difference]: Finished difference Result 177232 states and 232875 transitions. [2024-11-19 22:28:10,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:28:10,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2024-11-19 22:28:10,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:28:11,027 INFO L225 Difference]: With dead ends: 177232 [2024-11-19 22:28:11,027 INFO L226 Difference]: Without dead ends: 93726 [2024-11-19 22:28:11,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:28:11,063 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 37 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:28:11,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 207 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:28:11,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93726 states.