./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label05.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e02cb01095391f043ac338e051aad38ada321e317716e1cbc4cb781d100f4706 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-13 23:41:46,598 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 23:41:46,662 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 23:41:46,665 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 23:41:46,667 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 23:41:46,692 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 23:41:46,692 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 23:41:46,693 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 23:41:46,693 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 23:41:46,693 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 23:41:46,693 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 23:41:46,694 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 23:41:46,694 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 23:41:46,694 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 23:41:46,695 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 23:41:46,695 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 23:41:46,698 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 23:41:46,698 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 23:41:46,698 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 23:41:46,698 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 23:41:46,698 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 23:41:46,701 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 23:41:46,701 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 23:41:46,702 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 23:41:46,702 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 23:41:46,702 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 23:41:46,702 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 23:41:46,702 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 23:41:46,703 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 23:41:46,703 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 23:41:46,703 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 23:41:46,703 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 23:41:46,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:41:46,703 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 23:41:46,703 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 23:41:46,704 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 23:41:46,704 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 23:41:46,704 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 23:41:46,704 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 23:41:46,705 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 23:41:46,705 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 23:41:46,706 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 23:41:46,706 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e02cb01095391f043ac338e051aad38ada321e317716e1cbc4cb781d100f4706 [2024-10-13 23:41:46,888 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 23:41:46,910 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 23:41:46,912 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 23:41:46,913 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 23:41:46,913 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 23:41:46,914 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label05.c [2024-10-13 23:41:48,125 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 23:41:48,327 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 23:41:48,327 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label05.c [2024-10-13 23:41:48,340 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed5309124/1b68ea2ecb434e28badc47a8c9273896/FLAG5a68066b7 [2024-10-13 23:41:48,688 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed5309124/1b68ea2ecb434e28badc47a8c9273896 [2024-10-13 23:41:48,689 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 23:41:48,690 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 23:41:48,692 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 23:41:48,693 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 23:41:48,697 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 23:41:48,697 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:41:48" (1/1) ... [2024-10-13 23:41:48,698 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@596704b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:41:48, skipping insertion in model container [2024-10-13 23:41:48,698 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:41:48" (1/1) ... [2024-10-13 23:41:48,734 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 23:41:48,888 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label05.c[6428,6441] [2024-10-13 23:41:49,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:41:49,021 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 23:41:49,046 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label05.c[6428,6441] [2024-10-13 23:41:49,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:41:49,115 INFO L204 MainTranslator]: Completed translation [2024-10-13 23:41:49,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:41:49 WrapperNode [2024-10-13 23:41:49,115 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 23:41:49,116 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 23:41:49,117 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 23:41:49,117 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 23:41:49,122 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:41:49" (1/1) ... [2024-10-13 23:41:49,139 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:41:49" (1/1) ... [2024-10-13 23:41:49,196 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 859 [2024-10-13 23:41:49,197 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 23:41:49,198 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 23:41:49,198 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 23:41:49,198 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 23:41:49,210 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:41:49" (1/1) ... [2024-10-13 23:41:49,211 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:41:49" (1/1) ... [2024-10-13 23:41:49,223 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:41:49" (1/1) ... [2024-10-13 23:41:49,244 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-13 23:41:49,245 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:41:49" (1/1) ... [2024-10-13 23:41:49,245 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:41:49" (1/1) ... [2024-10-13 23:41:49,260 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:41:49" (1/1) ... [2024-10-13 23:41:49,266 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:41:49" (1/1) ... [2024-10-13 23:41:49,269 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:41:49" (1/1) ... [2024-10-13 23:41:49,273 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:41:49" (1/1) ... [2024-10-13 23:41:49,281 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 23:41:49,282 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 23:41:49,282 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 23:41:49,282 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 23:41:49,284 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:41:49" (1/1) ... [2024-10-13 23:41:49,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:41:49,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:41:49,312 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 23:41:49,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 23:41:49,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 23:41:49,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 23:41:49,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 23:41:49,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 23:41:49,455 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 23:41:49,457 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 23:41:50,246 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-10-13 23:41:50,246 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 23:41:50,295 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 23:41:50,296 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 23:41:50,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:41:50 BoogieIcfgContainer [2024-10-13 23:41:50,297 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 23:41:50,299 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 23:41:50,299 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 23:41:50,302 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 23:41:50,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:41:48" (1/3) ... [2024-10-13 23:41:50,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@595590ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:41:50, skipping insertion in model container [2024-10-13 23:41:50,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:41:49" (2/3) ... [2024-10-13 23:41:50,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@595590ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:41:50, skipping insertion in model container [2024-10-13 23:41:50,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:41:50" (3/3) ... [2024-10-13 23:41:50,305 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label05.c [2024-10-13 23:41:50,318 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 23:41:50,319 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 23:41:50,379 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 23:41:50,384 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;@63bcfc4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 23:41:50,384 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 23:41:50,389 INFO L276 IsEmpty]: Start isEmpty. Operand has 183 states, 181 states have (on average 1.988950276243094) internal successors, (360), 182 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:50,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-13 23:41:50,396 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:41:50,397 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, 1, 1] [2024-10-13 23:41:50,398 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:41:50,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:41:50,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1343325496, now seen corresponding path program 1 times [2024-10-13 23:41:50,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:41:50,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972295174] [2024-10-13 23:41:50,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:41:50,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:41:50,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:41:50,574 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-13 23:41:50,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:41:50,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972295174] [2024-10-13 23:41:50,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972295174] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:41:50,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:41:50,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:41:50,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000627138] [2024-10-13 23:41:50,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:41:50,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 23:41:50,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:41:50,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 23:41:50,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 23:41:50,604 INFO L87 Difference]: Start difference. First operand has 183 states, 181 states have (on average 1.988950276243094) internal successors, (360), 182 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 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-13 23:41:50,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:41:50,638 INFO L93 Difference]: Finished difference Result 365 states and 719 transitions. [2024-10-13 23:41:50,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 23:41:50,641 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-10-13 23:41:50,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:41:50,649 INFO L225 Difference]: With dead ends: 365 [2024-10-13 23:41:50,649 INFO L226 Difference]: Without dead ends: 181 [2024-10-13 23:41:50,652 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-13 23:41:50,655 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:41:50,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 295 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 23:41:50,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-13 23:41:50,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2024-10-13 23:41:50,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.6388888888888888) internal successors, (295), 180 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:50,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 295 transitions. [2024-10-13 23:41:50,689 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 295 transitions. Word has length 62 [2024-10-13 23:41:50,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:41:50,689 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 295 transitions. [2024-10-13 23:41:50,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 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-13 23:41:50,690 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 295 transitions. [2024-10-13 23:41:50,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-13 23:41:50,691 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:41:50,691 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, 1, 1] [2024-10-13 23:41:50,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 23:41:50,691 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:41:50,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:41:50,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1499090916, now seen corresponding path program 1 times [2024-10-13 23:41:50,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:41:50,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271618383] [2024-10-13 23:41:50,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:41:50,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:41:50,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:41:50,860 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-13 23:41:50,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:41:50,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271618383] [2024-10-13 23:41:50,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271618383] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:41:50,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:41:50,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:41:50,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531948213] [2024-10-13 23:41:50,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:41:50,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:41:50,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:41:50,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:41:50,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:41:50,864 INFO L87 Difference]: Start difference. First operand 181 states and 295 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 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-13 23:41:51,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:41:51,557 INFO L93 Difference]: Finished difference Result 539 states and 882 transitions. [2024-10-13 23:41:51,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:41:51,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-10-13 23:41:51,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:41:51,560 INFO L225 Difference]: With dead ends: 539 [2024-10-13 23:41:51,560 INFO L226 Difference]: Without dead ends: 359 [2024-10-13 23:41:51,560 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-13 23:41:51,561 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 136 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:41:51,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 87 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 23:41:51,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-10-13 23:41:51,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2024-10-13 23:41:51,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 1.4217877094972067) internal successors, (509), 358 states have internal predecessors, (509), 0 states have call successors, (0), 0 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-13 23:41:51,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 509 transitions. [2024-10-13 23:41:51,590 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 509 transitions. Word has length 62 [2024-10-13 23:41:51,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:41:51,591 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 509 transitions. [2024-10-13 23:41:51,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 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-13 23:41:51,591 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 509 transitions. [2024-10-13 23:41:51,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-13 23:41:51,594 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:41:51,594 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, 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] [2024-10-13 23:41:51,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 23:41:51,595 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:41:51,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:41:51,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1249954956, now seen corresponding path program 1 times [2024-10-13 23:41:51,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:41:51,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766231625] [2024-10-13 23:41:51,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:41:51,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:41:51,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:41:51,872 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:41:51,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:41:51,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766231625] [2024-10-13 23:41:51,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766231625] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:41:51,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:41:51,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:41:51,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864565006] [2024-10-13 23:41:51,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:41:51,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:41:51,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:41:51,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:41:51,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:41:51,875 INFO L87 Difference]: Start difference. First operand 359 states and 509 transitions. Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:52,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:41:52,633 INFO L93 Difference]: Finished difference Result 1073 states and 1445 transitions. [2024-10-13 23:41:52,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:41:52,634 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 141 [2024-10-13 23:41:52,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:41:52,637 INFO L225 Difference]: With dead ends: 1073 [2024-10-13 23:41:52,637 INFO L226 Difference]: Without dead ends: 715 [2024-10-13 23:41:52,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:41:52,639 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 418 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:41:52,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 119 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 23:41:52,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2024-10-13 23:41:52,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2024-10-13 23:41:52,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 714 states have (on average 1.2619047619047619) internal successors, (901), 714 states have internal predecessors, (901), 0 states have call successors, (0), 0 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-13 23:41:52,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 901 transitions. [2024-10-13 23:41:52,655 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 901 transitions. Word has length 141 [2024-10-13 23:41:52,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:41:52,655 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 901 transitions. [2024-10-13 23:41:52,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:52,655 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 901 transitions. [2024-10-13 23:41:52,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-13 23:41:52,657 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:41:52,657 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, 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] [2024-10-13 23:41:52,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 23:41:52,657 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:41:52,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:41:52,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1076828117, now seen corresponding path program 1 times [2024-10-13 23:41:52,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:41:52,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101501910] [2024-10-13 23:41:52,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:41:52,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:41:52,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:41:52,871 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-13 23:41:52,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:41:52,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101501910] [2024-10-13 23:41:52,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101501910] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:41:52,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928838034] [2024-10-13 23:41:52,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:41:52,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:41:52,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:41:52,875 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:41:52,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 23:41:52,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:41:52,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:41:52,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:41:53,122 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-13 23:41:53,123 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:41:53,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928838034] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:41:53,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:41:53,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-13 23:41:53,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702235529] [2024-10-13 23:41:53,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:41:53,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:41:53,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:41:53,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:41:53,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:41:53,128 INFO L87 Difference]: Start difference. First operand 715 states and 901 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 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-13 23:41:53,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:41:53,577 INFO L93 Difference]: Finished difference Result 1251 states and 1611 transitions. [2024-10-13 23:41:53,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:41:53,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 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 167 [2024-10-13 23:41:53,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:41:53,581 INFO L225 Difference]: With dead ends: 1251 [2024-10-13 23:41:53,581 INFO L226 Difference]: Without dead ends: 1249 [2024-10-13 23:41:53,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:41:53,582 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 91 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:41:53,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 34 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 23:41:53,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2024-10-13 23:41:53,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 893. [2024-10-13 23:41:53,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 893 states, 892 states have (on average 1.3374439461883407) internal successors, (1193), 892 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:53,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1193 transitions. [2024-10-13 23:41:53,615 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1193 transitions. Word has length 167 [2024-10-13 23:41:53,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:41:53,615 INFO L471 AbstractCegarLoop]: Abstraction has 893 states and 1193 transitions. [2024-10-13 23:41:53,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 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-13 23:41:53,615 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1193 transitions. [2024-10-13 23:41:53,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-10-13 23:41:53,618 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:41:53,619 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-13 23:41:53,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 23:41:53,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:41:53,821 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:41:53,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:41:53,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1459750209, now seen corresponding path program 1 times [2024-10-13 23:41:53,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:41:53,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434056048] [2024-10-13 23:41:53,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:41:53,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:41:53,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:41:54,040 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-13 23:41:54,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:41:54,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434056048] [2024-10-13 23:41:54,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434056048] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:41:54,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:41:54,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:41:54,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962351801] [2024-10-13 23:41:54,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:41:54,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:41:54,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:41:54,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:41:54,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:41:54,042 INFO L87 Difference]: Start difference. First operand 893 states and 1193 transitions. Second operand has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:54,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:41:54,599 INFO L93 Difference]: Finished difference Result 1992 states and 2628 transitions. [2024-10-13 23:41:54,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:41:54,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 221 [2024-10-13 23:41:54,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:41:54,603 INFO L225 Difference]: With dead ends: 1992 [2024-10-13 23:41:54,604 INFO L226 Difference]: Without dead ends: 1071 [2024-10-13 23:41:54,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:41:54,609 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 116 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:41:54,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 116 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 23:41:54,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2024-10-13 23:41:54,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1071. [2024-10-13 23:41:54,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 1070 states have (on average 1.1803738317757009) internal successors, (1263), 1070 states have internal predecessors, (1263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:54,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1263 transitions. [2024-10-13 23:41:54,623 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1263 transitions. Word has length 221 [2024-10-13 23:41:54,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:41:54,624 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1263 transitions. [2024-10-13 23:41:54,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:54,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1263 transitions. [2024-10-13 23:41:54,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-10-13 23:41:54,626 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:41:54,626 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, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:41:54,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 23:41:54,626 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:41:54,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:41:54,627 INFO L85 PathProgramCache]: Analyzing trace with hash 825737669, now seen corresponding path program 1 times [2024-10-13 23:41:54,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:41:54,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873658169] [2024-10-13 23:41:54,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:41:54,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:41:54,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:41:54,841 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 121 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:41:54,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:41:54,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873658169] [2024-10-13 23:41:54,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873658169] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:41:54,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945311317] [2024-10-13 23:41:54,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:41:54,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:41:54,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:41:54,844 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:41:54,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 23:41:54,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:41:54,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:41:54,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:41:55,000 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-13 23:41:55,000 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:41:55,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945311317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:41:55,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:41:55,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-13 23:41:55,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202713602] [2024-10-13 23:41:55,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:41:55,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:41:55,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:41:55,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:41:55,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:41:55,002 INFO L87 Difference]: Start difference. First operand 1071 states and 1263 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 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-13 23:41:55,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:41:55,432 INFO L93 Difference]: Finished difference Result 2497 states and 3032 transitions. [2024-10-13 23:41:55,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:41:55,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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 233 [2024-10-13 23:41:55,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:41:55,436 INFO L225 Difference]: With dead ends: 2497 [2024-10-13 23:41:55,437 INFO L226 Difference]: Without dead ends: 1427 [2024-10-13 23:41:55,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:41:55,439 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 119 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:41:55,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 83 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 23:41:55,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2024-10-13 23:41:55,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1071. [2024-10-13 23:41:55,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 1070 states have (on average 1.1803738317757009) internal successors, (1263), 1070 states have internal predecessors, (1263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:55,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1263 transitions. [2024-10-13 23:41:55,457 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1263 transitions. Word has length 233 [2024-10-13 23:41:55,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:41:55,457 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1263 transitions. [2024-10-13 23:41:55,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 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-13 23:41:55,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1263 transitions. [2024-10-13 23:41:55,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-10-13 23:41:55,459 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:41:55,459 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, 3, 3, 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-13 23:41:55,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 23:41:55,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-13 23:41:55,662 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:41:55,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:41:55,662 INFO L85 PathProgramCache]: Analyzing trace with hash 367037474, now seen corresponding path program 1 times [2024-10-13 23:41:55,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:41:55,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884775142] [2024-10-13 23:41:55,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:41:55,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:41:55,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:41:55,848 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:41:55,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:41:55,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884775142] [2024-10-13 23:41:55,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884775142] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:41:55,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:41:55,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:41:55,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144738800] [2024-10-13 23:41:55,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:41:55,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:41:55,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:41:55,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:41:55,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:41:55,851 INFO L87 Difference]: Start difference. First operand 1071 states and 1263 transitions. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 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-13 23:41:56,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:41:56,255 INFO L93 Difference]: Finished difference Result 2675 states and 3212 transitions. [2024-10-13 23:41:56,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:41:56,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 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 236 [2024-10-13 23:41:56,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:41:56,260 INFO L225 Difference]: With dead ends: 2675 [2024-10-13 23:41:56,260 INFO L226 Difference]: Without dead ends: 1605 [2024-10-13 23:41:56,261 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-13 23:41:56,262 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 111 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:41:56,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 55 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 23:41:56,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2024-10-13 23:41:56,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 1605. [2024-10-13 23:41:56,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1605 states, 1604 states have (on average 1.1577306733167083) internal successors, (1857), 1604 states have internal predecessors, (1857), 0 states have call successors, (0), 0 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-13 23:41:56,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 1857 transitions. [2024-10-13 23:41:56,280 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 1857 transitions. Word has length 236 [2024-10-13 23:41:56,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:41:56,281 INFO L471 AbstractCegarLoop]: Abstraction has 1605 states and 1857 transitions. [2024-10-13 23:41:56,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 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-13 23:41:56,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 1857 transitions. [2024-10-13 23:41:56,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2024-10-13 23:41:56,283 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:41:56,284 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, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:41:56,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 23:41:56,284 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:41:56,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:41:56,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1280364761, now seen corresponding path program 1 times [2024-10-13 23:41:56,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:41:56,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244600125] [2024-10-13 23:41:56,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:41:56,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:41:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:41:56,678 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 237 proven. 130 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-13 23:41:56,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:41:56,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244600125] [2024-10-13 23:41:56,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244600125] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:41:56,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411820614] [2024-10-13 23:41:56,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:41:56,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:41:56,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:41:56,680 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:41:56,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 23:41:56,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:41:56,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:41:56,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:41:57,058 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2024-10-13 23:41:57,058 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:41:57,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411820614] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:41:57,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:41:57,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-13 23:41:57,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032638558] [2024-10-13 23:41:57,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:41:57,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:41:57,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:41:57,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:41:57,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:41:57,062 INFO L87 Difference]: Start difference. First operand 1605 states and 1857 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 states have internal predecessors, (171), 0 states have call successors, (0), 0 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-13 23:41:57,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:41:57,488 INFO L93 Difference]: Finished difference Result 3565 states and 4203 transitions. [2024-10-13 23:41:57,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:41:57,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 states have internal predecessors, (171), 0 states have call successors, (0), 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 355 [2024-10-13 23:41:57,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:41:57,493 INFO L225 Difference]: With dead ends: 3565 [2024-10-13 23:41:57,493 INFO L226 Difference]: Without dead ends: 2139 [2024-10-13 23:41:57,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:41:57,495 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 82 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:41:57,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 45 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 23:41:57,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2024-10-13 23:41:57,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 1961. [2024-10-13 23:41:57,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1961 states, 1960 states have (on average 1.1331632653061225) internal successors, (2221), 1960 states have internal predecessors, (2221), 0 states have call successors, (0), 0 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-13 23:41:57,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1961 states to 1961 states and 2221 transitions. [2024-10-13 23:41:57,520 INFO L78 Accepts]: Start accepts. Automaton has 1961 states and 2221 transitions. Word has length 355 [2024-10-13 23:41:57,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:41:57,522 INFO L471 AbstractCegarLoop]: Abstraction has 1961 states and 2221 transitions. [2024-10-13 23:41:57,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 states have internal predecessors, (171), 0 states have call successors, (0), 0 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-13 23:41:57,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1961 states and 2221 transitions. [2024-10-13 23:41:57,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2024-10-13 23:41:57,526 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:41:57,526 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, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:41:57,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 23:41:57,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:41:57,731 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:41:57,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:41:57,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1717208836, now seen corresponding path program 1 times [2024-10-13 23:41:57,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:41:57,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864581996] [2024-10-13 23:41:57,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:41:57,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:41:57,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:41:58,002 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 447 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2024-10-13 23:41:58,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:41:58,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864581996] [2024-10-13 23:41:58,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864581996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:41:58,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:41:58,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:41:58,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360882656] [2024-10-13 23:41:58,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:41:58,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:41:58,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:41:58,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:41:58,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:41:58,006 INFO L87 Difference]: Start difference. First operand 1961 states and 2221 transitions. Second operand has 4 states, 4 states have (on average 54.75) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 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-13 23:41:58,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:41:58,438 INFO L93 Difference]: Finished difference Result 3950 states and 4493 transitions. [2024-10-13 23:41:58,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:41:58,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 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 432 [2024-10-13 23:41:58,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:41:58,444 INFO L225 Difference]: With dead ends: 3950 [2024-10-13 23:41:58,444 INFO L226 Difference]: Without dead ends: 2139 [2024-10-13 23:41:58,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:41:58,446 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 141 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:41:58,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 14 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 23:41:58,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2024-10-13 23:41:58,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 1961. [2024-10-13 23:41:58,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1961 states, 1960 states have (on average 1.0841836734693877) internal successors, (2125), 1960 states have internal predecessors, (2125), 0 states have call successors, (0), 0 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-13 23:41:58,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1961 states to 1961 states and 2125 transitions. [2024-10-13 23:41:58,468 INFO L78 Accepts]: Start accepts. Automaton has 1961 states and 2125 transitions. Word has length 432 [2024-10-13 23:41:58,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:41:58,469 INFO L471 AbstractCegarLoop]: Abstraction has 1961 states and 2125 transitions. [2024-10-13 23:41:58,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 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-13 23:41:58,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1961 states and 2125 transitions. [2024-10-13 23:41:58,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2024-10-13 23:41:58,473 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:41:58,473 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, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:41:58,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 23:41:58,473 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:41:58,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:41:58,474 INFO L85 PathProgramCache]: Analyzing trace with hash 34146291, now seen corresponding path program 1 times [2024-10-13 23:41:58,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:41:58,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115006614] [2024-10-13 23:41:58,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:41:58,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:41:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:41:58,746 INFO L134 CoverageAnalysis]: Checked inductivity of 763 backedges. 449 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-13 23:41:58,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:41:58,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115006614] [2024-10-13 23:41:58,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115006614] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:41:58,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:41:58,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:41:58,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015925537] [2024-10-13 23:41:58,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:41:58,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:41:58,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:41:58,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:41:58,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:41:58,747 INFO L87 Difference]: Start difference. First operand 1961 states and 2125 transitions. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 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-13 23:41:59,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:41:59,105 INFO L93 Difference]: Finished difference Result 4455 states and 4893 transitions. [2024-10-13 23:41:59,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:41:59,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 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 455 [2024-10-13 23:41:59,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:41:59,111 INFO L225 Difference]: With dead ends: 4455 [2024-10-13 23:41:59,111 INFO L226 Difference]: Without dead ends: 2673 [2024-10-13 23:41:59,113 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-13 23:41:59,115 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 113 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:41:59,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 199 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 23:41:59,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2673 states. [2024-10-13 23:41:59,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2673 to 2673. [2024-10-13 23:41:59,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2673 states, 2672 states have (on average 1.0879491017964071) internal successors, (2907), 2672 states have internal predecessors, (2907), 0 states have call successors, (0), 0 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-13 23:41:59,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2673 states to 2673 states and 2907 transitions. [2024-10-13 23:41:59,154 INFO L78 Accepts]: Start accepts. Automaton has 2673 states and 2907 transitions. Word has length 455 [2024-10-13 23:41:59,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:41:59,155 INFO L471 AbstractCegarLoop]: Abstraction has 2673 states and 2907 transitions. [2024-10-13 23:41:59,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 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-13 23:41:59,155 INFO L276 IsEmpty]: Start isEmpty. Operand 2673 states and 2907 transitions. [2024-10-13 23:41:59,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2024-10-13 23:41:59,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:41:59,160 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, 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, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:41:59,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 23:41:59,160 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:41:59,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:41:59,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1317589246, now seen corresponding path program 1 times [2024-10-13 23:41:59,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:41:59,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608133513] [2024-10-13 23:41:59,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:41:59,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:41:59,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:41:59,351 INFO L134 CoverageAnalysis]: Checked inductivity of 877 backedges. 563 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-13 23:41:59,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:41:59,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608133513] [2024-10-13 23:41:59,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608133513] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:41:59,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:41:59,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:41:59,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90108886] [2024-10-13 23:41:59,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:41:59,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:41:59,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:41:59,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:41:59,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:41:59,353 INFO L87 Difference]: Start difference. First operand 2673 states and 2907 transitions. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 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-13 23:41:59,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:41:59,707 INFO L93 Difference]: Finished difference Result 6235 states and 6877 transitions. [2024-10-13 23:41:59,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:41:59,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 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 496 [2024-10-13 23:41:59,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:41:59,715 INFO L225 Difference]: With dead ends: 6235 [2024-10-13 23:41:59,715 INFO L226 Difference]: Without dead ends: 3741 [2024-10-13 23:41:59,716 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-13 23:41:59,717 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 73 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:41:59,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 48 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 23:41:59,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3741 states. [2024-10-13 23:41:59,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3741 to 3741. [2024-10-13 23:41:59,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3741 states, 3740 states have (on average 1.0834224598930482) internal successors, (4052), 3740 states have internal predecessors, (4052), 0 states have call successors, (0), 0 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-13 23:41:59,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3741 states to 3741 states and 4052 transitions. [2024-10-13 23:41:59,750 INFO L78 Accepts]: Start accepts. Automaton has 3741 states and 4052 transitions. Word has length 496 [2024-10-13 23:41:59,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:41:59,750 INFO L471 AbstractCegarLoop]: Abstraction has 3741 states and 4052 transitions. [2024-10-13 23:41:59,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 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-13 23:41:59,750 INFO L276 IsEmpty]: Start isEmpty. Operand 3741 states and 4052 transitions. [2024-10-13 23:41:59,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2024-10-13 23:41:59,753 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:41:59,753 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, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:41:59,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 23:41:59,753 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:41:59,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:41:59,753 INFO L85 PathProgramCache]: Analyzing trace with hash -412682064, now seen corresponding path program 1 times [2024-10-13 23:41:59,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:41:59,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302837651] [2024-10-13 23:41:59,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:41:59,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:41:59,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:00,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1123 backedges. 740 proven. 0 refuted. 0 times theorem prover too weak. 383 trivial. 0 not checked. [2024-10-13 23:42:00,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:00,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302837651] [2024-10-13 23:42:00,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302837651] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:00,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:42:00,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:42:00,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963649906] [2024-10-13 23:42:00,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:00,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:42:00,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:00,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:42:00,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:42:00,045 INFO L87 Difference]: Start difference. First operand 3741 states and 4052 transitions. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 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-13 23:42:00,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:00,375 INFO L93 Difference]: Finished difference Result 7303 states and 7924 transitions. [2024-10-13 23:42:00,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:42:00,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 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 532 [2024-10-13 23:42:00,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:00,383 INFO L225 Difference]: With dead ends: 7303 [2024-10-13 23:42:00,383 INFO L226 Difference]: Without dead ends: 3741 [2024-10-13 23:42:00,386 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-13 23:42:00,386 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 103 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:00,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 239 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 23:42:00,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3741 states. [2024-10-13 23:42:00,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3741 to 3207. [2024-10-13 23:42:00,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3207 states, 3206 states have (on average 1.0792264504054898) internal successors, (3460), 3206 states have internal predecessors, (3460), 0 states have call successors, (0), 0 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-13 23:42:00,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3207 states to 3207 states and 3460 transitions. [2024-10-13 23:42:00,419 INFO L78 Accepts]: Start accepts. Automaton has 3207 states and 3460 transitions. Word has length 532 [2024-10-13 23:42:00,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:00,420 INFO L471 AbstractCegarLoop]: Abstraction has 3207 states and 3460 transitions. [2024-10-13 23:42:00,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 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-13 23:42:00,420 INFO L276 IsEmpty]: Start isEmpty. Operand 3207 states and 3460 transitions. [2024-10-13 23:42:00,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2024-10-13 23:42:00,423 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:00,424 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, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:42:00,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 23:42:00,425 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:00,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:00,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1006736584, now seen corresponding path program 1 times [2024-10-13 23:42:00,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:00,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90324495] [2024-10-13 23:42:00,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:00,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:00,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:00,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1371 backedges. 947 proven. 110 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-13 23:42:00,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:00,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90324495] [2024-10-13 23:42:00,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90324495] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:42:00,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838465254] [2024-10-13 23:42:00,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:00,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:42:00,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:42:00,814 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:42:00,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 23:42:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:00,959 INFO L255 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:42:00,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:42:01,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1371 backedges. 304 proven. 0 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2024-10-13 23:42:01,046 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:42:01,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838465254] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:01,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:42:01,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-13 23:42:01,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821046828] [2024-10-13 23:42:01,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:01,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:42:01,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:01,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:42:01,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:42:01,049 INFO L87 Difference]: Start difference. First operand 3207 states and 3460 transitions. Second operand has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 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-13 23:42:01,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:01,435 INFO L93 Difference]: Finished difference Result 7303 states and 7919 transitions. [2024-10-13 23:42:01,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:42:01,435 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 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 651 [2024-10-13 23:42:01,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:01,445 INFO L225 Difference]: With dead ends: 7303 [2024-10-13 23:42:01,445 INFO L226 Difference]: Without dead ends: 4275 [2024-10-13 23:42:01,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 654 GetRequests, 651 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:42:01,449 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 118 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:01,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 234 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 23:42:01,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4275 states. [2024-10-13 23:42:01,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4275 to 4097. [2024-10-13 23:42:01,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4097 states, 4096 states have (on average 1.072265625) internal successors, (4392), 4096 states have internal predecessors, (4392), 0 states have call successors, (0), 0 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-13 23:42:01,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4097 states to 4097 states and 4392 transitions. [2024-10-13 23:42:01,513 INFO L78 Accepts]: Start accepts. Automaton has 4097 states and 4392 transitions. Word has length 651 [2024-10-13 23:42:01,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:01,514 INFO L471 AbstractCegarLoop]: Abstraction has 4097 states and 4392 transitions. [2024-10-13 23:42:01,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 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-13 23:42:01,514 INFO L276 IsEmpty]: Start isEmpty. Operand 4097 states and 4392 transitions. [2024-10-13 23:42:01,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 731 [2024-10-13 23:42:01,518 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:01,518 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:42:01,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 23:42:01,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:42:01,719 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:01,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:01,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1660468920, now seen corresponding path program 1 times [2024-10-13 23:42:01,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:01,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618874953] [2024-10-13 23:42:01,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:01,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:01,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:02,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1826 backedges. 1341 proven. 110 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2024-10-13 23:42:02,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:02,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618874953] [2024-10-13 23:42:02,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618874953] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:42:02,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707819246] [2024-10-13 23:42:02,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:02,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:42:02,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:42:02,063 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:42:02,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-13 23:42:02,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:02,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 909 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:42:02,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:42:02,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1826 backedges. 365 proven. 0 refuted. 0 times theorem prover too weak. 1461 trivial. 0 not checked. [2024-10-13 23:42:02,279 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:42:02,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707819246] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:02,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:42:02,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-13 23:42:02,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657359336] [2024-10-13 23:42:02,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:02,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:42:02,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:02,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:42:02,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:42:02,281 INFO L87 Difference]: Start difference. First operand 4097 states and 4392 transitions. Second operand has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 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-13 23:42:02,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:02,592 INFO L93 Difference]: Finished difference Result 4989 states and 5331 transitions. [2024-10-13 23:42:02,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:42:02,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 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 730 [2024-10-13 23:42:02,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:02,602 INFO L225 Difference]: With dead ends: 4989 [2024-10-13 23:42:02,602 INFO L226 Difference]: Without dead ends: 4987 [2024-10-13 23:42:02,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 733 GetRequests, 730 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:42:02,603 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 138 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:02,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 19 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 23:42:02,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4987 states. [2024-10-13 23:42:02,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4987 to 4097. [2024-10-13 23:42:02,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4097 states, 4096 states have (on average 1.072021484375) internal successors, (4391), 4096 states have internal predecessors, (4391), 0 states have call successors, (0), 0 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-13 23:42:02,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4097 states to 4097 states and 4391 transitions. [2024-10-13 23:42:02,635 INFO L78 Accepts]: Start accepts. Automaton has 4097 states and 4391 transitions. Word has length 730 [2024-10-13 23:42:02,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:02,636 INFO L471 AbstractCegarLoop]: Abstraction has 4097 states and 4391 transitions. [2024-10-13 23:42:02,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 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-13 23:42:02,636 INFO L276 IsEmpty]: Start isEmpty. Operand 4097 states and 4391 transitions. [2024-10-13 23:42:02,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 812 [2024-10-13 23:42:02,641 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:02,641 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:42:02,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-13 23:42:02,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-13 23:42:02,842 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:02,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:02,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1117605278, now seen corresponding path program 1 times [2024-10-13 23:42:02,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:02,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220800714] [2024-10-13 23:42:02,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:02,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:03,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1954 backedges. 1424 proven. 155 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2024-10-13 23:42:03,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:03,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220800714] [2024-10-13 23:42:03,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220800714] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:42:03,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127606616] [2024-10-13 23:42:03,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:03,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:42:03,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:42:03,216 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:42:03,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-13 23:42:03,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:03,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 992 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:42:03,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:42:03,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1954 backedges. 365 proven. 0 refuted. 0 times theorem prover too weak. 1589 trivial. 0 not checked. [2024-10-13 23:42:03,455 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:42:03,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127606616] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:03,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:42:03,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-13 23:42:03,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249333302] [2024-10-13 23:42:03,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:03,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:42:03,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:03,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:42:03,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:42:03,457 INFO L87 Difference]: Start difference. First operand 4097 states and 4391 transitions. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 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-13 23:42:03,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:03,772 INFO L93 Difference]: Finished difference Result 8371 states and 9039 transitions. [2024-10-13 23:42:03,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:42:03,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 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 811 [2024-10-13 23:42:03,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:03,779 INFO L225 Difference]: With dead ends: 8371 [2024-10-13 23:42:03,779 INFO L226 Difference]: Without dead ends: 4453 [2024-10-13 23:42:03,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 814 GetRequests, 811 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:42:03,782 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 118 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:03,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 236 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 23:42:03,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4453 states. [2024-10-13 23:42:03,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4453 to 4097. [2024-10-13 23:42:03,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4097 states, 4096 states have (on average 1.07275390625) internal successors, (4394), 4096 states have internal predecessors, (4394), 0 states have call successors, (0), 0 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-13 23:42:03,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4097 states to 4097 states and 4394 transitions. [2024-10-13 23:42:03,812 INFO L78 Accepts]: Start accepts. Automaton has 4097 states and 4394 transitions. Word has length 811 [2024-10-13 23:42:03,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:03,813 INFO L471 AbstractCegarLoop]: Abstraction has 4097 states and 4394 transitions. [2024-10-13 23:42:03,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 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-13 23:42:03,813 INFO L276 IsEmpty]: Start isEmpty. Operand 4097 states and 4394 transitions. [2024-10-13 23:42:03,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 842 [2024-10-13 23:42:03,818 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:03,819 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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, 1, 1, 1, 1, 1, 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-13 23:42:03,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-13 23:42:04,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-13 23:42:04,020 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:04,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:04,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1716417933, now seen corresponding path program 1 times [2024-10-13 23:42:04,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:04,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617866679] [2024-10-13 23:42:04,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:04,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:04,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:04,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2053 backedges. 1523 proven. 155 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2024-10-13 23:42:04,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:04,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617866679] [2024-10-13 23:42:04,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617866679] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:42:04,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207182902] [2024-10-13 23:42:04,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:04,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:42:04,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:42:04,428 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:42:04,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-13 23:42:04,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:04,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 1023 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:42:04,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:42:04,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2053 backedges. 365 proven. 0 refuted. 0 times theorem prover too weak. 1688 trivial. 0 not checked. [2024-10-13 23:42:04,673 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:42:04,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207182902] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:04,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:42:04,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-13 23:42:04,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501280719] [2024-10-13 23:42:04,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:04,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:42:04,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:04,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:42:04,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:42:04,675 INFO L87 Difference]: Start difference. First operand 4097 states and 4394 transitions. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 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-13 23:42:04,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:04,993 INFO L93 Difference]: Finished difference Result 8903 states and 9551 transitions. [2024-10-13 23:42:04,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:42:04,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 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 841 [2024-10-13 23:42:04,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:04,995 INFO L225 Difference]: With dead ends: 8903 [2024-10-13 23:42:04,995 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 23:42:04,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 844 GetRequests, 841 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:42:05,000 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 118 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:05,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 239 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 23:42:05,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 23:42:05,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 23:42:05,001 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-13 23:42:05,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 23:42:05,001 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 841 [2024-10-13 23:42:05,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:05,001 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 23:42:05,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 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-13 23:42:05,002 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 23:42:05,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 23:42:05,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 23:42:05,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-13 23:42:05,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:42:05,208 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:42:05,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 23:42:05,533 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 23:42:05,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 11:42:05 BoogieIcfgContainer [2024-10-13 23:42:05,545 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 23:42:05,545 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 23:42:05,545 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 23:42:05,545 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 23:42:05,546 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:41:50" (3/4) ... [2024-10-13 23:42:05,547 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 23:42:05,558 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-13 23:42:05,559 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-13 23:42:05,560 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 23:42:05,560 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 23:42:05,691 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 23:42:05,692 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 23:42:05,695 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 23:42:05,696 INFO L158 Benchmark]: Toolchain (without parser) took 17005.16ms. Allocated memory was 163.6MB in the beginning and 578.8MB in the end (delta: 415.2MB). Free memory was 104.9MB in the beginning and 323.7MB in the end (delta: -218.9MB). Peak memory consumption was 198.9MB. Max. memory is 16.1GB. [2024-10-13 23:42:05,696 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 163.6MB. Free memory was 127.1MB in the beginning and 127.0MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 23:42:05,696 INFO L158 Benchmark]: CACSL2BoogieTranslator took 423.33ms. Allocated memory is still 163.6MB. Free memory was 104.9MB in the beginning and 70.8MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-13 23:42:05,696 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.19ms. Allocated memory is still 163.6MB. Free memory was 70.8MB in the beginning and 61.1MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 23:42:05,696 INFO L158 Benchmark]: Boogie Preprocessor took 83.48ms. Allocated memory is still 163.6MB. Free memory was 61.1MB in the beginning and 48.4MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 23:42:05,697 INFO L158 Benchmark]: RCFGBuilder took 1015.35ms. Allocated memory was 163.6MB in the beginning and 230.7MB in the end (delta: 67.1MB). Free memory was 47.7MB in the beginning and 149.9MB in the end (delta: -102.1MB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. [2024-10-13 23:42:05,697 INFO L158 Benchmark]: TraceAbstraction took 15245.84ms. Allocated memory was 230.7MB in the beginning and 578.8MB in the end (delta: 348.1MB). Free memory was 148.8MB in the beginning and 338.4MB in the end (delta: -189.6MB). Peak memory consumption was 159.6MB. Max. memory is 16.1GB. [2024-10-13 23:42:05,697 INFO L158 Benchmark]: Witness Printer took 150.06ms. Allocated memory is still 578.8MB. Free memory was 338.4MB in the beginning and 323.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 23:42:05,698 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.13ms. Allocated memory is still 163.6MB. Free memory was 127.1MB in the beginning and 127.0MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 423.33ms. Allocated memory is still 163.6MB. Free memory was 104.9MB in the beginning and 70.8MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.19ms. Allocated memory is still 163.6MB. Free memory was 70.8MB in the beginning and 61.1MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.48ms. Allocated memory is still 163.6MB. Free memory was 61.1MB in the beginning and 48.4MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1015.35ms. Allocated memory was 163.6MB in the beginning and 230.7MB in the end (delta: 67.1MB). Free memory was 47.7MB in the beginning and 149.9MB in the end (delta: -102.1MB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. * TraceAbstraction took 15245.84ms. Allocated memory was 230.7MB in the beginning and 578.8MB in the end (delta: 348.1MB). Free memory was 148.8MB in the beginning and 338.4MB in the end (delta: -189.6MB). Peak memory consumption was 159.6MB. Max. memory is 16.1GB. * Witness Printer took 150.06ms. Allocated memory is still 578.8MB. Free memory was 338.4MB in the beginning and 323.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 203]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 183 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.8s, OverallIterations: 16, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1995 SdHoareTripleChecker+Valid, 6.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1995 mSDsluCounter, 2062 SdHoareTripleChecker+Invalid, 5.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 67 mSDsCounter, 921 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7663 IncrementalHoareTripleChecker+Invalid, 8584 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 921 mSolverCounterUnsat, 1995 mSDtfsCounter, 7663 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3834 GetRequests, 3799 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4097occurred in iteration=13, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 3026 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 10213 NumberOfCodeBlocks, 10213 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 10190 ConstructedInterpolants, 0 QuantifiedInterpolants, 23164 SizeOfPredicates, 0 NumberOfNonLiveVariables, 4772 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 23 InterpolantComputations, 16 PerfectInterpolantSequences, 18976/19751 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 890]: Loop Invariant Derived loop invariant: (((((((((6 <= a15) && (((long long) a12 + 43) <= 0)) && (a15 <= 8)) || ((a24 == 1) && (12 <= a12))) || (((a24 == 1) && (10 <= a21)) && (0 <= ((long long) a12 + 42)))) || ((6 <= a15) && (a24 == 1))) || ((a24 == 1) && (((long long) 49 + a12) <= 0))) || ((a24 == 1) && (a21 <= 6))) || (((((long long) a12 + 43) <= 0) && (a15 <= 8)) && (a21 <= 6))) RESULT: Ultimate proved your program to be correct! [2024-10-13 23:42:05,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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