./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/Problem15_label36.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/Problem15_label36.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 f8c7f180e45ffba5eb47ee4dc238e0b48ee8dddec8c88fb0da95366e7d605cc2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:37:48,937 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:37:48,998 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:37:49,002 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:37:49,005 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:37:49,035 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:37:49,036 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:37:49,037 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:37:49,037 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:37:49,039 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:37:49,039 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:37:49,039 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:37:49,040 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:37:49,040 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:37:49,040 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:37:49,041 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:37:49,041 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:37:49,041 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:37:49,041 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:37:49,042 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:37:49,042 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:37:49,046 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:37:49,047 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:37:49,047 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:37:49,047 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:37:49,047 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:37:49,050 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:37:49,050 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:37:49,051 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:37:49,051 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:37:49,051 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:37:49,051 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:37:49,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:37:49,052 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:37:49,052 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:37:49,052 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:37:49,052 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:37:49,053 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:37:49,053 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:37:49,053 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:37:49,053 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:37:49,054 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:37:49,054 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 -> f8c7f180e45ffba5eb47ee4dc238e0b48ee8dddec8c88fb0da95366e7d605cc2 [2024-10-10 23:37:49,350 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:37:49,376 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:37:49,379 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:37:49,381 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:37:49,381 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:37:49,382 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label36.c [2024-10-10 23:37:50,754 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:37:51,119 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:37:51,121 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label36.c [2024-10-10 23:37:51,148 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f09586b86/5f6fe218406346a492edbfdb27e10dc9/FLAGcef2a87d4 [2024-10-10 23:37:51,165 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f09586b86/5f6fe218406346a492edbfdb27e10dc9 [2024-10-10 23:37:51,167 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:37:51,169 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:37:51,170 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:37:51,170 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:37:51,176 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:37:51,177 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:37:51" (1/1) ... [2024-10-10 23:37:51,179 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d7d4c71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:37:51, skipping insertion in model container [2024-10-10 23:37:51,179 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:37:51" (1/1) ... [2024-10-10 23:37:51,246 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:37:51,495 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/Problem15_label36.c[7434,7447] [2024-10-10 23:37:51,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:37:51,870 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:37:51,902 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/Problem15_label36.c[7434,7447] [2024-10-10 23:37:52,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:37:52,086 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:37:52,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:37:52 WrapperNode [2024-10-10 23:37:52,087 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:37:52,088 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:37:52,089 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:37:52,089 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:37:52,096 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:37:52" (1/1) ... [2024-10-10 23:37:52,136 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:37:52" (1/1) ... [2024-10-10 23:37:52,308 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1760 [2024-10-10 23:37:52,309 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:37:52,310 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:37:52,311 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:37:52,311 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:37:52,321 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:37:52" (1/1) ... [2024-10-10 23:37:52,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:37:52" (1/1) ... [2024-10-10 23:37:52,343 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:37:52" (1/1) ... [2024-10-10 23:37:52,419 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:37:52,420 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:37:52" (1/1) ... [2024-10-10 23:37:52,420 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:37:52" (1/1) ... [2024-10-10 23:37:52,546 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:37:52" (1/1) ... [2024-10-10 23:37:52,573 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:37:52" (1/1) ... [2024-10-10 23:37:52,617 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:37:52" (1/1) ... [2024-10-10 23:37:52,635 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:37:52" (1/1) ... [2024-10-10 23:37:52,655 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:37:52,656 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:37:52,656 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:37:52,656 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:37:52,657 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:37:52" (1/1) ... [2024-10-10 23:37:52,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:37:52,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:37:52,692 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:37:52,695 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:37:52,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:37:52,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:37:52,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:37:52,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:37:52,805 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:37:52,807 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:37:55,134 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2024-10-10 23:37:55,135 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:37:55,187 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:37:55,190 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:37:55,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:37:55 BoogieIcfgContainer [2024-10-10 23:37:55,191 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:37:55,193 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:37:55,193 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:37:55,196 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:37:55,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:37:51" (1/3) ... [2024-10-10 23:37:55,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f40da41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:37:55, skipping insertion in model container [2024-10-10 23:37:55,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:37:52" (2/3) ... [2024-10-10 23:37:55,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f40da41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:37:55, skipping insertion in model container [2024-10-10 23:37:55,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:37:55" (3/3) ... [2024-10-10 23:37:55,198 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label36.c [2024-10-10 23:37:55,218 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:37:55,219 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:37:55,300 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:37:55,306 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;@33acd40c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:37:55,308 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:37:55,314 INFO L276 IsEmpty]: Start isEmpty. Operand has 362 states, 360 states have (on average 1.9111111111111112) internal successors, (688), 361 states have internal predecessors, (688), 0 states have call successors, (0), 0 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:37:55,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-10 23:37:55,322 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:37:55,323 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:37:55,324 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:37:55,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:37:55,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1101773111, now seen corresponding path program 1 times [2024-10-10 23:37:55,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:37:55,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630875288] [2024-10-10 23:37:55,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:37:55,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:37:55,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:37:55,538 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:37:55,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:37:55,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630875288] [2024-10-10 23:37:55,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630875288] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:37:55,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:37:55,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:37:55,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653954183] [2024-10-10 23:37:55,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:37:55,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:37:55,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:37:55,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:37:55,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:37:55,578 INFO L87 Difference]: Start difference. First operand has 362 states, 360 states have (on average 1.9111111111111112) internal successors, (688), 361 states have internal predecessors, (688), 0 states have call successors, (0), 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 30.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 0 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:37:55,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:37:55,646 INFO L93 Difference]: Finished difference Result 723 states and 1375 transitions. [2024-10-10 23:37:55,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:37:55,648 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-10-10 23:37:55,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:37:55,661 INFO L225 Difference]: With dead ends: 723 [2024-10-10 23:37:55,661 INFO L226 Difference]: Without dead ends: 360 [2024-10-10 23:37:55,665 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:37:55,669 INFO L432 NwaCegarLoop]: 623 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, 623 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:37:55,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 623 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:37:55,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-10-10 23:37:55,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2024-10-10 23:37:55,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.7353760445682451) internal successors, (623), 359 states have internal predecessors, (623), 0 states have call successors, (0), 0 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:37:55,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 623 transitions. [2024-10-10 23:37:55,719 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 623 transitions. Word has length 60 [2024-10-10 23:37:55,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:37:55,719 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 623 transitions. [2024-10-10 23:37:55,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 0 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:37:55,720 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 623 transitions. [2024-10-10 23:37:55,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-10 23:37:55,721 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:37:55,721 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:37:55,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:37:55,722 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:37:55,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:37:55,723 INFO L85 PathProgramCache]: Analyzing trace with hash 514980099, now seen corresponding path program 1 times [2024-10-10 23:37:55,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:37:55,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070057162] [2024-10-10 23:37:55,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:37:55,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:37:55,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:37:55,934 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:37:55,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:37:55,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070057162] [2024-10-10 23:37:55,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070057162] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:37:55,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:37:55,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:37:55,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408095980] [2024-10-10 23:37:55,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:37:55,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:37:55,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:37:55,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:37:55,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:37:55,938 INFO L87 Difference]: Start difference. First operand 360 states and 623 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 0 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:37:57,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:37:57,646 INFO L93 Difference]: Finished difference Result 1025 states and 1788 transitions. [2024-10-10 23:37:57,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:37:57,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-10-10 23:37:57,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:37:57,652 INFO L225 Difference]: With dead ends: 1025 [2024-10-10 23:37:57,652 INFO L226 Difference]: Without dead ends: 666 [2024-10-10 23:37:57,653 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:37:57,656 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 267 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:37:57,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 316 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-10 23:37:57,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2024-10-10 23:37:57,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 664. [2024-10-10 23:37:57,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 663 states have (on average 1.4796380090497738) internal successors, (981), 663 states have internal predecessors, (981), 0 states have call successors, (0), 0 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:37:57,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 981 transitions. [2024-10-10 23:37:57,691 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 981 transitions. Word has length 60 [2024-10-10 23:37:57,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:37:57,692 INFO L471 AbstractCegarLoop]: Abstraction has 664 states and 981 transitions. [2024-10-10 23:37:57,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 0 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:37:57,692 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 981 transitions. [2024-10-10 23:37:57,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-10 23:37:57,696 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:37:57,697 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, 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] [2024-10-10 23:37:57,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:37:57,697 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:37:57,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:37:57,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1372562485, now seen corresponding path program 1 times [2024-10-10 23:37:57,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:37:57,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610318782] [2024-10-10 23:37:57,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:37:57,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:37:57,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:37:57,959 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:37:57,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:37:57,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610318782] [2024-10-10 23:37:57,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610318782] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:37:57,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:37:57,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:37:57,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082064714] [2024-10-10 23:37:57,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:37:57,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:37:57,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:37:57,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:37:57,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:37:57,965 INFO L87 Difference]: Start difference. First operand 664 states and 981 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:37:59,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:37:59,485 INFO L93 Difference]: Finished difference Result 1954 states and 2893 transitions. [2024-10-10 23:37:59,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:37:59,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 135 [2024-10-10 23:37:59,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:37:59,491 INFO L225 Difference]: With dead ends: 1954 [2024-10-10 23:37:59,491 INFO L226 Difference]: Without dead ends: 1291 [2024-10-10 23:37:59,493 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:37:59,494 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 258 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:37:59,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 325 Invalid, 1250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-10 23:37:59,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2024-10-10 23:37:59,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1281. [2024-10-10 23:37:59,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1281 states, 1280 states have (on average 1.39921875) internal successors, (1791), 1280 states have internal predecessors, (1791), 0 states have call successors, (0), 0 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:37:59,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1791 transitions. [2024-10-10 23:37:59,535 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1791 transitions. Word has length 135 [2024-10-10 23:37:59,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:37:59,536 INFO L471 AbstractCegarLoop]: Abstraction has 1281 states and 1791 transitions. [2024-10-10 23:37:59,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:37:59,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1791 transitions. [2024-10-10 23:37:59,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-10 23:37:59,539 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:37:59,540 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, 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] [2024-10-10 23:37:59,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:37:59,540 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:37:59,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:37:59,541 INFO L85 PathProgramCache]: Analyzing trace with hash 274354623, now seen corresponding path program 1 times [2024-10-10 23:37:59,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:37:59,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388520863] [2024-10-10 23:37:59,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:37:59,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:37:59,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:37:59,820 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:37:59,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:37:59,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388520863] [2024-10-10 23:37:59,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388520863] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:37:59,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:37:59,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:37:59,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335626964] [2024-10-10 23:37:59,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:37:59,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:37:59,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:37:59,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:37:59,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:37:59,826 INFO L87 Difference]: Start difference. First operand 1281 states and 1791 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 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:38:01,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:38:01,465 INFO L93 Difference]: Finished difference Result 3763 states and 5262 transitions. [2024-10-10 23:38:01,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:38:01,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2024-10-10 23:38:01,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:38:01,475 INFO L225 Difference]: With dead ends: 3763 [2024-10-10 23:38:01,475 INFO L226 Difference]: Without dead ends: 2483 [2024-10-10 23:38:01,478 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:38:01,481 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 236 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 956 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:38:01,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 364 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 956 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-10 23:38:01,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2483 states. [2024-10-10 23:38:01,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2483 to 2181. [2024-10-10 23:38:01,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2181 states, 2180 states have (on average 1.281651376146789) internal successors, (2794), 2180 states have internal predecessors, (2794), 0 states have call successors, (0), 0 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:38:01,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2181 states to 2181 states and 2794 transitions. [2024-10-10 23:38:01,524 INFO L78 Accepts]: Start accepts. Automaton has 2181 states and 2794 transitions. Word has length 139 [2024-10-10 23:38:01,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:38:01,525 INFO L471 AbstractCegarLoop]: Abstraction has 2181 states and 2794 transitions. [2024-10-10 23:38:01,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 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:38:01,525 INFO L276 IsEmpty]: Start isEmpty. Operand 2181 states and 2794 transitions. [2024-10-10 23:38:01,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-10-10 23:38:01,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:38:01,530 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:38:01,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:38:01,533 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:38:01,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:38:01,534 INFO L85 PathProgramCache]: Analyzing trace with hash 531438622, now seen corresponding path program 1 times [2024-10-10 23:38:01,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:38:01,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263133490] [2024-10-10 23:38:01,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:38:01,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:38:01,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:38:01,746 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-10-10 23:38:01,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:38:01,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263133490] [2024-10-10 23:38:01,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263133490] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:38:01,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:38:01,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:38:01,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639054657] [2024-10-10 23:38:01,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:38:01,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:38:01,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:38:01,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:38:01,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:38:01,751 INFO L87 Difference]: Start difference. First operand 2181 states and 2794 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 0 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:38:03,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:38:03,254 INFO L93 Difference]: Finished difference Result 6165 states and 7960 transitions. [2024-10-10 23:38:03,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:38:03,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 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 230 [2024-10-10 23:38:03,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:38:03,267 INFO L225 Difference]: With dead ends: 6165 [2024-10-10 23:38:03,268 INFO L226 Difference]: Without dead ends: 3985 [2024-10-10 23:38:03,272 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:38:03,273 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 257 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:38:03,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 337 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-10 23:38:03,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3985 states. [2024-10-10 23:38:03,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3985 to 3681. [2024-10-10 23:38:03,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3681 states, 3680 states have (on average 1.2201086956521738) internal successors, (4490), 3680 states have internal predecessors, (4490), 0 states have call successors, (0), 0 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:38:03,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3681 states to 3681 states and 4490 transitions. [2024-10-10 23:38:03,368 INFO L78 Accepts]: Start accepts. Automaton has 3681 states and 4490 transitions. Word has length 230 [2024-10-10 23:38:03,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:38:03,370 INFO L471 AbstractCegarLoop]: Abstraction has 3681 states and 4490 transitions. [2024-10-10 23:38:03,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 0 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:38:03,371 INFO L276 IsEmpty]: Start isEmpty. Operand 3681 states and 4490 transitions. [2024-10-10 23:38:03,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2024-10-10 23:38:03,378 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:38:03,378 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, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:03,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:38:03,379 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:38:03,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:38:03,381 INFO L85 PathProgramCache]: Analyzing trace with hash -2138969610, now seen corresponding path program 1 times [2024-10-10 23:38:03,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:38:03,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786940574] [2024-10-10 23:38:03,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:38:03,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:38:03,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:38:04,092 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-10-10 23:38:04,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:38:04,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786940574] [2024-10-10 23:38:04,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786940574] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:38:04,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:38:04,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:38:04,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660011019] [2024-10-10 23:38:04,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:38:04,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:38:04,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:38:04,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:38:04,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:38:04,095 INFO L87 Difference]: Start difference. First operand 3681 states and 4490 transitions. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 0 states have call successors, (0), 0 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:38:05,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:38:05,381 INFO L93 Difference]: Finished difference Result 7660 states and 9290 transitions. [2024-10-10 23:38:05,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:38:05,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 0 states have call successors, (0), 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 332 [2024-10-10 23:38:05,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:38:05,395 INFO L225 Difference]: With dead ends: 7660 [2024-10-10 23:38:05,396 INFO L226 Difference]: Without dead ends: 3980 [2024-10-10 23:38:05,401 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:38:05,404 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:38:05,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 357 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 23:38:05,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3980 states. [2024-10-10 23:38:05,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3980 to 3980. [2024-10-10 23:38:05,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3980 states, 3979 states have (on average 1.2050766524252325) internal successors, (4795), 3979 states have internal predecessors, (4795), 0 states have call successors, (0), 0 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:38:05,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3980 states to 3980 states and 4795 transitions. [2024-10-10 23:38:05,471 INFO L78 Accepts]: Start accepts. Automaton has 3980 states and 4795 transitions. Word has length 332 [2024-10-10 23:38:05,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:38:05,472 INFO L471 AbstractCegarLoop]: Abstraction has 3980 states and 4795 transitions. [2024-10-10 23:38:05,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 0 states have call successors, (0), 0 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:38:05,474 INFO L276 IsEmpty]: Start isEmpty. Operand 3980 states and 4795 transitions. [2024-10-10 23:38:05,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2024-10-10 23:38:05,479 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:38:05,479 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:05,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:38:05,479 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:38:05,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:38:05,480 INFO L85 PathProgramCache]: Analyzing trace with hash 187973811, now seen corresponding path program 1 times [2024-10-10 23:38:05,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:38:05,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401821925] [2024-10-10 23:38:05,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:38:05,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:38:05,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:38:05,871 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-10 23:38:05,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:38:05,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401821925] [2024-10-10 23:38:05,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401821925] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:38:05,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:38:05,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:38:05,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909958241] [2024-10-10 23:38:05,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:38:05,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:38:05,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:38:05,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:38:05,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:38:05,874 INFO L87 Difference]: Start difference. First operand 3980 states and 4795 transitions. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 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:38:07,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:38:07,486 INFO L93 Difference]: Finished difference Result 9464 states and 11673 transitions. [2024-10-10 23:38:07,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:38:07,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 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 347 [2024-10-10 23:38:07,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:38:07,506 INFO L225 Difference]: With dead ends: 9464 [2024-10-10 23:38:07,506 INFO L226 Difference]: Without dead ends: 5784 [2024-10-10 23:38:07,510 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:38:07,512 INFO L432 NwaCegarLoop]: 630 mSDtfsCounter, 255 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:38:07,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 668 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-10 23:38:07,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5784 states. [2024-10-10 23:38:07,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5784 to 5782. [2024-10-10 23:38:07,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5782 states, 5781 states have (on average 1.167618059159315) internal successors, (6750), 5781 states have internal predecessors, (6750), 0 states have call successors, (0), 0 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:38:07,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5782 states to 5782 states and 6750 transitions. [2024-10-10 23:38:07,597 INFO L78 Accepts]: Start accepts. Automaton has 5782 states and 6750 transitions. Word has length 347 [2024-10-10 23:38:07,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:38:07,598 INFO L471 AbstractCegarLoop]: Abstraction has 5782 states and 6750 transitions. [2024-10-10 23:38:07,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 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:38:07,598 INFO L276 IsEmpty]: Start isEmpty. Operand 5782 states and 6750 transitions. [2024-10-10 23:38:07,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2024-10-10 23:38:07,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:38:07,605 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, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:07,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:38:07,606 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:38:07,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:38:07,606 INFO L85 PathProgramCache]: Analyzing trace with hash -964217180, now seen corresponding path program 1 times [2024-10-10 23:38:07,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:38:07,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920600689] [2024-10-10 23:38:07,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:38:07,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:38:07,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:38:08,007 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-10 23:38:08,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:38:08,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920600689] [2024-10-10 23:38:08,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920600689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:38:08,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:38:08,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:38:08,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300730121] [2024-10-10 23:38:08,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:38:08,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:38:08,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:38:08,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:38:08,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:38:08,011 INFO L87 Difference]: Start difference. First operand 5782 states and 6750 transitions. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 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:38:09,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:38:09,594 INFO L93 Difference]: Finished difference Result 13363 states and 15909 transitions. [2024-10-10 23:38:09,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:38:09,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 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 406 [2024-10-10 23:38:09,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:38:09,622 INFO L225 Difference]: With dead ends: 13363 [2024-10-10 23:38:09,623 INFO L226 Difference]: Without dead ends: 7881 [2024-10-10 23:38:09,631 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:38:09,632 INFO L432 NwaCegarLoop]: 596 mSDtfsCounter, 266 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:38:09,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 632 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-10 23:38:09,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7881 states. [2024-10-10 23:38:09,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7881 to 7283. [2024-10-10 23:38:09,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7283 states, 7282 states have (on average 1.148722878330129) internal successors, (8365), 7282 states have internal predecessors, (8365), 0 states have call successors, (0), 0 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:38:09,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7283 states to 7283 states and 8365 transitions. [2024-10-10 23:38:09,738 INFO L78 Accepts]: Start accepts. Automaton has 7283 states and 8365 transitions. Word has length 406 [2024-10-10 23:38:09,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:38:09,738 INFO L471 AbstractCegarLoop]: Abstraction has 7283 states and 8365 transitions. [2024-10-10 23:38:09,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 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:38:09,739 INFO L276 IsEmpty]: Start isEmpty. Operand 7283 states and 8365 transitions. [2024-10-10 23:38:09,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2024-10-10 23:38:09,746 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:38:09,746 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:09,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:38:09,747 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:38:09,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:38:09,747 INFO L85 PathProgramCache]: Analyzing trace with hash 335904033, now seen corresponding path program 1 times [2024-10-10 23:38:09,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:38:09,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713930395] [2024-10-10 23:38:09,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:38:09,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:38:09,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:38:10,113 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-10 23:38:10,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:38:10,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713930395] [2024-10-10 23:38:10,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713930395] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:38:10,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:38:10,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:38:10,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142922893] [2024-10-10 23:38:10,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:38:10,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:38:10,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:38:10,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:38:10,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:38:10,116 INFO L87 Difference]: Start difference. First operand 7283 states and 8365 transitions. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 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:38:11,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:38:11,651 INFO L93 Difference]: Finished difference Result 16068 states and 18813 transitions. [2024-10-10 23:38:11,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:38:11,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 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 421 [2024-10-10 23:38:11,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:38:11,675 INFO L225 Difference]: With dead ends: 16068 [2024-10-10 23:38:11,676 INFO L226 Difference]: Without dead ends: 9085 [2024-10-10 23:38:11,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:38:11,686 INFO L432 NwaCegarLoop]: 583 mSDtfsCounter, 268 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 920 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:38:11,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 620 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 920 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-10 23:38:11,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9085 states. [2024-10-10 23:38:11,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9085 to 8480. [2024-10-10 23:38:11,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8480 states, 8479 states have (on average 1.1379879702795141) internal successors, (9649), 8479 states have internal predecessors, (9649), 0 states have call successors, (0), 0 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:38:11,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8480 states to 8480 states and 9649 transitions. [2024-10-10 23:38:11,855 INFO L78 Accepts]: Start accepts. Automaton has 8480 states and 9649 transitions. Word has length 421 [2024-10-10 23:38:11,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:38:11,856 INFO L471 AbstractCegarLoop]: Abstraction has 8480 states and 9649 transitions. [2024-10-10 23:38:11,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 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:38:11,857 INFO L276 IsEmpty]: Start isEmpty. Operand 8480 states and 9649 transitions. [2024-10-10 23:38:11,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2024-10-10 23:38:11,866 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:38:11,868 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, 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, 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, 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] [2024-10-10 23:38:11,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:38:11,868 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:38:11,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:38:11,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1399604565, now seen corresponding path program 1 times [2024-10-10 23:38:11,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:38:11,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433924474] [2024-10-10 23:38:11,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:38:11,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:38:11,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:38:12,233 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 371 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2024-10-10 23:38:12,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:38:12,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433924474] [2024-10-10 23:38:12,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433924474] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:38:12,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:38:12,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:38:12,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826813640] [2024-10-10 23:38:12,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:38:12,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:38:12,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:38:12,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:38:12,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:38:12,237 INFO L87 Difference]: Start difference. First operand 8480 states and 9649 transitions. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 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:38:13,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:38:13,512 INFO L93 Difference]: Finished difference Result 19650 states and 22542 transitions. [2024-10-10 23:38:13,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:38:13,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 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 511 [2024-10-10 23:38:13,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:38:13,535 INFO L225 Difference]: With dead ends: 19650 [2024-10-10 23:38:13,536 INFO L226 Difference]: Without dead ends: 11470 [2024-10-10 23:38:13,545 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:38:13,546 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 147 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:38:13,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 313 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 23:38:13,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11470 states. [2024-10-10 23:38:13,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11470 to 7577. [2024-10-10 23:38:13,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7577 states, 7576 states have (on average 1.1486272439281944) internal successors, (8702), 7576 states have internal predecessors, (8702), 0 states have call successors, (0), 0 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:38:13,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7577 states to 7577 states and 8702 transitions. [2024-10-10 23:38:13,664 INFO L78 Accepts]: Start accepts. Automaton has 7577 states and 8702 transitions. Word has length 511 [2024-10-10 23:38:13,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:38:13,665 INFO L471 AbstractCegarLoop]: Abstraction has 7577 states and 8702 transitions. [2024-10-10 23:38:13,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 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:38:13,666 INFO L276 IsEmpty]: Start isEmpty. Operand 7577 states and 8702 transitions. [2024-10-10 23:38:13,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 545 [2024-10-10 23:38:13,671 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:38:13,671 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:13,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:38:13,672 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:38:13,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:38:13,673 INFO L85 PathProgramCache]: Analyzing trace with hash -172023300, now seen corresponding path program 1 times [2024-10-10 23:38:13,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:38:13,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055890019] [2024-10-10 23:38:13,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:38:13,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:38:13,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:38:14,439 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 527 proven. 39 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2024-10-10 23:38:14,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:38:14,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055890019] [2024-10-10 23:38:14,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055890019] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:38:14,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585778434] [2024-10-10 23:38:14,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:38:14,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:38:14,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:38:14,443 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:38:14,444 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:38:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:38:14,652 INFO L255 TraceCheckSpWp]: Trace formula consists of 676 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:38:14,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:38:14,819 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2024-10-10 23:38:14,819 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:38:14,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585778434] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:38:14,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:38:14,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-10 23:38:14,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976567340] [2024-10-10 23:38:14,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:38:14,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:38:14,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:38:14,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:38:14,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:38:14,822 INFO L87 Difference]: Start difference. First operand 7577 states and 8702 transitions. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 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:38:15,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:38:15,968 INFO L93 Difference]: Finished difference Result 17245 states and 20054 transitions. [2024-10-10 23:38:15,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:38:15,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 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 544 [2024-10-10 23:38:15,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:38:15,986 INFO L225 Difference]: With dead ends: 17245 [2024-10-10 23:38:15,986 INFO L226 Difference]: Without dead ends: 9968 [2024-10-10 23:38:15,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 543 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:38:15,996 INFO L432 NwaCegarLoop]: 425 mSDtfsCounter, 356 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:38:15,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 444 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 970 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-10 23:38:16,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9968 states. [2024-10-10 23:38:16,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9968 to 9968. [2024-10-10 23:38:16,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9968 states, 9967 states have (on average 1.1499949834453698) internal successors, (11462), 9967 states have internal predecessors, (11462), 0 states have call successors, (0), 0 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:38:16,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9968 states to 9968 states and 11462 transitions. [2024-10-10 23:38:16,119 INFO L78 Accepts]: Start accepts. Automaton has 9968 states and 11462 transitions. Word has length 544 [2024-10-10 23:38:16,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:38:16,120 INFO L471 AbstractCegarLoop]: Abstraction has 9968 states and 11462 transitions. [2024-10-10 23:38:16,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 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:38:16,120 INFO L276 IsEmpty]: Start isEmpty. Operand 9968 states and 11462 transitions. [2024-10-10 23:38:16,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2024-10-10 23:38:16,125 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:38:16,125 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:16,145 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:38:16,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-10 23:38:16,327 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:38:16,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:38:16,327 INFO L85 PathProgramCache]: Analyzing trace with hash 288855046, now seen corresponding path program 1 times [2024-10-10 23:38:16,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:38:16,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909952219] [2024-10-10 23:38:16,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:38:16,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:38:16,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:38:16,930 INFO L134 CoverageAnalysis]: Checked inductivity of 771 backedges. 471 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2024-10-10 23:38:16,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:38:16,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909952219] [2024-10-10 23:38:16,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909952219] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:38:16,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:38:16,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:38:16,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674494455] [2024-10-10 23:38:16,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:38:16,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:38:16,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:38:16,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:38:16,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:38:16,934 INFO L87 Difference]: Start difference. First operand 9968 states and 11462 transitions. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 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:38:18,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:38:18,265 INFO L93 Difference]: Finished difference Result 24135 states and 28001 transitions. [2024-10-10 23:38:18,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:38:18,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 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 548 [2024-10-10 23:38:18,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:38:18,293 INFO L225 Difference]: With dead ends: 24135 [2024-10-10 23:38:18,293 INFO L226 Difference]: Without dead ends: 14467 [2024-10-10 23:38:18,305 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:38:18,306 INFO L432 NwaCegarLoop]: 586 mSDtfsCounter, 246 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:38:18,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 618 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 23:38:18,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14467 states. [2024-10-10 23:38:18,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14467 to 14157. [2024-10-10 23:38:18,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14157 states, 14156 states have (on average 1.13485447866629) internal successors, (16065), 14156 states have internal predecessors, (16065), 0 states have call successors, (0), 0 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:38:18,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14157 states to 14157 states and 16065 transitions. [2024-10-10 23:38:18,526 INFO L78 Accepts]: Start accepts. Automaton has 14157 states and 16065 transitions. Word has length 548 [2024-10-10 23:38:18,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:38:18,527 INFO L471 AbstractCegarLoop]: Abstraction has 14157 states and 16065 transitions. [2024-10-10 23:38:18,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 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:38:18,527 INFO L276 IsEmpty]: Start isEmpty. Operand 14157 states and 16065 transitions. [2024-10-10 23:38:18,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 624 [2024-10-10 23:38:18,536 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:38:18,536 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, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:18,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:38:18,537 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:38:18,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:38:18,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1867923366, now seen corresponding path program 1 times [2024-10-10 23:38:18,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:38:18,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480052278] [2024-10-10 23:38:18,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:38:18,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:38:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:38:19,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1129 backedges. 684 proven. 39 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2024-10-10 23:38:19,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:38:19,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480052278] [2024-10-10 23:38:19,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480052278] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:38:19,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047569300] [2024-10-10 23:38:19,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:38:19,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:38:19,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:38:19,401 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:38:19,403 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:38:19,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:38:19,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 781 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:38:19,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:38:19,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1129 backedges. 605 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2024-10-10 23:38:19,724 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:38:19,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047569300] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:38:19,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:38:19,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-10 23:38:19,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749544474] [2024-10-10 23:38:19,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:38:19,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:38:19,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:38:19,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:38:19,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:38:19,727 INFO L87 Difference]: Start difference. First operand 14157 states and 16065 transitions. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 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:38:20,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:38:20,996 INFO L93 Difference]: Finished difference Result 27711 states and 31489 transitions. [2024-10-10 23:38:20,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:38:20,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 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 623 [2024-10-10 23:38:20,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:38:21,014 INFO L225 Difference]: With dead ends: 27711 [2024-10-10 23:38:21,014 INFO L226 Difference]: Without dead ends: 13854 [2024-10-10 23:38:21,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 622 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:38:21,029 INFO L432 NwaCegarLoop]: 565 mSDtfsCounter, 252 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:38:21,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 601 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 23:38:21,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13854 states. [2024-10-10 23:38:21,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13854 to 13853. [2024-10-10 23:38:21,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13853 states, 13852 states have (on average 1.081648859370488) internal successors, (14983), 13852 states have internal predecessors, (14983), 0 states have call successors, (0), 0 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:38:21,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13853 states to 13853 states and 14983 transitions. [2024-10-10 23:38:21,233 INFO L78 Accepts]: Start accepts. Automaton has 13853 states and 14983 transitions. Word has length 623 [2024-10-10 23:38:21,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:38:21,233 INFO L471 AbstractCegarLoop]: Abstraction has 13853 states and 14983 transitions. [2024-10-10 23:38:21,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 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:38:21,234 INFO L276 IsEmpty]: Start isEmpty. Operand 13853 states and 14983 transitions. [2024-10-10 23:38:21,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 625 [2024-10-10 23:38:21,245 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:38:21,246 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, 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, 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, 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, 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] [2024-10-10 23:38:21,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-10 23:38:21,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:38:21,447 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:38:21,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:38:21,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1573979579, now seen corresponding path program 1 times [2024-10-10 23:38:21,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:38:21,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117789950] [2024-10-10 23:38:21,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:38:21,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:38:21,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:38:22,159 INFO L134 CoverageAnalysis]: Checked inductivity of 847 backedges. 611 proven. 39 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2024-10-10 23:38:22,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:38:22,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117789950] [2024-10-10 23:38:22,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117789950] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:38:22,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433882943] [2024-10-10 23:38:22,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:38:22,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:38:22,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:38:22,162 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:38:22,163 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:38:22,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:38:22,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 23:38:22,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:38:23,187 INFO L134 CoverageAnalysis]: Checked inductivity of 847 backedges. 650 proven. 0 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2024-10-10 23:38:23,187 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:38:23,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433882943] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:38:23,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:38:23,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-10 23:38:23,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741378562] [2024-10-10 23:38:23,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:38:23,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:38:23,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:38:23,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:38:23,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:38:23,192 INFO L87 Difference]: Start difference. First operand 13853 states and 14983 transitions. Second operand has 4 states, 4 states have (on average 122.0) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 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:38:24,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:38:24,805 INFO L93 Difference]: Finished difference Result 28903 states and 31297 transitions. [2024-10-10 23:38:24,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:38:24,806 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 122.0) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 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 624 [2024-10-10 23:38:24,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:38:24,821 INFO L225 Difference]: With dead ends: 28903 [2024-10-10 23:38:24,821 INFO L226 Difference]: Without dead ends: 15051 [2024-10-10 23:38:24,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 627 GetRequests, 622 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:38:24,829 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 317 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1506 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 1611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:38:24,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 355 Invalid, 1611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1506 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-10 23:38:24,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15051 states. [2024-10-10 23:38:24,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15051 to 14751. [2024-10-10 23:38:24,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14751 states, 14750 states have (on average 1.079728813559322) internal successors, (15926), 14750 states have internal predecessors, (15926), 0 states have call successors, (0), 0 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:38:24,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14751 states to 14751 states and 15926 transitions. [2024-10-10 23:38:24,997 INFO L78 Accepts]: Start accepts. Automaton has 14751 states and 15926 transitions. Word has length 624 [2024-10-10 23:38:24,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:38:24,997 INFO L471 AbstractCegarLoop]: Abstraction has 14751 states and 15926 transitions. [2024-10-10 23:38:24,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.0) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 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:38:24,998 INFO L276 IsEmpty]: Start isEmpty. Operand 14751 states and 15926 transitions. [2024-10-10 23:38:25,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2024-10-10 23:38:25,006 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:38:25,007 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, 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, 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, 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, 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, 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:38:25,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-10 23:38:25,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:38:25,208 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:38:25,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:38:25,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1905666958, now seen corresponding path program 1 times [2024-10-10 23:38:25,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:38:25,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153178929] [2024-10-10 23:38:25,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:38:25,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:38:25,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:38:25,503 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2024-10-10 23:38:25,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:38:25,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153178929] [2024-10-10 23:38:25,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153178929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:38:25,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:38:25,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:38:25,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565084012] [2024-10-10 23:38:25,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:38:25,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:38:25,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:38:25,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:38:25,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:38:25,506 INFO L87 Difference]: Start difference. First operand 14751 states and 15926 transitions. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 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:38:26,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:38:26,753 INFO L93 Difference]: Finished difference Result 37569 states and 40550 transitions. [2024-10-10 23:38:26,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:38:26,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 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 661 [2024-10-10 23:38:26,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:38:26,771 INFO L225 Difference]: With dead ends: 37569 [2024-10-10 23:38:26,771 INFO L226 Difference]: Without dead ends: 18932 [2024-10-10 23:38:26,785 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:38:26,786 INFO L432 NwaCegarLoop]: 605 mSDtfsCounter, 255 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:38:26,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 643 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-10 23:38:26,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18932 states. [2024-10-10 23:38:26,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18932 to 17138. [2024-10-10 23:38:26,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17138 states, 17137 states have (on average 1.0516426445702283) internal successors, (18022), 17137 states have internal predecessors, (18022), 0 states have call successors, (0), 0 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:38:27,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17138 states to 17138 states and 18022 transitions. [2024-10-10 23:38:27,019 INFO L78 Accepts]: Start accepts. Automaton has 17138 states and 18022 transitions. Word has length 661 [2024-10-10 23:38:27,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:38:27,020 INFO L471 AbstractCegarLoop]: Abstraction has 17138 states and 18022 transitions. [2024-10-10 23:38:27,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 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:38:27,020 INFO L276 IsEmpty]: Start isEmpty. Operand 17138 states and 18022 transitions. [2024-10-10 23:38:27,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2024-10-10 23:38:27,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:38:27,032 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, 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, 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, 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, 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, 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] [2024-10-10 23:38:27,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 23:38:27,033 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:38:27,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:38:27,033 INFO L85 PathProgramCache]: Analyzing trace with hash 911776274, now seen corresponding path program 1 times [2024-10-10 23:38:27,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:38:27,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884683122] [2024-10-10 23:38:27,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:38:27,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:38:27,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:38:27,610 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 528 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-10 23:38:27,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:38:27,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884683122] [2024-10-10 23:38:27,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884683122] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:38:27,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:38:27,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:38:27,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048315748] [2024-10-10 23:38:27,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:38:27,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:38:27,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:38:27,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:38:27,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:38:27,615 INFO L87 Difference]: Start difference. First operand 17138 states and 18022 transitions. Second operand has 3 states, 3 states have (on average 193.33333333333334) internal successors, (580), 3 states have internal predecessors, (580), 0 states have call successors, (0), 0 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:38:29,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:38:29,022 INFO L93 Difference]: Finished difference Result 39664 states and 41722 transitions. [2024-10-10 23:38:29,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:38:29,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 193.33333333333334) internal successors, (580), 3 states have internal predecessors, (580), 0 states have call successors, (0), 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 685 [2024-10-10 23:38:29,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:38:29,041 INFO L225 Difference]: With dead ends: 39664 [2024-10-10 23:38:29,041 INFO L226 Difference]: Without dead ends: 20135 [2024-10-10 23:38:29,055 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:38:29,056 INFO L432 NwaCegarLoop]: 532 mSDtfsCounter, 90 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:38:29,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 564 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 827 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 23:38:29,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20135 states. [2024-10-10 23:38:29,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20135 to 20133. [2024-10-10 23:38:29,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20133 states, 20132 states have (on average 1.0469898668786013) internal successors, (21078), 20132 states have internal predecessors, (21078), 0 states have call successors, (0), 0 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:38:29,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20133 states to 20133 states and 21078 transitions. [2024-10-10 23:38:29,247 INFO L78 Accepts]: Start accepts. Automaton has 20133 states and 21078 transitions. Word has length 685 [2024-10-10 23:38:29,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:38:29,247 INFO L471 AbstractCegarLoop]: Abstraction has 20133 states and 21078 transitions. [2024-10-10 23:38:29,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 193.33333333333334) internal successors, (580), 3 states have internal predecessors, (580), 0 states have call successors, (0), 0 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:38:29,248 INFO L276 IsEmpty]: Start isEmpty. Operand 20133 states and 21078 transitions. [2024-10-10 23:38:29,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 788 [2024-10-10 23:38:29,264 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:38:29,265 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:29,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-10 23:38:29,265 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:38:29,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:38:29,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1068147657, now seen corresponding path program 1 times [2024-10-10 23:38:29,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:38:29,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239649954] [2024-10-10 23:38:29,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:38:29,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:38:29,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:38:29,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1322 backedges. 748 proven. 0 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2024-10-10 23:38:29,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:38:29,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239649954] [2024-10-10 23:38:29,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239649954] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:38:29,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:38:29,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:38:29,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406815189] [2024-10-10 23:38:29,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:38:29,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:38:29,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:38:29,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:38:29,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:38:29,733 INFO L87 Difference]: Start difference. First operand 20133 states and 21078 transitions. Second operand has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 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:38:30,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:38:30,749 INFO L93 Difference]: Finished difference Result 44448 states and 46623 transitions. [2024-10-10 23:38:30,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:38:30,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 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 787 [2024-10-10 23:38:30,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:38:30,776 INFO L225 Difference]: With dead ends: 44448 [2024-10-10 23:38:30,776 INFO L226 Difference]: Without dead ends: 24316 [2024-10-10 23:38:30,793 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:38:30,793 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 184 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:38:30,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 215 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-10 23:38:30,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24316 states. [2024-10-10 23:38:30,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24316 to 22223. [2024-10-10 23:38:30,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22223 states, 22222 states have (on average 1.046350463504635) internal successors, (23252), 22222 states have internal predecessors, (23252), 0 states have call successors, (0), 0 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:38:30,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22223 states to 22223 states and 23252 transitions. [2024-10-10 23:38:30,994 INFO L78 Accepts]: Start accepts. Automaton has 22223 states and 23252 transitions. Word has length 787 [2024-10-10 23:38:30,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:38:30,994 INFO L471 AbstractCegarLoop]: Abstraction has 22223 states and 23252 transitions. [2024-10-10 23:38:30,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 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:38:30,995 INFO L276 IsEmpty]: Start isEmpty. Operand 22223 states and 23252 transitions. [2024-10-10 23:38:31,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 846 [2024-10-10 23:38:31,014 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:38:31,015 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, 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, 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, 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, 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] [2024-10-10 23:38:31,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-10 23:38:31,015 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:38:31,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:38:31,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1801830586, now seen corresponding path program 1 times [2024-10-10 23:38:31,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:38:31,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847834694] [2024-10-10 23:38:31,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:38:31,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:38:31,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:38:31,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 592 proven. 0 refuted. 0 times theorem prover too weak. 522 trivial. 0 not checked. [2024-10-10 23:38:31,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:38:31,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847834694] [2024-10-10 23:38:31,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847834694] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:38:31,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:38:31,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:38:31,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555050458] [2024-10-10 23:38:31,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:38:31,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:38:31,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:38:31,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:38:31,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:38:31,439 INFO L87 Difference]: Start difference. First operand 22223 states and 23252 transitions. Second operand has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 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:38:32,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:38:32,566 INFO L93 Difference]: Finished difference Result 48327 states and 50592 transitions. [2024-10-10 23:38:32,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:38:32,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 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 845 [2024-10-10 23:38:32,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:38:32,589 INFO L225 Difference]: With dead ends: 48327 [2024-10-10 23:38:32,589 INFO L226 Difference]: Without dead ends: 24909 [2024-10-10 23:38:32,602 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:38:32,603 INFO L432 NwaCegarLoop]: 513 mSDtfsCounter, 317 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:38:32,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 551 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-10 23:38:32,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24909 states. [2024-10-10 23:38:32,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24909 to 21915. [2024-10-10 23:38:32,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21915 states, 21914 states have (on average 1.0428949529980833) internal successors, (22854), 21914 states have internal predecessors, (22854), 0 states have call successors, (0), 0 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:38:32,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21915 states to 21915 states and 22854 transitions. [2024-10-10 23:38:32,790 INFO L78 Accepts]: Start accepts. Automaton has 21915 states and 22854 transitions. Word has length 845 [2024-10-10 23:38:32,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:38:32,869 INFO L471 AbstractCegarLoop]: Abstraction has 21915 states and 22854 transitions. [2024-10-10 23:38:32,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 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:38:32,870 INFO L276 IsEmpty]: Start isEmpty. Operand 21915 states and 22854 transitions. [2024-10-10 23:38:32,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 867 [2024-10-10 23:38:32,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:38:32,887 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, 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, 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, 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, 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] [2024-10-10 23:38:32,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-10 23:38:32,887 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:38:32,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:38:32,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1341291920, now seen corresponding path program 1 times [2024-10-10 23:38:32,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:38:32,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669518870] [2024-10-10 23:38:32,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:38:32,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:38:33,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:38:34,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1130 backedges. 637 proven. 269 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2024-10-10 23:38:34,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:38:34,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669518870] [2024-10-10 23:38:34,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669518870] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:38:34,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834592918] [2024-10-10 23:38:34,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:38:34,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:38:34,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:38:34,411 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:38:34,412 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:38:34,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:38:34,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 1000 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 23:38:34,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:38:34,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1130 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 895 trivial. 0 not checked. [2024-10-10 23:38:34,814 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:38:34,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834592918] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:38:34,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:38:34,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-10 23:38:34,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499748648] [2024-10-10 23:38:34,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:38:34,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:38:34,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:38:34,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:38:34,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:38:34,818 INFO L87 Difference]: Start difference. First operand 21915 states and 22854 transitions. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 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:38:36,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:38:36,019 INFO L93 Difference]: Finished difference Result 49530 states and 51608 transitions. [2024-10-10 23:38:36,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:38:36,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 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 866 [2024-10-10 23:38:36,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:38:36,048 INFO L225 Difference]: With dead ends: 49530 [2024-10-10 23:38:36,049 INFO L226 Difference]: Without dead ends: 27616 [2024-10-10 23:38:36,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 869 GetRequests, 865 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:38:36,057 INFO L432 NwaCegarLoop]: 507 mSDtfsCounter, 274 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:38:36,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 536 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-10 23:38:36,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27616 states. [2024-10-10 23:38:36,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27616 to 24912. [2024-10-10 23:38:36,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24912 states, 24911 states have (on average 1.0418690538316406) internal successors, (25954), 24911 states have internal predecessors, (25954), 0 states have call successors, (0), 0 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:38:36,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24912 states to 24912 states and 25954 transitions. [2024-10-10 23:38:36,248 INFO L78 Accepts]: Start accepts. Automaton has 24912 states and 25954 transitions. Word has length 866 [2024-10-10 23:38:36,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:38:36,248 INFO L471 AbstractCegarLoop]: Abstraction has 24912 states and 25954 transitions. [2024-10-10 23:38:36,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 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:38:36,249 INFO L276 IsEmpty]: Start isEmpty. Operand 24912 states and 25954 transitions. [2024-10-10 23:38:36,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 900 [2024-10-10 23:38:36,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:38:36,259 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, 6, 6, 6, 6, 6, 6, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:36,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-10 23:38:36,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:38:36,460 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:38:36,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:38:36,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1866566725, now seen corresponding path program 1 times [2024-10-10 23:38:36,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:38:36,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804335075] [2024-10-10 23:38:36,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:38:36,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:38:36,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:38:37,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1501 backedges. 859 proven. 0 refuted. 0 times theorem prover too weak. 642 trivial. 0 not checked. [2024-10-10 23:38:37,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:38:37,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804335075] [2024-10-10 23:38:37,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804335075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:38:37,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:38:37,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:38:37,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882462391] [2024-10-10 23:38:37,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:38:37,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:38:37,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:38:37,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:38:37,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:38:37,406 INFO L87 Difference]: Start difference. First operand 24912 states and 25954 transitions. Second operand has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 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:38:38,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:38:38,599 INFO L93 Difference]: Finished difference Result 54626 states and 56858 transitions. [2024-10-10 23:38:38,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:38:38,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 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 899 [2024-10-10 23:38:38,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:38:38,629 INFO L225 Difference]: With dead ends: 54626 [2024-10-10 23:38:38,629 INFO L226 Difference]: Without dead ends: 29416 [2024-10-10 23:38:38,646 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:38:38,646 INFO L432 NwaCegarLoop]: 504 mSDtfsCounter, 147 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:38:38,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 531 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-10 23:38:38,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29416 states. [2024-10-10 23:38:38,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29416 to 24609. [2024-10-10 23:38:38,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24609 states, 24608 states have (on average 1.0419375812743823) internal successors, (25640), 24608 states have internal predecessors, (25640), 0 states have call successors, (0), 0 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:38:38,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24609 states to 24609 states and 25640 transitions. [2024-10-10 23:38:38,866 INFO L78 Accepts]: Start accepts. Automaton has 24609 states and 25640 transitions. Word has length 899 [2024-10-10 23:38:38,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:38:38,866 INFO L471 AbstractCegarLoop]: Abstraction has 24609 states and 25640 transitions. [2024-10-10 23:38:38,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 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:38:38,867 INFO L276 IsEmpty]: Start isEmpty. Operand 24609 states and 25640 transitions. [2024-10-10 23:38:38,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 904 [2024-10-10 23:38:38,876 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:38:38,876 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, 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, 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, 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, 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] [2024-10-10 23:38:38,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-10 23:38:38,876 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:38:38,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:38:38,877 INFO L85 PathProgramCache]: Analyzing trace with hash 950820433, now seen corresponding path program 1 times [2024-10-10 23:38:38,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:38:38,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374639666] [2024-10-10 23:38:38,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:38:38,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:38:39,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:38:40,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1204 backedges. 711 proven. 269 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2024-10-10 23:38:40,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:38:40,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374639666] [2024-10-10 23:38:40,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374639666] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:38:40,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750879180] [2024-10-10 23:38:40,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:38:40,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:38:40,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:38:40,464 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:38:40,465 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:38:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:38:40,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 1037 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 23:38:40,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:38:42,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1204 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-10-10 23:38:42,783 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:38:42,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750879180] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:38:42,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:38:42,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-10 23:38:42,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066477197] [2024-10-10 23:38:42,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:38:42,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:38:42,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:38:42,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:38:42,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:38:42,786 INFO L87 Difference]: Start difference. First operand 24609 states and 25640 transitions. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 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:38:44,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:38:44,062 INFO L93 Difference]: Finished difference Result 53423 states and 55628 transitions. [2024-10-10 23:38:44,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:38:44,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 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 903 [2024-10-10 23:38:44,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:38:44,087 INFO L225 Difference]: With dead ends: 53423 [2024-10-10 23:38:44,088 INFO L226 Difference]: Without dead ends: 28815 [2024-10-10 23:38:44,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 906 GetRequests, 902 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:38:44,104 INFO L432 NwaCegarLoop]: 498 mSDtfsCounter, 279 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 939 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:38:44,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 523 Invalid, 1048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 939 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 23:38:44,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28815 states. [2024-10-10 23:38:44,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28815 to 25506. [2024-10-10 23:38:44,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25506 states, 25505 states have (on average 1.040541070378357) internal successors, (26539), 25505 states have internal predecessors, (26539), 0 states have call successors, (0), 0 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:38:44,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25506 states to 25506 states and 26539 transitions. [2024-10-10 23:38:44,312 INFO L78 Accepts]: Start accepts. Automaton has 25506 states and 26539 transitions. Word has length 903 [2024-10-10 23:38:44,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:38:44,313 INFO L471 AbstractCegarLoop]: Abstraction has 25506 states and 26539 transitions. [2024-10-10 23:38:44,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 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:38:44,313 INFO L276 IsEmpty]: Start isEmpty. Operand 25506 states and 26539 transitions. [2024-10-10 23:38:44,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1025 [2024-10-10 23:38:44,323 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:38:44,324 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, 6, 6, 6, 6, 6, 6, 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, 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, 4, 4, 4, 4, 4, 4, 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, 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:38:44,337 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:38:44,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:38:44,525 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:38:44,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:38:44,525 INFO L85 PathProgramCache]: Analyzing trace with hash 361076006, now seen corresponding path program 1 times [2024-10-10 23:38:44,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:38:44,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369361913] [2024-10-10 23:38:44,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:38:44,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:38:44,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:38:46,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1775 backedges. 1281 proven. 90 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2024-10-10 23:38:46,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:38:46,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369361913] [2024-10-10 23:38:46,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369361913] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:38:46,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458199275] [2024-10-10 23:38:46,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:38:46,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:38:46,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:38:46,295 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:38:46,305 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:38:46,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:38:46,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 1179 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-10 23:38:46,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:38:47,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1775 backedges. 1188 proven. 399 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2024-10-10 23:38:47,249 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:38:47,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1775 backedges. 933 proven. 0 refuted. 0 times theorem prover too weak. 842 trivial. 0 not checked. [2024-10-10 23:38:47,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458199275] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-10 23:38:47,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-10 23:38:47,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 6] total 10 [2024-10-10 23:38:47,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286898659] [2024-10-10 23:38:47,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:38:47,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:38:47,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:38:47,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:38:47,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-10 23:38:47,535 INFO L87 Difference]: Start difference. First operand 25506 states and 26539 transitions. Second operand has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 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:38:49,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:38:49,088 INFO L93 Difference]: Finished difference Result 53412 states and 55528 transitions. [2024-10-10 23:38:49,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:38:49,088 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 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 1024 [2024-10-10 23:38:49,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:38:49,120 INFO L225 Difference]: With dead ends: 53412 [2024-10-10 23:38:49,121 INFO L226 Difference]: Without dead ends: 27608 [2024-10-10 23:38:49,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2053 GetRequests, 2045 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-10 23:38:49,137 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 482 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 1547 mSolverCounterSat, 408 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 1955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 408 IncrementalHoareTripleChecker+Valid, 1547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:38:49,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 65 Invalid, 1955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [408 Valid, 1547 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-10 23:38:49,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27608 states. [2024-10-10 23:38:49,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27608 to 22209. [2024-10-10 23:38:49,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22209 states, 22208 states have (on average 1.0400756484149856) internal successors, (23098), 22208 states have internal predecessors, (23098), 0 states have call successors, (0), 0 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:38:49,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22209 states to 22209 states and 23098 transitions. [2024-10-10 23:38:49,328 INFO L78 Accepts]: Start accepts. Automaton has 22209 states and 23098 transitions. Word has length 1024 [2024-10-10 23:38:49,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:38:49,329 INFO L471 AbstractCegarLoop]: Abstraction has 22209 states and 23098 transitions. [2024-10-10 23:38:49,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 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:38:49,329 INFO L276 IsEmpty]: Start isEmpty. Operand 22209 states and 23098 transitions. [2024-10-10 23:38:49,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1725 [2024-10-10 23:38:49,355 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:38:49,356 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 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, 7, 7, 7, 7, 7, 7, 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, 4, 4, 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, 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] [2024-10-10 23:38:49,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-10 23:38:49,556 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,SelfDestructingSolverStorable21 [2024-10-10 23:38:49,557 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:38:49,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:38:49,557 INFO L85 PathProgramCache]: Analyzing trace with hash -286849876, now seen corresponding path program 1 times [2024-10-10 23:38:49,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:38:49,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527957934] [2024-10-10 23:38:49,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:38:49,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:38:49,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:38:50,953 INFO L134 CoverageAnalysis]: Checked inductivity of 6238 backedges. 2890 proven. 0 refuted. 0 times theorem prover too weak. 3348 trivial. 0 not checked. [2024-10-10 23:38:50,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:38:50,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527957934] [2024-10-10 23:38:50,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527957934] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:38:50,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:38:50,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:38:50,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330932031] [2024-10-10 23:38:50,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:38:50,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:38:50,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:38:50,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:38:50,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:38:50,955 INFO L87 Difference]: Start difference. First operand 22209 states and 23098 transitions. Second operand has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 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:38:51,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:38:51,714 INFO L93 Difference]: Finished difference Result 33907 states and 35071 transitions. [2024-10-10 23:38:51,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:38:51,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 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 1724 [2024-10-10 23:38:51,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:38:51,716 INFO L225 Difference]: With dead ends: 33907 [2024-10-10 23:38:51,716 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 23:38:51,727 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:38:51,727 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 316 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:38:51,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 76 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:38:51,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 23:38:51,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 23:38:51,728 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:38:51,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 23:38:51,729 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1724 [2024-10-10 23:38:51,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:38:51,729 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 23:38:51,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 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:38:51,730 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 23:38:51,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 23:38:51,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 23:38:51,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-10 23:38:51,735 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, 1] [2024-10-10 23:38:51,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 23:38:54,438 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 23:38:54,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 11:38:54 BoogieIcfgContainer [2024-10-10 23:38:54,459 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 23:38:54,460 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 23:38:54,462 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 23:38:54,463 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 23:38:54,463 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:37:55" (3/4) ... [2024-10-10 23:38:54,465 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 23:38:54,494 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-10 23:38:54,497 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 23:38:54,499 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 23:38:54,501 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 23:38:54,753 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 23:38:54,754 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 23:38:54,754 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 23:38:54,755 INFO L158 Benchmark]: Toolchain (without parser) took 63585.77ms. Allocated memory was 165.7MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 132.2MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 227.6MB. Max. memory is 16.1GB. [2024-10-10 23:38:54,755 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 109.1MB. Free memory was 83.3MB in the beginning and 83.1MB in the end (delta: 176.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 23:38:54,755 INFO L158 Benchmark]: CACSL2BoogieTranslator took 917.81ms. Allocated memory is still 165.7MB. Free memory was 132.2MB in the beginning and 51.7MB in the end (delta: 80.5MB). Peak memory consumption was 79.7MB. Max. memory is 16.1GB. [2024-10-10 23:38:54,756 INFO L158 Benchmark]: Boogie Procedure Inliner took 220.82ms. Allocated memory is still 165.7MB. Free memory was 51.7MB in the beginning and 97.6MB in the end (delta: -45.9MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. [2024-10-10 23:38:54,756 INFO L158 Benchmark]: Boogie Preprocessor took 344.96ms. Allocated memory is still 165.7MB. Free memory was 97.6MB in the beginning and 103.7MB in the end (delta: -6.0MB). Peak memory consumption was 89.3MB. Max. memory is 16.1GB. [2024-10-10 23:38:54,757 INFO L158 Benchmark]: RCFGBuilder took 2534.73ms. Allocated memory was 165.7MB in the beginning and 274.7MB in the end (delta: 109.1MB). Free memory was 103.7MB in the beginning and 174.0MB in the end (delta: -70.3MB). Peak memory consumption was 106.0MB. Max. memory is 16.1GB. [2024-10-10 23:38:54,757 INFO L158 Benchmark]: TraceAbstraction took 59266.79ms. Allocated memory was 274.7MB in the beginning and 2.0GB in the end (delta: 1.7GB). Free memory was 174.0MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-10-10 23:38:54,757 INFO L158 Benchmark]: Witness Printer took 294.02ms. Allocated memory is still 2.0GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-10 23:38:54,758 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.11ms. Allocated memory is still 109.1MB. Free memory was 83.3MB in the beginning and 83.1MB in the end (delta: 176.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 917.81ms. Allocated memory is still 165.7MB. Free memory was 132.2MB in the beginning and 51.7MB in the end (delta: 80.5MB). Peak memory consumption was 79.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 220.82ms. Allocated memory is still 165.7MB. Free memory was 51.7MB in the beginning and 97.6MB in the end (delta: -45.9MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 344.96ms. Allocated memory is still 165.7MB. Free memory was 97.6MB in the beginning and 103.7MB in the end (delta: -6.0MB). Peak memory consumption was 89.3MB. Max. memory is 16.1GB. * RCFGBuilder took 2534.73ms. Allocated memory was 165.7MB in the beginning and 274.7MB in the end (delta: 109.1MB). Free memory was 103.7MB in the beginning and 174.0MB in the end (delta: -70.3MB). Peak memory consumption was 106.0MB. Max. memory is 16.1GB. * TraceAbstraction took 59266.79ms. Allocated memory was 274.7MB in the beginning and 2.0GB in the end (delta: 1.7GB). Free memory was 174.0MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 294.02ms. Allocated memory is still 2.0GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. 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: 200]: 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, 362 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 56.5s, OverallIterations: 23, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 30.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5574 SdHoareTripleChecker+Valid, 27.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5574 mSDsluCounter, 10277 SdHoareTripleChecker+Invalid, 23.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 761 mSDsCounter, 3997 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21006 IncrementalHoareTripleChecker+Invalid, 25003 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3997 mSolverCounterUnsat, 9516 mSDtfsCounter, 21006 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5673 GetRequests, 5628 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25506occurred in iteration=21, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 29429 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 17.0s InterpolantComputationTime, 17958 NumberOfCodeBlocks, 17958 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 18952 ConstructedInterpolants, 0 QuantifiedInterpolants, 58012 SizeOfPredicates, 0 NumberOfNonLiveVariables, 5436 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 30 InterpolantComputations, 23 PerfectInterpolantSequences, 28140/29284 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: 1776]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((long long) 89 + a4) <= 0) && (0 <= ((long long) 600143 + a29))) && (3 == a2)) && (((long long) a29 + 127) <= 0)) || (((((long long) 89 + a4) <= 0) && (((long long) a0 + 147) <= 0)) && (5 <= a2))) || (((2 == a2) && (((long long) 89 + a4) <= 0)) && (0 <= ((long long) 600143 + a29)))) || (((2 == a2) && (((long long) 89 + a4) <= 0)) && (((long long) 98 + a0) <= 0))) || (((0 <= ((long long) a29 + 15)) && (((long long) 89 + a4) <= 0)) && (5 <= a2))) || ((((2 == a2) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 99) <= 0)) && (0 <= ((long long) a29 + 13)))) || ((((0 <= ((long long) a4 + 85)) && (((long long) 98 + a0) <= 0)) && (a2 == 1)) && (0 <= ((long long) 600143 + a29)))) || (((((long long) 89 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (a2 == 4))) || ((((0 <= ((long long) a4 + 85)) && (((long long) 98 + a0) <= 0)) && (5 <= a2)) && (0 <= ((long long) 600143 + a29)))) || (((((long long) a0 + 147) <= 0) && (a2 == 1)) && (0 <= ((long long) 600143 + a29)))) || ((((2 == a2) && (0 <= ((long long) a4 + 85))) && (0 <= ((long long) a29 + 15))) && (((long long) a0 + 147) <= 0))) || ((((0 <= ((long long) a4 + 85)) && (0 <= ((long long) a29 + 15))) && (((long long) a0 + 99) <= 0)) && (3 == a2))) || ((((((long long) 89 + a4) <= 0) && (0 <= ((long long) 600143 + a29))) && (a2 == 4)) && (a29 <= 43))) || (((((long long) 89 + a4) <= 0) && (a2 == 1)) && (((long long) a29 + 127) <= 0))) || ((((0 <= ((long long) 97 + a0)) && (((long long) 89 + a4) <= 0)) && (0 <= ((long long) 600143 + a29))) && (3 == a2))) || (((44 <= a29) && (((long long) a0 + 147) <= 0)) && (5 <= a2))) || ((((((long long) a0 + 147) <= 0) && (0 <= ((long long) 600143 + a29))) && (3 == a2)) && (a29 <= 43))) || ((((0 <= ((long long) a4 + 85)) && (44 <= a29)) && (((long long) 98 + a0) <= 0)) && (a2 == 4))) || ((((0 <= ((long long) 97 + a0)) && (((long long) 89 + a4) <= 0)) && (a2 == 1)) && (a29 <= 43))) || (((((long long) a0 + 99) <= 0) && (((long long) 89 + a4) <= 0)) && (3 == a2))) || ((((0 <= ((long long) a4 + 85)) && (a2 == 1)) && (0 <= ((long long) 600143 + a29))) && (a29 <= 43))) || ((((2 == a2) && (0 <= ((long long) a4 + 85))) && (0 <= ((long long) a29 + 3))) && (((long long) 98 + a0) <= 0))) || ((((0 <= ((long long) a4 + 85)) && (((long long) a0 + 147) <= 0)) && (0 <= ((long long) 600143 + a29))) && (a2 == 4))) || ((((44 <= a29) && (((long long) a0 + 99) <= 0)) && (((long long) 89 + a4) <= 0)) && (a2 == 1))) RESULT: Ultimate proved your program to be correct! [2024-10-10 23:38:54,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE