./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label32.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label32.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 60c0fa34c18dde6742c3bd779d2643fe781c7455d58a961a280a354d3d1e679c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:33:33,115 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:33:33,174 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:33:33,179 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:33:33,180 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:33:33,211 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:33:33,211 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:33:33,212 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:33:33,212 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:33:33,213 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:33:33,213 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:33:33,213 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:33:33,214 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:33:33,214 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:33:33,215 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:33:33,215 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:33:33,215 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:33:33,216 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:33:33,216 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:33:33,216 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:33:33,217 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:33:33,217 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:33:33,217 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:33:33,218 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:33:33,218 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:33:33,218 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:33:33,218 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:33:33,219 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:33:33,219 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:33:33,219 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:33:33,219 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:33:33,220 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:33:33,220 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:33:33,220 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:33:33,220 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:33:33,221 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:33:33,221 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:33:33,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:33:33,222 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:33:33,222 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:33:33,222 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:33:33,224 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:33:33,224 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 60c0fa34c18dde6742c3bd779d2643fe781c7455d58a961a280a354d3d1e679c [2024-10-10 23:33:33,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:33:33,488 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:33:33,491 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:33:33,493 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:33:33,493 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:33:33,494 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label32.c [2024-10-10 23:33:34,900 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:33:35,192 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:33:35,193 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label32.c [2024-10-10 23:33:35,207 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c0936d497/56b89dff61354b7ca8d664981de0532e/FLAG8950f1005 [2024-10-10 23:33:35,472 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c0936d497/56b89dff61354b7ca8d664981de0532e [2024-10-10 23:33:35,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:33:35,478 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:33:35,480 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:33:35,480 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:33:35,486 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:33:35,487 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:33:35" (1/1) ... [2024-10-10 23:33:35,488 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14efe736 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:33:35, skipping insertion in model container [2024-10-10 23:33:35,490 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:33:35" (1/1) ... [2024-10-10 23:33:35,545 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:33:35,869 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label32.c[5661,5674] [2024-10-10 23:33:36,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:33:36,023 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:33:36,043 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label32.c[5661,5674] [2024-10-10 23:33:36,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:33:36,158 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:33:36,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:33:36 WrapperNode [2024-10-10 23:33:36,164 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:33:36,166 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:33:36,166 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:33:36,166 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:33:36,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:33:36" (1/1) ... [2024-10-10 23:33:36,201 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:33:36" (1/1) ... [2024-10-10 23:33:36,272 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 859 [2024-10-10 23:33:36,272 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:33:36,273 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:33:36,273 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:33:36,273 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:33:36,284 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:33:36" (1/1) ... [2024-10-10 23:33:36,284 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:33:36" (1/1) ... [2024-10-10 23:33:36,295 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:33:36" (1/1) ... [2024-10-10 23:33:36,334 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 23:33:36,334 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:33:36" (1/1) ... [2024-10-10 23:33:36,334 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:33:36" (1/1) ... [2024-10-10 23:33:36,362 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:33:36" (1/1) ... [2024-10-10 23:33:36,369 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:33:36" (1/1) ... [2024-10-10 23:33:36,382 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:33:36" (1/1) ... [2024-10-10 23:33:36,392 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:33:36" (1/1) ... [2024-10-10 23:33:36,403 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:33:36,405 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:33:36,405 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:33:36,405 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:33:36,406 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:33:36" (1/1) ... [2024-10-10 23:33:36,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:33:36,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:33:36,439 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:33:36,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:33:36,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:33:36,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:33:36,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:33:36,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:33:36,568 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:33:36,570 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:33:37,838 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-10-10 23:33:37,838 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:33:37,944 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:33:37,945 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:33:37,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:33:37 BoogieIcfgContainer [2024-10-10 23:33:37,945 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:33:37,947 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:33:37,947 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:33:37,955 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:33:37,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:33:35" (1/3) ... [2024-10-10 23:33:37,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@474422ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:33:37, skipping insertion in model container [2024-10-10 23:33:37,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:33:36" (2/3) ... [2024-10-10 23:33:37,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@474422ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:33:37, skipping insertion in model container [2024-10-10 23:33:37,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:33:37" (3/3) ... [2024-10-10 23:33:37,962 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label32.c [2024-10-10 23:33:37,981 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:33:37,982 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:33:38,049 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:33:38,054 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;@41dbf559, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:33:38,055 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:33:38,058 INFO L276 IsEmpty]: Start isEmpty. Operand has 183 states, 181 states have (on average 1.988950276243094) internal successors, (360), 182 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:38,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-10 23:33:38,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:38,066 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:33:38,066 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:38,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:38,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1505057653, now seen corresponding path program 1 times [2024-10-10 23:33:38,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:38,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822876144] [2024-10-10 23:33:38,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:38,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:38,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:38,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:33:38,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:38,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822876144] [2024-10-10 23:33:38,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822876144] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:38,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:33:38,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:33:38,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926239649] [2024-10-10 23:33:38,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:38,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:33:38,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:38,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:33:38,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:33:38,277 INFO L87 Difference]: Start difference. First operand has 183 states, 181 states have (on average 1.988950276243094) internal successors, (360), 182 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:38,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:38,313 INFO L93 Difference]: Finished difference Result 365 states and 719 transitions. [2024-10-10 23:33:38,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:33:38,316 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-10-10 23:33:38,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:38,325 INFO L225 Difference]: With dead ends: 365 [2024-10-10 23:33:38,326 INFO L226 Difference]: Without dead ends: 181 [2024-10-10 23:33:38,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:33:38,332 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:38,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 295 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:33:38,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-10 23:33:38,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2024-10-10 23:33:38,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.6388888888888888) internal successors, (295), 180 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:38,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 295 transitions. [2024-10-10 23:33:38,388 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 295 transitions. Word has length 54 [2024-10-10 23:33:38,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:38,388 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 295 transitions. [2024-10-10 23:33:38,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:38,389 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 295 transitions. [2024-10-10 23:33:38,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-10 23:33:38,390 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:38,390 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:33:38,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:33:38,391 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:38,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:38,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1515811875, now seen corresponding path program 1 times [2024-10-10 23:33:38,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:38,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862461] [2024-10-10 23:33:38,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:38,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:38,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:38,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:33:38,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:38,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862461] [2024-10-10 23:33:38,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862461] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:38,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:33:38,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:33:38,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088006763] [2024-10-10 23:33:38,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:38,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:33:38,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:38,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:33:38,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:33:38,638 INFO L87 Difference]: Start difference. First operand 181 states and 295 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:39,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:39,395 INFO L93 Difference]: Finished difference Result 361 states and 589 transitions. [2024-10-10 23:33:39,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:33:39,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-10-10 23:33:39,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:39,398 INFO L225 Difference]: With dead ends: 361 [2024-10-10 23:33:39,398 INFO L226 Difference]: Without dead ends: 359 [2024-10-10 23:33:39,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:33:39,400 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 147 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:39,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 10 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:33:39,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-10-10 23:33:39,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2024-10-10 23:33:39,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 1.6396648044692737) internal successors, (587), 358 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:39,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 587 transitions. [2024-10-10 23:33:39,444 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 587 transitions. Word has length 54 [2024-10-10 23:33:39,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:39,445 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 587 transitions. [2024-10-10 23:33:39,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:39,445 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 587 transitions. [2024-10-10 23:33:39,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-10 23:33:39,455 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:39,455 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:33:39,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:33:39,456 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:39,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:39,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1825084560, now seen corresponding path program 1 times [2024-10-10 23:33:39,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:39,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548306199] [2024-10-10 23:33:39,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:39,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:39,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:39,661 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:33:39,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:39,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548306199] [2024-10-10 23:33:39,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548306199] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:39,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:33:39,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:33:39,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177216392] [2024-10-10 23:33:39,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:39,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:33:39,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:39,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:33:39,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:33:39,665 INFO L87 Difference]: Start difference. First operand 359 states and 587 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:40,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:40,398 INFO L93 Difference]: Finished difference Result 1073 states and 1758 transitions. [2024-10-10 23:33:40,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:33:40,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2024-10-10 23:33:40,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:40,402 INFO L225 Difference]: With dead ends: 1073 [2024-10-10 23:33:40,403 INFO L226 Difference]: Without dead ends: 715 [2024-10-10 23:33:40,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:33:40,405 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 132 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:40,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 87 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:33:40,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2024-10-10 23:33:40,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 537. [2024-10-10 23:33:40,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 536 states have (on average 1.4944029850746268) internal successors, (801), 536 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:40,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 801 transitions. [2024-10-10 23:33:40,429 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 801 transitions. Word has length 119 [2024-10-10 23:33:40,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:40,429 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 801 transitions. [2024-10-10 23:33:40,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:40,429 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 801 transitions. [2024-10-10 23:33:40,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-10 23:33:40,432 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:40,432 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:33:40,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:33:40,433 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:40,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:40,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1503191597, now seen corresponding path program 1 times [2024-10-10 23:33:40,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:40,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533437973] [2024-10-10 23:33:40,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:40,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:40,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:40,808 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:33:40,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:40,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533437973] [2024-10-10 23:33:40,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533437973] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:40,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:33:40,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:33:40,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083247755] [2024-10-10 23:33:40,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:40,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:33:40,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:40,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:33:40,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:33:40,814 INFO L87 Difference]: Start difference. First operand 537 states and 801 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:41,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:41,809 INFO L93 Difference]: Finished difference Result 1429 states and 2029 transitions. [2024-10-10 23:33:41,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:33:41,810 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 133 [2024-10-10 23:33:41,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:41,818 INFO L225 Difference]: With dead ends: 1429 [2024-10-10 23:33:41,819 INFO L226 Difference]: Without dead ends: 893 [2024-10-10 23:33:41,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:33:41,823 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 418 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:41,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 119 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-10 23:33:41,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2024-10-10 23:33:41,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 893. [2024-10-10 23:33:41,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 893 states, 892 states have (on average 1.3374439461883407) internal successors, (1193), 892 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:41,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1193 transitions. [2024-10-10 23:33:41,854 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1193 transitions. Word has length 133 [2024-10-10 23:33:41,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:41,855 INFO L471 AbstractCegarLoop]: Abstraction has 893 states and 1193 transitions. [2024-10-10 23:33:41,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:41,855 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1193 transitions. [2024-10-10 23:33:41,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-10 23:33:41,866 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:41,866 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-10 23:33:41,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:33:41,867 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:41,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:41,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1776121376, now seen corresponding path program 1 times [2024-10-10 23:33:41,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:41,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993800580] [2024-10-10 23:33:41,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:41,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:41,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:42,251 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-10 23:33:42,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:42,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993800580] [2024-10-10 23:33:42,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993800580] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:42,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:33:42,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:33:42,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947581573] [2024-10-10 23:33:42,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:42,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:33:42,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:42,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:33:42,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:33:42,260 INFO L87 Difference]: Start difference. First operand 893 states and 1193 transitions. Second operand has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:42,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:42,968 INFO L93 Difference]: Finished difference Result 1992 states and 2628 transitions. [2024-10-10 23:33:42,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:33:42,969 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 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 213 [2024-10-10 23:33:42,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:42,974 INFO L225 Difference]: With dead ends: 1992 [2024-10-10 23:33:42,974 INFO L226 Difference]: Without dead ends: 1071 [2024-10-10 23:33:42,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:33:42,978 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 116 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:42,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 116 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:33:42,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2024-10-10 23:33:43,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1071. [2024-10-10 23:33:43,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 1070 states have (on average 1.1803738317757009) internal successors, (1263), 1070 states have internal predecessors, (1263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:43,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1263 transitions. [2024-10-10 23:33:43,006 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1263 transitions. Word has length 213 [2024-10-10 23:33:43,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:43,008 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1263 transitions. [2024-10-10 23:33:43,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:43,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1263 transitions. [2024-10-10 23:33:43,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-10-10 23:33:43,015 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:43,016 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:33:43,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:33:43,016 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:43,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:43,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1022050596, now seen corresponding path program 1 times [2024-10-10 23:33:43,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:43,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22127491] [2024-10-10 23:33:43,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:43,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:43,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:43,376 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 105 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:33:43,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:43,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22127491] [2024-10-10 23:33:43,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22127491] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:33:43,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490541550] [2024-10-10 23:33:43,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:43,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:33:43,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:33:43,380 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:33:43,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:33:43,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:43,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:33:43,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:33:43,733 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-10 23:33:43,736 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:33:43,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490541550] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:43,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:33:43,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-10 23:33:43,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014344548] [2024-10-10 23:33:43,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:43,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:33:43,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:43,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:33:43,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:33:43,739 INFO L87 Difference]: Start difference. First operand 1071 states and 1263 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:44,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:44,301 INFO L93 Difference]: Finished difference Result 2319 states and 2778 transitions. [2024-10-10 23:33:44,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:33:44,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 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 225 [2024-10-10 23:33:44,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:44,307 INFO L225 Difference]: With dead ends: 2319 [2024-10-10 23:33:44,307 INFO L226 Difference]: Without dead ends: 1249 [2024-10-10 23:33:44,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:33:44,309 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 84 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:44,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 45 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:33:44,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2024-10-10 23:33:44,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1071. [2024-10-10 23:33:44,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 1070 states have (on average 1.1672897196261682) internal successors, (1249), 1070 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:44,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1249 transitions. [2024-10-10 23:33:44,329 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1249 transitions. Word has length 225 [2024-10-10 23:33:44,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:44,330 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1249 transitions. [2024-10-10 23:33:44,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:44,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1249 transitions. [2024-10-10 23:33:44,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-10-10 23:33:44,333 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:44,333 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:33:44,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-10 23:33:44,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:33:44,534 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:44,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:44,535 INFO L85 PathProgramCache]: Analyzing trace with hash 138538019, now seen corresponding path program 1 times [2024-10-10 23:33:44,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:44,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766416633] [2024-10-10 23:33:44,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:44,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:44,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:44,851 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:33:44,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:44,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766416633] [2024-10-10 23:33:44,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766416633] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:44,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:33:44,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:33:44,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894831144] [2024-10-10 23:33:44,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:44,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:33:44,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:44,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:33:44,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:33:44,856 INFO L87 Difference]: Start difference. First operand 1071 states and 1249 transitions. Second operand has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:45,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:45,442 INFO L93 Difference]: Finished difference Result 2853 states and 3361 transitions. [2024-10-10 23:33:45,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:33:45,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 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 228 [2024-10-10 23:33:45,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:45,449 INFO L225 Difference]: With dead ends: 2853 [2024-10-10 23:33:45,450 INFO L226 Difference]: Without dead ends: 1783 [2024-10-10 23:33:45,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:33:45,452 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 110 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:45,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 75 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:33:45,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2024-10-10 23:33:45,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1605. [2024-10-10 23:33:45,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1605 states, 1604 states have (on average 1.1365336658354115) internal successors, (1823), 1604 states have internal predecessors, (1823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:45,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 1823 transitions. [2024-10-10 23:33:45,488 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 1823 transitions. Word has length 228 [2024-10-10 23:33:45,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:45,488 INFO L471 AbstractCegarLoop]: Abstraction has 1605 states and 1823 transitions. [2024-10-10 23:33:45,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:45,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 1823 transitions. [2024-10-10 23:33:45,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2024-10-10 23:33:45,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:45,494 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:33:45,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:33:45,497 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:45,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:45,498 INFO L85 PathProgramCache]: Analyzing trace with hash 287115379, now seen corresponding path program 1 times [2024-10-10 23:33:45,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:45,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458753393] [2024-10-10 23:33:45,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:45,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:45,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:45,859 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2024-10-10 23:33:45,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:45,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458753393] [2024-10-10 23:33:45,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458753393] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:45,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:33:45,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:33:45,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895679476] [2024-10-10 23:33:45,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:45,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:33:45,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:45,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:33:45,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:33:45,862 INFO L87 Difference]: Start difference. First operand 1605 states and 1823 transitions. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:46,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:46,480 INFO L93 Difference]: Finished difference Result 3267 states and 3726 transitions. [2024-10-10 23:33:46,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:33:46,481 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 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 345 [2024-10-10 23:33:46,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:46,486 INFO L225 Difference]: With dead ends: 3267 [2024-10-10 23:33:46,487 INFO L226 Difference]: Without dead ends: 1783 [2024-10-10 23:33:46,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:33:46,489 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 141 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:46,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 14 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:33:46,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2024-10-10 23:33:46,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1605. [2024-10-10 23:33:46,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1605 states, 1604 states have (on average 1.0910224438902743) internal successors, (1750), 1604 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:46,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 1750 transitions. [2024-10-10 23:33:46,514 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 1750 transitions. Word has length 345 [2024-10-10 23:33:46,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:46,514 INFO L471 AbstractCegarLoop]: Abstraction has 1605 states and 1750 transitions. [2024-10-10 23:33:46,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:46,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 1750 transitions. [2024-10-10 23:33:46,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2024-10-10 23:33:46,520 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:46,521 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2024-10-10 23:33:46,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:33:46,521 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:46,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:46,522 INFO L85 PathProgramCache]: Analyzing trace with hash -2112077469, now seen corresponding path program 1 times [2024-10-10 23:33:46,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:46,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730940940] [2024-10-10 23:33:46,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:46,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:46,957 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 417 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-10 23:33:46,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:46,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730940940] [2024-10-10 23:33:46,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730940940] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:46,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:33:46,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:33:46,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925973974] [2024-10-10 23:33:46,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:46,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:33:46,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:46,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:33:46,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:33:46,965 INFO L87 Difference]: Start difference. First operand 1605 states and 1750 transitions. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:47,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:47,551 INFO L93 Difference]: Finished difference Result 3921 states and 4308 transitions. [2024-10-10 23:33:47,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:33:47,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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 440 [2024-10-10 23:33:47,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:47,561 INFO L225 Difference]: With dead ends: 3921 [2024-10-10 23:33:47,561 INFO L226 Difference]: Without dead ends: 2495 [2024-10-10 23:33:47,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:33:47,566 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 110 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:47,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 242 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:33:47,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2495 states. [2024-10-10 23:33:47,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2495 to 1961. [2024-10-10 23:33:47,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1961 states, 1960 states have (on average 1.0760204081632654) internal successors, (2109), 1960 states have internal predecessors, (2109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:47,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1961 states to 1961 states and 2109 transitions. [2024-10-10 23:33:47,610 INFO L78 Accepts]: Start accepts. Automaton has 1961 states and 2109 transitions. Word has length 440 [2024-10-10 23:33:47,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:47,611 INFO L471 AbstractCegarLoop]: Abstraction has 1961 states and 2109 transitions. [2024-10-10 23:33:47,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:47,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1961 states and 2109 transitions. [2024-10-10 23:33:47,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2024-10-10 23:33:47,618 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:47,618 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:33:47,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:33:47,619 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:47,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:47,619 INFO L85 PathProgramCache]: Analyzing trace with hash -188423150, now seen corresponding path program 1 times [2024-10-10 23:33:47,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:47,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390252540] [2024-10-10 23:33:47,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:47,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:47,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:48,075 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 417 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-10 23:33:48,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:48,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390252540] [2024-10-10 23:33:48,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390252540] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:48,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:33:48,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:33:48,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814308170] [2024-10-10 23:33:48,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:48,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:33:48,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:48,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:33:48,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:33:48,078 INFO L87 Difference]: Start difference. First operand 1961 states and 2109 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:48,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:48,611 INFO L93 Difference]: Finished difference Result 4455 states and 4860 transitions. [2024-10-10 23:33:48,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:33:48,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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 447 [2024-10-10 23:33:48,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:48,621 INFO L225 Difference]: With dead ends: 4455 [2024-10-10 23:33:48,621 INFO L226 Difference]: Without dead ends: 2673 [2024-10-10 23:33:48,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:33:48,624 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 113 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:48,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 199 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:33:48,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2673 states. [2024-10-10 23:33:48,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2673 to 2673. [2024-10-10 23:33:48,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2673 states, 2672 states have (on average 1.0819610778443114) internal successors, (2891), 2672 states have internal predecessors, (2891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:48,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2673 states to 2673 states and 2891 transitions. [2024-10-10 23:33:48,672 INFO L78 Accepts]: Start accepts. Automaton has 2673 states and 2891 transitions. Word has length 447 [2024-10-10 23:33:48,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:48,673 INFO L471 AbstractCegarLoop]: Abstraction has 2673 states and 2891 transitions. [2024-10-10 23:33:48,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:48,673 INFO L276 IsEmpty]: Start isEmpty. Operand 2673 states and 2891 transitions. [2024-10-10 23:33:48,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2024-10-10 23:33:48,681 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:48,681 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:33:48,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:33:48,681 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:48,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:48,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1889732733, now seen corresponding path program 1 times [2024-10-10 23:33:48,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:48,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9156813] [2024-10-10 23:33:48,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:48,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:48,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:48,982 INFO L134 CoverageAnalysis]: Checked inductivity of 845 backedges. 531 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-10 23:33:48,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:48,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9156813] [2024-10-10 23:33:48,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9156813] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:48,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:33:48,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:33:48,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267703042] [2024-10-10 23:33:48,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:48,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:33:48,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:48,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:33:48,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:33:48,984 INFO L87 Difference]: Start difference. First operand 2673 states and 2891 transitions. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:49,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:49,523 INFO L93 Difference]: Finished difference Result 6413 states and 7026 transitions. [2024-10-10 23:33:49,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:33:49,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 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 488 [2024-10-10 23:33:49,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:49,538 INFO L225 Difference]: With dead ends: 6413 [2024-10-10 23:33:49,539 INFO L226 Difference]: Without dead ends: 3919 [2024-10-10 23:33:49,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:33:49,543 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 71 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:49,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 50 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:33:49,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3919 states. [2024-10-10 23:33:49,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3919 to 3563. [2024-10-10 23:33:49,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3563 states, 3562 states have (on average 1.0777653003930376) internal successors, (3839), 3562 states have internal predecessors, (3839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:49,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3563 states to 3563 states and 3839 transitions. [2024-10-10 23:33:49,622 INFO L78 Accepts]: Start accepts. Automaton has 3563 states and 3839 transitions. Word has length 488 [2024-10-10 23:33:49,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:49,623 INFO L471 AbstractCegarLoop]: Abstraction has 3563 states and 3839 transitions. [2024-10-10 23:33:49,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:49,623 INFO L276 IsEmpty]: Start isEmpty. Operand 3563 states and 3839 transitions. [2024-10-10 23:33:49,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 634 [2024-10-10 23:33:49,628 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:49,629 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:33:49,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:33:49,642 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:49,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:49,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1493525689, now seen corresponding path program 1 times [2024-10-10 23:33:49,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:49,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238118025] [2024-10-10 23:33:49,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:49,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:49,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:50,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1605 backedges. 1134 proven. 104 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2024-10-10 23:33:50,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:50,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238118025] [2024-10-10 23:33:50,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238118025] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:33:50,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86575382] [2024-10-10 23:33:50,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:50,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:33:50,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:33:50,415 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:33:50,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 23:33:50,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:50,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 23:33:50,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:33:51,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1605 backedges. 1161 proven. 0 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2024-10-10 23:33:51,280 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:33:51,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86575382] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:51,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:33:51,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-10 23:33:51,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020468565] [2024-10-10 23:33:51,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:51,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:33:51,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:51,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:33:51,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:33:51,283 INFO L87 Difference]: Start difference. First operand 3563 states and 3839 transitions. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:51,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:51,687 INFO L93 Difference]: Finished difference Result 7125 states and 7692 transitions. [2024-10-10 23:33:51,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:33:51,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 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 633 [2024-10-10 23:33:51,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:51,701 INFO L225 Difference]: With dead ends: 7125 [2024-10-10 23:33:51,701 INFO L226 Difference]: Without dead ends: 3741 [2024-10-10 23:33:51,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 637 GetRequests, 632 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:33:51,706 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 71 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:51,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 240 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:33:51,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3741 states. [2024-10-10 23:33:51,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3741 to 3385. [2024-10-10 23:33:51,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3385 states, 3384 states have (on average 1.074468085106383) internal successors, (3636), 3384 states have internal predecessors, (3636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:51,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3385 states to 3385 states and 3636 transitions. [2024-10-10 23:33:51,783 INFO L78 Accepts]: Start accepts. Automaton has 3385 states and 3636 transitions. Word has length 633 [2024-10-10 23:33:51,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:51,784 INFO L471 AbstractCegarLoop]: Abstraction has 3385 states and 3636 transitions. [2024-10-10 23:33:51,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:51,785 INFO L276 IsEmpty]: Start isEmpty. Operand 3385 states and 3636 transitions. [2024-10-10 23:33:51,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2024-10-10 23:33:51,789 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:51,791 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 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-10-10 23:33:51,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-10 23:33:51,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:33:51,995 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:51,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:51,995 INFO L85 PathProgramCache]: Analyzing trace with hash -339441945, now seen corresponding path program 1 times [2024-10-10 23:33:51,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:51,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445080530] [2024-10-10 23:33:51,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:51,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:52,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:52,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 907 proven. 110 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-10 23:33:52,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:52,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445080530] [2024-10-10 23:33:52,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445080530] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:33:52,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289303561] [2024-10-10 23:33:52,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:52,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:33:52,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:33:52,445 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:33:52,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 23:33:52,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:52,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 802 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:33:52,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:33:52,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2024-10-10 23:33:52,712 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:33:52,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289303561] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:52,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:33:52,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-10 23:33:52,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932489217] [2024-10-10 23:33:52,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:52,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:33:52,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:52,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:33:52,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:33:52,717 INFO L87 Difference]: Start difference. First operand 3385 states and 3636 transitions. Second operand has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:53,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:53,080 INFO L93 Difference]: Finished difference Result 7303 states and 7862 transitions. [2024-10-10 23:33:53,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:33:53,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 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 643 [2024-10-10 23:33:53,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:53,089 INFO L225 Difference]: With dead ends: 7303 [2024-10-10 23:33:53,089 INFO L226 Difference]: Without dead ends: 3385 [2024-10-10 23:33:53,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 646 GetRequests, 643 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:33:53,093 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 126 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:53,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 238 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 23:33:53,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3385 states. [2024-10-10 23:33:53,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3385 to 3029. [2024-10-10 23:33:53,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3029 states, 3028 states have (on average 1.07331571994716) internal successors, (3250), 3028 states have internal predecessors, (3250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:53,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3029 states to 3029 states and 3250 transitions. [2024-10-10 23:33:53,131 INFO L78 Accepts]: Start accepts. Automaton has 3029 states and 3250 transitions. Word has length 643 [2024-10-10 23:33:53,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:53,132 INFO L471 AbstractCegarLoop]: Abstraction has 3029 states and 3250 transitions. [2024-10-10 23:33:53,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:53,132 INFO L276 IsEmpty]: Start isEmpty. Operand 3029 states and 3250 transitions. [2024-10-10 23:33:53,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 779 [2024-10-10 23:33:53,138 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:53,138 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:33:53,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-10 23:33:53,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:33:53,339 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:53,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:53,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1763795183, now seen corresponding path program 1 times [2024-10-10 23:33:53,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:53,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806757503] [2024-10-10 23:33:53,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:53,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:53,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:53,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1781 backedges. 1259 proven. 155 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2024-10-10 23:33:53,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:53,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806757503] [2024-10-10 23:33:53,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806757503] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:33:53,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038771222] [2024-10-10 23:33:53,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:53,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:33:53,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:33:53,870 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:33:53,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-10 23:33:54,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:54,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 959 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:33:54,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:33:54,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1781 backedges. 317 proven. 0 refuted. 0 times theorem prover too weak. 1464 trivial. 0 not checked. [2024-10-10 23:33:54,233 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:33:54,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038771222] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:54,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:33:54,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-10 23:33:54,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922351996] [2024-10-10 23:33:54,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:54,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:33:54,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:54,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:33:54,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:33:54,236 INFO L87 Difference]: Start difference. First operand 3029 states and 3250 transitions. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:54,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:54,697 INFO L93 Difference]: Finished difference Result 6769 states and 7283 transitions. [2024-10-10 23:33:54,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:33:54,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 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 778 [2024-10-10 23:33:54,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:54,706 INFO L225 Difference]: With dead ends: 6769 [2024-10-10 23:33:54,706 INFO L226 Difference]: Without dead ends: 3919 [2024-10-10 23:33:54,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 781 GetRequests, 778 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:33:54,710 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 126 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:54,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 233 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:33:54,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3919 states. [2024-10-10 23:33:54,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3919 to 3563. [2024-10-10 23:33:54,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3563 states, 3562 states have (on average 1.0673778775968557) internal successors, (3802), 3562 states have internal predecessors, (3802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:54,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3563 states to 3563 states and 3802 transitions. [2024-10-10 23:33:54,759 INFO L78 Accepts]: Start accepts. Automaton has 3563 states and 3802 transitions. Word has length 778 [2024-10-10 23:33:54,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:54,759 INFO L471 AbstractCegarLoop]: Abstraction has 3563 states and 3802 transitions. [2024-10-10 23:33:54,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:54,760 INFO L276 IsEmpty]: Start isEmpty. Operand 3563 states and 3802 transitions. [2024-10-10 23:33:54,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 791 [2024-10-10 23:33:54,766 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:54,766 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:33:54,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-10 23:33:54,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-10 23:33:54,967 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:54,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:54,968 INFO L85 PathProgramCache]: Analyzing trace with hash -2079387729, now seen corresponding path program 1 times [2024-10-10 23:33:54,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:54,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273004467] [2024-10-10 23:33:54,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:54,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:55,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:55,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1841 backedges. 1319 proven. 155 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2024-10-10 23:33:55,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:55,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273004467] [2024-10-10 23:33:55,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273004467] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:33:55,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605430135] [2024-10-10 23:33:55,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:55,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:33:55,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:33:55,486 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:33:55,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-10 23:33:55,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:55,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 972 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:33:55,701 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:33:55,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1841 backedges. 317 proven. 0 refuted. 0 times theorem prover too weak. 1524 trivial. 0 not checked. [2024-10-10 23:33:55,785 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:33:55,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605430135] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:55,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:33:55,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-10 23:33:55,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717484217] [2024-10-10 23:33:55,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:55,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:33:55,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:55,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:33:55,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:33:55,788 INFO L87 Difference]: Start difference. First operand 3563 states and 3802 transitions. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:56,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:56,182 INFO L93 Difference]: Finished difference Result 4099 states and 4357 transitions. [2024-10-10 23:33:56,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:33:56,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 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 790 [2024-10-10 23:33:56,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:56,196 INFO L225 Difference]: With dead ends: 4099 [2024-10-10 23:33:56,196 INFO L226 Difference]: Without dead ends: 4097 [2024-10-10 23:33:56,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 793 GetRequests, 790 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:33:56,198 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 146 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:56,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 14 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:33:56,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4097 states. [2024-10-10 23:33:56,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4097 to 3385. [2024-10-10 23:33:56,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3385 states, 3384 states have (on average 1.0638297872340425) internal successors, (3600), 3384 states have internal predecessors, (3600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:56,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3385 states to 3385 states and 3600 transitions. [2024-10-10 23:33:56,247 INFO L78 Accepts]: Start accepts. Automaton has 3385 states and 3600 transitions. Word has length 790 [2024-10-10 23:33:56,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:56,248 INFO L471 AbstractCegarLoop]: Abstraction has 3385 states and 3600 transitions. [2024-10-10 23:33:56,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:56,249 INFO L276 IsEmpty]: Start isEmpty. Operand 3385 states and 3600 transitions. [2024-10-10 23:33:56,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 799 [2024-10-10 23:33:56,255 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:56,256 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:33:56,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-10 23:33:56,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-10 23:33:56,457 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:56,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:56,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1930455747, now seen corresponding path program 1 times [2024-10-10 23:33:56,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:56,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784249165] [2024-10-10 23:33:56,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:56,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:56,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:56,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1881 backedges. 1359 proven. 155 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2024-10-10 23:33:56,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:56,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784249165] [2024-10-10 23:33:56,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784249165] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:33:56,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195088598] [2024-10-10 23:33:56,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:56,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:33:56,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:33:56,964 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:33:56,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-10 23:33:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:57,189 INFO L255 TraceCheckSpWp]: Trace formula consists of 979 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:33:57,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:33:57,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1881 backedges. 317 proven. 0 refuted. 0 times theorem prover too weak. 1564 trivial. 0 not checked. [2024-10-10 23:33:57,274 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:33:57,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195088598] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:57,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:33:57,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-10 23:33:57,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445262991] [2024-10-10 23:33:57,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:57,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:33:57,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:57,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:33:57,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:33:57,277 INFO L87 Difference]: Start difference. First operand 3385 states and 3600 transitions. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:57,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:57,685 INFO L93 Difference]: Finished difference Result 7837 states and 8419 transitions. [2024-10-10 23:33:57,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:33:57,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 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 798 [2024-10-10 23:33:57,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:57,693 INFO L225 Difference]: With dead ends: 7837 [2024-10-10 23:33:57,694 INFO L226 Difference]: Without dead ends: 4631 [2024-10-10 23:33:57,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 801 GetRequests, 798 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:33:57,698 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 126 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:57,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 28 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:33:57,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4631 states. [2024-10-10 23:33:57,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4631 to 4275. [2024-10-10 23:33:57,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4275 states, 4274 states have (on average 1.0737014506317266) internal successors, (4589), 4274 states have internal predecessors, (4589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:57,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4275 states to 4275 states and 4589 transitions. [2024-10-10 23:33:57,748 INFO L78 Accepts]: Start accepts. Automaton has 4275 states and 4589 transitions. Word has length 798 [2024-10-10 23:33:57,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:57,749 INFO L471 AbstractCegarLoop]: Abstraction has 4275 states and 4589 transitions. [2024-10-10 23:33:57,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:57,749 INFO L276 IsEmpty]: Start isEmpty. Operand 4275 states and 4589 transitions. [2024-10-10 23:33:57,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 847 [2024-10-10 23:33:57,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:57,758 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:33:57,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-10 23:33:57,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-10 23:33:57,959 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:57,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:57,959 INFO L85 PathProgramCache]: Analyzing trace with hash -441397957, now seen corresponding path program 1 times [2024-10-10 23:33:57,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:57,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193197470] [2024-10-10 23:33:57,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:57,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:58,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:58,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2031 backedges. 1509 proven. 155 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2024-10-10 23:33:58,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:58,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193197470] [2024-10-10 23:33:58,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193197470] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:33:58,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485622376] [2024-10-10 23:33:58,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:58,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:33:58,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:33:58,536 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:33:58,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-10 23:33:58,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:58,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 1027 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 23:33:58,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:33:59,072 INFO L134 CoverageAnalysis]: Checked inductivity of 2031 backedges. 1509 proven. 155 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2024-10-10 23:33:59,072 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:33:59,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2031 backedges. 1509 proven. 155 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2024-10-10 23:33:59,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485622376] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 23:33:59,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 23:33:59,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-10-10 23:33:59,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735134196] [2024-10-10 23:33:59,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 23:33:59,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-10 23:33:59,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:59,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-10 23:33:59,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:33:59,416 INFO L87 Difference]: Start difference. First operand 4275 states and 4589 transitions. Second operand has 6 states, 6 states have (on average 152.83333333333334) internal successors, (917), 6 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:34:00,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:34:00,290 INFO L93 Difference]: Finished difference Result 10151 states and 10869 transitions. [2024-10-10 23:34:00,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-10 23:34:00,291 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 152.83333333333334) internal successors, (917), 6 states have internal predecessors, (917), 0 states have call successors, (0), 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 846 [2024-10-10 23:34:00,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:34:00,299 INFO L225 Difference]: With dead ends: 10151 [2024-10-10 23:34:00,299 INFO L226 Difference]: Without dead ends: 6055 [2024-10-10 23:34:00,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1694 GetRequests, 1690 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:34:00,305 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 45 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 1255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:34:00,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 63 Invalid, 1255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 23:34:00,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6055 states. [2024-10-10 23:34:00,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6055 to 4987. [2024-10-10 23:34:00,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4987 states, 4986 states have (on average 1.069193742478941) internal successors, (5331), 4986 states have internal predecessors, (5331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:34:00,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4987 states to 4987 states and 5331 transitions. [2024-10-10 23:34:00,370 INFO L78 Accepts]: Start accepts. Automaton has 4987 states and 5331 transitions. Word has length 846 [2024-10-10 23:34:00,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:34:00,371 INFO L471 AbstractCegarLoop]: Abstraction has 4987 states and 5331 transitions. [2024-10-10 23:34:00,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 152.83333333333334) internal successors, (917), 6 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:34:00,371 INFO L276 IsEmpty]: Start isEmpty. Operand 4987 states and 5331 transitions. [2024-10-10 23:34:00,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 937 [2024-10-10 23:34:00,381 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:34:00,382 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:34:00,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-10 23:34:00,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:34:00,583 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:34:00,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:34:00,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1571230319, now seen corresponding path program 1 times [2024-10-10 23:34:00,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:34:00,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686966958] [2024-10-10 23:34:00,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:34:00,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:34:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:34:01,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2533 backedges. 1685 proven. 93 refuted. 0 times theorem prover too weak. 755 trivial. 0 not checked. [2024-10-10 23:34:01,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:34:01,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686966958] [2024-10-10 23:34:01,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686966958] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:34:01,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016332270] [2024-10-10 23:34:01,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:34:01,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:34:01,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:34:01,285 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:34:01,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-10 23:34:01,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:34:01,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 1137 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 23:34:01,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:34:01,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2533 backedges. 1778 proven. 0 refuted. 0 times theorem prover too weak. 755 trivial. 0 not checked. [2024-10-10 23:34:01,984 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:34:01,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016332270] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:34:01,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:34:01,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-10 23:34:01,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027857016] [2024-10-10 23:34:01,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:34:01,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:34:01,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:34:01,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:34:01,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:34:01,987 INFO L87 Difference]: Start difference. First operand 4987 states and 5331 transitions. Second operand has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:34:02,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:34:02,368 INFO L93 Difference]: Finished difference Result 10151 states and 10847 transitions. [2024-10-10 23:34:02,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:34:02,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 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 936 [2024-10-10 23:34:02,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:34:02,381 INFO L225 Difference]: With dead ends: 10151 [2024-10-10 23:34:02,381 INFO L226 Difference]: Without dead ends: 5343 [2024-10-10 23:34:02,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 939 GetRequests, 935 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:34:02,386 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:34:02,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 57 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:34:02,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5343 states. [2024-10-10 23:34:02,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5343 to 4987. [2024-10-10 23:34:02,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4987 states, 4986 states have (on average 1.0689931809065383) internal successors, (5330), 4986 states have internal predecessors, (5330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:34:02,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4987 states to 4987 states and 5330 transitions. [2024-10-10 23:34:02,451 INFO L78 Accepts]: Start accepts. Automaton has 4987 states and 5330 transitions. Word has length 936 [2024-10-10 23:34:02,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:34:02,452 INFO L471 AbstractCegarLoop]: Abstraction has 4987 states and 5330 transitions. [2024-10-10 23:34:02,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:34:02,452 INFO L276 IsEmpty]: Start isEmpty. Operand 4987 states and 5330 transitions. [2024-10-10 23:34:02,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 938 [2024-10-10 23:34:02,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:34:02,463 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:34:02,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-10 23:34:02,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-10 23:34:02,665 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:34:02,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:34:02,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1660820516, now seen corresponding path program 1 times [2024-10-10 23:34:02,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:34:02,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277096229] [2024-10-10 23:34:02,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:34:02,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:34:02,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:34:03,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2726 backedges. 1875 proven. 0 refuted. 0 times theorem prover too weak. 851 trivial. 0 not checked. [2024-10-10 23:34:03,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:34:03,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277096229] [2024-10-10 23:34:03,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277096229] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:34:03,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:34:03,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:34:03,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769466549] [2024-10-10 23:34:03,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:34:03,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:34:03,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:34:03,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:34:03,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:34:03,514 INFO L87 Difference]: Start difference. First operand 4987 states and 5330 transitions. Second operand has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:34:03,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:34:03,869 INFO L93 Difference]: Finished difference Result 9617 states and 10300 transitions. [2024-10-10 23:34:03,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:34:03,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 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 937 [2024-10-10 23:34:03,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:34:03,878 INFO L225 Difference]: With dead ends: 9617 [2024-10-10 23:34:03,878 INFO L226 Difference]: Without dead ends: 4809 [2024-10-10 23:34:03,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:34:03,883 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 21 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:34:03,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 220 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 23:34:03,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4809 states. [2024-10-10 23:34:03,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4809 to 4809. [2024-10-10 23:34:03,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4809 states, 4808 states have (on average 1.059900166389351) internal successors, (5096), 4808 states have internal predecessors, (5096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:34:03,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4809 states to 4809 states and 5096 transitions. [2024-10-10 23:34:03,933 INFO L78 Accepts]: Start accepts. Automaton has 4809 states and 5096 transitions. Word has length 937 [2024-10-10 23:34:03,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:34:03,934 INFO L471 AbstractCegarLoop]: Abstraction has 4809 states and 5096 transitions. [2024-10-10 23:34:03,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:34:03,934 INFO L276 IsEmpty]: Start isEmpty. Operand 4809 states and 5096 transitions. [2024-10-10 23:34:03,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1033 [2024-10-10 23:34:03,944 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:34:03,945 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:34:03,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-10 23:34:03,945 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:34:03,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:34:03,946 INFO L85 PathProgramCache]: Analyzing trace with hash 274751496, now seen corresponding path program 1 times [2024-10-10 23:34:03,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:34:03,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385303113] [2024-10-10 23:34:03,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:34:03,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:34:04,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:34:04,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3320 backedges. 2162 proven. 0 refuted. 0 times theorem prover too weak. 1158 trivial. 0 not checked. [2024-10-10 23:34:04,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:34:04,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385303113] [2024-10-10 23:34:04,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385303113] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:34:04,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:34:04,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:34:04,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064737275] [2024-10-10 23:34:04,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:34:04,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:34:04,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:34:04,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:34:04,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:34:04,821 INFO L87 Difference]: Start difference. First operand 4809 states and 5096 transitions. Second operand has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:34:05,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:34:05,184 INFO L93 Difference]: Finished difference Result 9439 states and 10012 transitions. [2024-10-10 23:34:05,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:34:05,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 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 1032 [2024-10-10 23:34:05,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:34:05,191 INFO L225 Difference]: With dead ends: 9439 [2024-10-10 23:34:05,192 INFO L226 Difference]: Without dead ends: 4809 [2024-10-10 23:34:05,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:34:05,197 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 25 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:34:05,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 218 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 23:34:05,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4809 states. [2024-10-10 23:34:05,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4809 to 4809. [2024-10-10 23:34:05,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4809 states, 4808 states have (on average 1.0515806988352745) internal successors, (5056), 4808 states have internal predecessors, (5056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:34:05,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4809 states to 4809 states and 5056 transitions. [2024-10-10 23:34:05,247 INFO L78 Accepts]: Start accepts. Automaton has 4809 states and 5056 transitions. Word has length 1032 [2024-10-10 23:34:05,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:34:05,247 INFO L471 AbstractCegarLoop]: Abstraction has 4809 states and 5056 transitions. [2024-10-10 23:34:05,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:34:05,248 INFO L276 IsEmpty]: Start isEmpty. Operand 4809 states and 5056 transitions. [2024-10-10 23:34:05,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1057 [2024-10-10 23:34:05,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:34:05,259 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:34:05,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-10 23:34:05,260 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:34:05,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:34:05,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1978285489, now seen corresponding path program 1 times [2024-10-10 23:34:05,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:34:05,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301474836] [2024-10-10 23:34:05,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:34:05,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:34:05,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:34:05,965 INFO L134 CoverageAnalysis]: Checked inductivity of 3869 backedges. 1873 proven. 0 refuted. 0 times theorem prover too weak. 1996 trivial. 0 not checked. [2024-10-10 23:34:05,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:34:05,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301474836] [2024-10-10 23:34:05,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301474836] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:34:05,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:34:05,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-10 23:34:05,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102706036] [2024-10-10 23:34:05,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:34:05,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-10 23:34:05,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:34:05,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-10 23:34:05,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:34:05,968 INFO L87 Difference]: Start difference. First operand 4809 states and 5056 transitions. Second operand has 7 states, 7 states have (on average 53.0) internal successors, (371), 6 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:34:06,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:34:06,522 INFO L93 Difference]: Finished difference Result 9667 states and 10165 transitions. [2024-10-10 23:34:06,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 23:34:06,522 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 53.0) internal successors, (371), 6 states have internal predecessors, (371), 0 states have call successors, (0), 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 1056 [2024-10-10 23:34:06,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:34:06,530 INFO L225 Difference]: With dead ends: 9667 [2024-10-10 23:34:06,530 INFO L226 Difference]: Without dead ends: 4987 [2024-10-10 23:34:06,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:34:06,536 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 47 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:34:06,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 21 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 941 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:34:06,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4987 states. [2024-10-10 23:34:06,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4987 to 4809. [2024-10-10 23:34:06,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4809 states, 4808 states have (on average 1.0428452579034941) internal successors, (5014), 4808 states have internal predecessors, (5014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:34:06,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4809 states to 4809 states and 5014 transitions. [2024-10-10 23:34:06,585 INFO L78 Accepts]: Start accepts. Automaton has 4809 states and 5014 transitions. Word has length 1056 [2024-10-10 23:34:06,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:34:06,586 INFO L471 AbstractCegarLoop]: Abstraction has 4809 states and 5014 transitions. [2024-10-10 23:34:06,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 53.0) internal successors, (371), 6 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:34:06,586 INFO L276 IsEmpty]: Start isEmpty. Operand 4809 states and 5014 transitions. [2024-10-10 23:34:06,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1089 [2024-10-10 23:34:06,598 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:34:06,600 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:34:06,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-10 23:34:06,601 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:34:06,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:34:06,601 INFO L85 PathProgramCache]: Analyzing trace with hash -881594210, now seen corresponding path program 1 times [2024-10-10 23:34:06,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:34:06,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740478665] [2024-10-10 23:34:06,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:34:06,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:34:06,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:34:07,518 INFO L134 CoverageAnalysis]: Checked inductivity of 3768 backedges. 1299 proven. 0 refuted. 0 times theorem prover too weak. 2469 trivial. 0 not checked. [2024-10-10 23:34:07,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:34:07,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740478665] [2024-10-10 23:34:07,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740478665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:34:07,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:34:07,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:34:07,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025382556] [2024-10-10 23:34:07,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:34:07,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:34:07,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:34:07,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:34:07,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:34:07,523 INFO L87 Difference]: Start difference. First operand 4809 states and 5014 transitions. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:34:07,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:34:07,966 INFO L93 Difference]: Finished difference Result 9437 states and 9847 transitions. [2024-10-10 23:34:07,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:34:07,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 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 1088 [2024-10-10 23:34:07,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:34:07,971 INFO L225 Difference]: With dead ends: 9437 [2024-10-10 23:34:07,971 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 23:34:07,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:34:07,977 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 43 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:34:07,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 223 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:34:07,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 23:34:07,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 23:34:07,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:34:07,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 23:34:07,978 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1088 [2024-10-10 23:34:07,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:34:07,978 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 23:34:07,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:34:07,979 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 23:34:07,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 23:34:07,986 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 23:34:07,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-10 23:34:07,990 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:34:07,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 23:34:08,901 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 23:34:08,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 11:34:08 BoogieIcfgContainer [2024-10-10 23:34:08,926 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 23:34:08,927 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 23:34:08,927 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 23:34:08,927 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 23:34:08,928 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:33:37" (3/4) ... [2024-10-10 23:34:08,929 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 23:34:08,947 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-10 23:34:08,948 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 23:34:08,949 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 23:34:08,950 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 23:34:09,116 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 23:34:09,116 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 23:34:09,116 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 23:34:09,117 INFO L158 Benchmark]: Toolchain (without parser) took 33639.13ms. Allocated memory was 151.0MB in the beginning and 968.9MB in the end (delta: 817.9MB). Free memory was 91.3MB in the beginning and 370.0MB in the end (delta: -278.7MB). Peak memory consumption was 538.8MB. Max. memory is 16.1GB. [2024-10-10 23:34:09,117 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory is still 50.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 23:34:09,117 INFO L158 Benchmark]: CACSL2BoogieTranslator took 685.14ms. Allocated memory is still 151.0MB. Free memory was 91.3MB in the beginning and 96.3MB in the end (delta: -5.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-10 23:34:09,118 INFO L158 Benchmark]: Boogie Procedure Inliner took 106.99ms. Allocated memory is still 151.0MB. Free memory was 96.3MB in the beginning and 86.6MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-10 23:34:09,118 INFO L158 Benchmark]: Boogie Preprocessor took 130.22ms. Allocated memory is still 151.0MB. Free memory was 86.6MB in the beginning and 74.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-10 23:34:09,118 INFO L158 Benchmark]: RCFGBuilder took 1540.48ms. Allocated memory was 151.0MB in the beginning and 195.0MB in the end (delta: 44.0MB). Free memory was 74.0MB in the beginning and 144.6MB in the end (delta: -70.6MB). Peak memory consumption was 54.9MB. Max. memory is 16.1GB. [2024-10-10 23:34:09,119 INFO L158 Benchmark]: TraceAbstraction took 30979.74ms. Allocated memory was 195.0MB in the beginning and 968.9MB in the end (delta: 773.8MB). Free memory was 143.5MB in the beginning and 384.7MB in the end (delta: -241.2MB). Peak memory consumption was 533.7MB. Max. memory is 16.1GB. [2024-10-10 23:34:09,119 INFO L158 Benchmark]: Witness Printer took 189.47ms. Allocated memory is still 968.9MB. Free memory was 384.7MB in the beginning and 370.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-10 23:34:09,120 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory is still 50.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 685.14ms. Allocated memory is still 151.0MB. Free memory was 91.3MB in the beginning and 96.3MB in the end (delta: -5.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 106.99ms. Allocated memory is still 151.0MB. Free memory was 96.3MB in the beginning and 86.6MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 130.22ms. Allocated memory is still 151.0MB. Free memory was 86.6MB in the beginning and 74.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1540.48ms. Allocated memory was 151.0MB in the beginning and 195.0MB in the end (delta: 44.0MB). Free memory was 74.0MB in the beginning and 144.6MB in the end (delta: -70.6MB). Peak memory consumption was 54.9MB. Max. memory is 16.1GB. * TraceAbstraction took 30979.74ms. Allocated memory was 195.0MB in the beginning and 968.9MB in the end (delta: 773.8MB). Free memory was 143.5MB in the beginning and 384.7MB in the end (delta: -241.2MB). Peak memory consumption was 533.7MB. Max. memory is 16.1GB. * Witness Printer took 189.47ms. Allocated memory is still 968.9MB. Free memory was 384.7MB in the beginning and 370.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 179]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 183 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.0s, OverallIterations: 22, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 12.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2224 SdHoareTripleChecker+Valid, 11.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2224 mSDsluCounter, 2807 SdHoareTripleChecker+Invalid, 9.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 115 mSDsCounter, 1066 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11340 IncrementalHoareTripleChecker+Invalid, 12406 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1066 mSolverCounterUnsat, 2692 mSDtfsCounter, 11340 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6562 GetRequests, 6512 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4987occurred in iteration=17, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 22 MinimizatonAttempts, 5340 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 11.5s InterpolantComputationTime, 17932 NumberOfCodeBlocks, 17932 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 18747 ConstructedInterpolants, 0 QuantifiedInterpolants, 43980 SizeOfPredicates, 0 NumberOfNonLiveVariables, 7004 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 31 InterpolantComputations, 21 PerfectInterpolantSequences, 43946/45248 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 890]: Loop Invariant Derived loop invariant: (((((((((7 <= a15) && (a24 == 1)) || ((((long long) 49 + a12) <= 0) && (a15 <= 5))) || (((a24 == 1) && (a21 == 9)) && (81 <= a12))) || (((a12 <= 11) && (a24 == 1)) && (a21 == 9))) || ((((a12 <= 11) && (a24 == 1)) && (a15 <= 8)) && (0 <= ((long long) a12 + 42)))) || ((a24 == 1) && (a15 <= 5))) || (((a24 == 1) && (a21 <= 6)) && (0 <= ((long long) a12 + 42)))) || ((((a21 == 8) && (a24 == 1)) && (a15 <= 8)) && (0 <= ((long long) a12 + 42)))) RESULT: Ultimate proved your program to be correct! [2024-10-10 23:34:09,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE