./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i --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/bitvector/interleave_bits.i -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 41cbcdfa6f09b615c08bb2dbf908be5e0a68dc8c6a10c0ba76a3c4e4c07e69fb --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-13 22:38:10,377 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 22:38:10,429 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 22:38:10,432 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 22:38:10,432 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 22:38:10,455 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 22:38:10,456 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 22:38:10,456 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 22:38:10,457 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 22:38:10,458 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 22:38:10,458 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 22:38:10,458 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 22:38:10,459 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 22:38:10,459 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 22:38:10,459 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 22:38:10,461 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 22:38:10,462 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 22:38:10,462 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 22:38:10,462 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 22:38:10,462 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 22:38:10,462 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 22:38:10,463 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 22:38:10,463 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 22:38:10,463 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 22:38:10,464 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 22:38:10,464 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 22:38:10,464 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 22:38:10,464 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 22:38:10,464 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 22:38:10,465 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 22:38:10,465 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 22:38:10,465 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 22:38:10,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 22:38:10,466 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 22:38:10,466 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 22:38:10,466 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 22:38:10,466 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 22:38:10,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 22:38:10,466 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 22:38:10,467 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 22:38:10,467 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 22:38:10,468 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 22:38:10,468 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 -> 41cbcdfa6f09b615c08bb2dbf908be5e0a68dc8c6a10c0ba76a3c4e4c07e69fb [2024-10-13 22:38:10,643 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 22:38:10,667 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 22:38:10,670 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 22:38:10,670 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 22:38:10,671 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 22:38:10,672 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i [2024-10-13 22:38:11,872 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 22:38:12,015 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 22:38:12,016 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i [2024-10-13 22:38:12,021 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d42574e5/16301a25528f4673aa6336ff1fc5bd47/FLAGf2c52f227 [2024-10-13 22:38:12,036 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d42574e5/16301a25528f4673aa6336ff1fc5bd47 [2024-10-13 22:38:12,038 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 22:38:12,038 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 22:38:12,039 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 22:38:12,039 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 22:38:12,044 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 22:38:12,044 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:38:12" (1/1) ... [2024-10-13 22:38:12,046 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5df93566 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:38:12, skipping insertion in model container [2024-10-13 22:38:12,046 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:38:12" (1/1) ... [2024-10-13 22:38:12,064 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 22:38:12,201 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/bitvector/interleave_bits.i[1175,1188] [2024-10-13 22:38:12,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 22:38:12,231 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 22:38:12,248 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/bitvector/interleave_bits.i[1175,1188] [2024-10-13 22:38:12,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 22:38:12,267 INFO L204 MainTranslator]: Completed translation [2024-10-13 22:38:12,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:38:12 WrapperNode [2024-10-13 22:38:12,267 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 22:38:12,268 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 22:38:12,268 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 22:38:12,268 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 22:38:12,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:38:12" (1/1) ... [2024-10-13 22:38:12,279 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:38:12" (1/1) ... [2024-10-13 22:38:12,305 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 235 [2024-10-13 22:38:12,305 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 22:38:12,306 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 22:38:12,306 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 22:38:12,306 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 22:38:12,321 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:38:12" (1/1) ... [2024-10-13 22:38:12,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:38:12" (1/1) ... [2024-10-13 22:38:12,323 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:38:12" (1/1) ... [2024-10-13 22:38:12,338 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 22:38:12,339 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:38:12" (1/1) ... [2024-10-13 22:38:12,339 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:38:12" (1/1) ... [2024-10-13 22:38:12,343 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:38:12" (1/1) ... [2024-10-13 22:38:12,345 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:38:12" (1/1) ... [2024-10-13 22:38:12,346 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:38:12" (1/1) ... [2024-10-13 22:38:12,347 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:38:12" (1/1) ... [2024-10-13 22:38:12,350 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 22:38:12,351 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 22:38:12,354 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 22:38:12,354 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 22:38:12,355 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:38:12" (1/1) ... [2024-10-13 22:38:12,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 22:38:12,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:38:12,384 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 22:38:12,386 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 22:38:12,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 22:38:12,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 22:38:12,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 22:38:12,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 22:38:12,476 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 22:38:12,478 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 22:38:13,755 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2024-10-13 22:38:13,755 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 22:38:13,778 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 22:38:13,779 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 22:38:13,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:38:13 BoogieIcfgContainer [2024-10-13 22:38:13,780 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 22:38:13,781 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 22:38:13,782 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 22:38:13,784 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 22:38:13,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:38:12" (1/3) ... [2024-10-13 22:38:13,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63de0a9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:38:13, skipping insertion in model container [2024-10-13 22:38:13,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:38:12" (2/3) ... [2024-10-13 22:38:13,786 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63de0a9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:38:13, skipping insertion in model container [2024-10-13 22:38:13,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:38:13" (3/3) ... [2024-10-13 22:38:13,787 INFO L112 eAbstractionObserver]: Analyzing ICFG interleave_bits.i [2024-10-13 22:38:13,799 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 22:38:13,800 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 22:38:13,839 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 22:38:13,844 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;@2f25edc8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 22:38:13,844 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 22:38:13,847 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 87 states have (on average 1.5747126436781609) internal successors, (137), 88 states have internal predecessors, (137), 0 states have call successors, (0), 0 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 22:38:13,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-13 22:38:13,853 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:38:13,855 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] [2024-10-13 22:38:13,855 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:38:13,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:38:13,859 INFO L85 PathProgramCache]: Analyzing trace with hash 514750692, now seen corresponding path program 1 times [2024-10-13 22:38:13,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:38:13,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332494448] [2024-10-13 22:38:13,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:38:13,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:38:13,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:38:14,185 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 22:38:14,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:38:14,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332494448] [2024-10-13 22:38:14,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332494448] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:38:14,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:38:14,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 22:38:14,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622624459] [2024-10-13 22:38:14,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:38:14,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:38:14,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:38:14,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:38:14,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:38:14,212 INFO L87 Difference]: Start difference. First operand has 89 states, 87 states have (on average 1.5747126436781609) internal successors, (137), 88 states have internal predecessors, (137), 0 states have call successors, (0), 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 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 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 22:38:14,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:38:14,310 INFO L93 Difference]: Finished difference Result 196 states and 306 transitions. [2024-10-13 22:38:14,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:38:14,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2024-10-13 22:38:14,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:38:14,317 INFO L225 Difference]: With dead ends: 196 [2024-10-13 22:38:14,318 INFO L226 Difference]: Without dead ends: 106 [2024-10-13 22:38:14,319 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 22:38:14,322 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 27 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:38:14,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 248 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:38:14,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-13 22:38:14,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 94. [2024-10-13 22:38:14,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.5268817204301075) internal successors, (142), 93 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:38:14,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 142 transitions. [2024-10-13 22:38:14,348 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 142 transitions. Word has length 31 [2024-10-13 22:38:14,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:38:14,348 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 142 transitions. [2024-10-13 22:38:14,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 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 22:38:14,349 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 142 transitions. [2024-10-13 22:38:14,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-13 22:38:14,350 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:38:14,350 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:38:14,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 22:38:14,350 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:38:14,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:38:14,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1247634837, now seen corresponding path program 1 times [2024-10-13 22:38:14,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:38:14,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999647670] [2024-10-13 22:38:14,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:38:14,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:38:14,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:38:14,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:38:14,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:38:14,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999647670] [2024-10-13 22:38:14,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999647670] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:38:14,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408286386] [2024-10-13 22:38:14,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:38:14,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:38:14,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:38:14,488 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 22:38:14,489 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 22:38:14,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:38:14,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 22:38:14,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:38:14,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:38:14,609 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:38:14,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:38:14,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408286386] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 22:38:14,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 22:38:14,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-13 22:38:14,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666475003] [2024-10-13 22:38:14,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 22:38:14,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 22:38:14,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:38:14,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 22:38:14,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-10-13 22:38:14,664 INFO L87 Difference]: Start difference. First operand 94 states and 142 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:38:14,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:38:14,759 INFO L93 Difference]: Finished difference Result 237 states and 365 transitions. [2024-10-13 22:38:14,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 22:38:14,759 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-10-13 22:38:14,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:38:14,760 INFO L225 Difference]: With dead ends: 237 [2024-10-13 22:38:14,760 INFO L226 Difference]: Without dead ends: 151 [2024-10-13 22:38:14,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2024-10-13 22:38:14,761 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 188 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:38:14,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 527 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:38:14,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-13 22:38:14,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2024-10-13 22:38:14,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 1.52) internal successors, (228), 150 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:38:14,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 228 transitions. [2024-10-13 22:38:14,775 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 228 transitions. Word has length 41 [2024-10-13 22:38:14,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:38:14,776 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 228 transitions. [2024-10-13 22:38:14,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:38:14,776 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 228 transitions. [2024-10-13 22:38:14,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-13 22:38:14,777 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:38:14,778 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:38:14,790 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 22:38:14,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:38:14,979 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:38:14,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:38:14,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1906156544, now seen corresponding path program 1 times [2024-10-13 22:38:14,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:38:14,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192742877] [2024-10-13 22:38:14,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:38:14,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:38:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:38:15,221 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 43 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 22:38:15,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:38:15,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192742877] [2024-10-13 22:38:15,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192742877] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:38:15,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661812193] [2024-10-13 22:38:15,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:38:15,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:38:15,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:38:15,226 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 22:38:15,229 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 22:38:15,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:38:15,313 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 22:38:15,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:38:15,360 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 43 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 22:38:15,361 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:38:15,440 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 43 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 22:38:15,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661812193] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 22:38:15,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 22:38:15,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-10-13 22:38:15,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683441353] [2024-10-13 22:38:15,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 22:38:15,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 22:38:15,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:38:15,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 22:38:15,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-13 22:38:15,444 INFO L87 Difference]: Start difference. First operand 151 states and 228 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 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 22:38:15,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:38:15,545 INFO L93 Difference]: Finished difference Result 257 states and 391 transitions. [2024-10-13 22:38:15,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 22:38:15,546 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 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 75 [2024-10-13 22:38:15,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:38:15,548 INFO L225 Difference]: With dead ends: 257 [2024-10-13 22:38:15,548 INFO L226 Difference]: Without dead ends: 151 [2024-10-13 22:38:15,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-13 22:38:15,550 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 352 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:38:15,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 598 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:38:15,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-13 22:38:15,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2024-10-13 22:38:15,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 1.4933333333333334) internal successors, (224), 150 states have internal predecessors, (224), 0 states have call successors, (0), 0 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 22:38:15,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 224 transitions. [2024-10-13 22:38:15,563 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 224 transitions. Word has length 75 [2024-10-13 22:38:15,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:38:15,563 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 224 transitions. [2024-10-13 22:38:15,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 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 22:38:15,563 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 224 transitions. [2024-10-13 22:38:15,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-13 22:38:15,566 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:38:15,567 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:38:15,579 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 22:38:15,767 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,SelfDestructingSolverStorable2 [2024-10-13 22:38:15,767 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:38:15,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:38:15,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1139221696, now seen corresponding path program 2 times [2024-10-13 22:38:15,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:38:15,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975132255] [2024-10-13 22:38:15,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:38:15,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:38:15,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:38:15,990 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:38:15,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:38:15,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975132255] [2024-10-13 22:38:15,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975132255] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:38:15,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621867460] [2024-10-13 22:38:15,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 22:38:15,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:38:15,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:38:15,995 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 22:38:15,996 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 22:38:16,058 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 22:38:16,059 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 22:38:16,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 22:38:16,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:38:16,128 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:38:16,128 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:38:16,262 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:38:16,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621867460] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 22:38:16,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 22:38:16,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-13 22:38:16,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480499646] [2024-10-13 22:38:16,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 22:38:16,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 22:38:16,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:38:16,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 22:38:16,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2024-10-13 22:38:16,265 INFO L87 Difference]: Start difference. First operand 151 states and 224 transitions. Second operand has 13 states, 13 states have (on average 9.76923076923077) internal successors, (127), 12 states have internal predecessors, (127), 0 states have call successors, (0), 0 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 22:38:16,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:38:16,516 INFO L93 Difference]: Finished difference Result 347 states and 519 transitions. [2024-10-13 22:38:16,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 22:38:16,517 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.76923076923077) internal successors, (127), 12 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-13 22:38:16,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:38:16,518 INFO L225 Difference]: With dead ends: 347 [2024-10-13 22:38:16,518 INFO L226 Difference]: Without dead ends: 283 [2024-10-13 22:38:16,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2024-10-13 22:38:16,519 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 757 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 757 SdHoareTripleChecker+Valid, 1288 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:38:16,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [757 Valid, 1288 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:38:16,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-10-13 22:38:16,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2024-10-13 22:38:16,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 282 states have (on average 1.475177304964539) internal successors, (416), 282 states have internal predecessors, (416), 0 states have call successors, (0), 0 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 22:38:16,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 416 transitions. [2024-10-13 22:38:16,535 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 416 transitions. Word has length 77 [2024-10-13 22:38:16,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:38:16,535 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 416 transitions. [2024-10-13 22:38:16,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.76923076923077) internal successors, (127), 12 states have internal predecessors, (127), 0 states have call successors, (0), 0 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 22:38:16,536 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 416 transitions. [2024-10-13 22:38:16,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-13 22:38:16,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:38:16,537 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:38:16,550 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 22:38:16,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:38:16,738 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:38:16,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:38:16,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1789273578, now seen corresponding path program 3 times [2024-10-13 22:38:16,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:38:16,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682266788] [2024-10-13 22:38:16,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:38:16,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:38:16,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:38:17,252 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:38:17,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:38:17,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682266788] [2024-10-13 22:38:17,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682266788] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:38:17,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913720827] [2024-10-13 22:38:17,254 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 22:38:17,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:38:17,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:38:17,255 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 22:38:17,256 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 22:38:17,323 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-13 22:38:17,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 22:38:17,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-13 22:38:17,328 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:38:17,497 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2024-10-13 22:38:17,497 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:38:17,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913720827] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:38:17,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 22:38:17,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 22 [2024-10-13 22:38:17,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936922212] [2024-10-13 22:38:17,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:38:17,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 22:38:17,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:38:17,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 22:38:17,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2024-10-13 22:38:17,499 INFO L87 Difference]: Start difference. First operand 283 states and 416 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 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 22:38:17,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:38:17,670 INFO L93 Difference]: Finished difference Result 885 states and 1348 transitions. [2024-10-13 22:38:17,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 22:38:17,670 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 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 149 [2024-10-13 22:38:17,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:38:17,674 INFO L225 Difference]: With dead ends: 885 [2024-10-13 22:38:17,675 INFO L226 Difference]: Without dead ends: 612 [2024-10-13 22:38:17,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2024-10-13 22:38:17,678 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 108 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 1158 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:38:17,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 1158 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:38:17,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2024-10-13 22:38:17,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 605. [2024-10-13 22:38:17,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 604 states have (on average 1.4370860927152318) internal successors, (868), 604 states have internal predecessors, (868), 0 states have call successors, (0), 0 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 22:38:17,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 868 transitions. [2024-10-13 22:38:17,700 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 868 transitions. Word has length 149 [2024-10-13 22:38:17,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:38:17,700 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 868 transitions. [2024-10-13 22:38:17,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 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 22:38:17,701 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 868 transitions. [2024-10-13 22:38:17,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-13 22:38:17,702 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:38:17,702 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:38:17,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-13 22:38:17,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:38:17,906 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:38:17,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:38:17,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1410286928, now seen corresponding path program 1 times [2024-10-13 22:38:17,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:38:17,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424758106] [2024-10-13 22:38:17,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:38:17,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:38:17,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:38:18,108 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 91 proven. 9 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2024-10-13 22:38:18,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:38:18,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424758106] [2024-10-13 22:38:18,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424758106] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:38:18,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230199997] [2024-10-13 22:38:18,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:38:18,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:38:18,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:38:18,111 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 22:38:18,112 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 22:38:18,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:38:18,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 22:38:18,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:38:18,388 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 46 proven. 102 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2024-10-13 22:38:18,388 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:38:18,620 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 139 proven. 9 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2024-10-13 22:38:18,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230199997] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 22:38:18,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 22:38:18,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 11 [2024-10-13 22:38:18,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841045231] [2024-10-13 22:38:18,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 22:38:18,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 22:38:18,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:38:18,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 22:38:18,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-13 22:38:18,622 INFO L87 Difference]: Start difference. First operand 605 states and 868 transitions. Second operand has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 11 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:38:18,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:38:18,715 INFO L93 Difference]: Finished difference Result 1456 states and 2068 transitions. [2024-10-13 22:38:18,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 22:38:18,715 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 11 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2024-10-13 22:38:18,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:38:18,718 INFO L225 Difference]: With dead ends: 1456 [2024-10-13 22:38:18,718 INFO L226 Difference]: Without dead ends: 921 [2024-10-13 22:38:18,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 291 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-13 22:38:18,721 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 113 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:38:18,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 662 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:38:18,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2024-10-13 22:38:18,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 919. [2024-10-13 22:38:18,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 918 states have (on average 1.3877995642701526) internal successors, (1274), 918 states have internal predecessors, (1274), 0 states have call successors, (0), 0 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 22:38:18,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1274 transitions. [2024-10-13 22:38:18,738 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1274 transitions. Word has length 150 [2024-10-13 22:38:18,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:38:18,739 INFO L471 AbstractCegarLoop]: Abstraction has 919 states and 1274 transitions. [2024-10-13 22:38:18,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 11 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:38:18,739 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1274 transitions. [2024-10-13 22:38:18,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-13 22:38:18,742 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:38:18,742 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:38:18,755 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 22:38:18,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:38:18,944 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:38:18,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:38:18,944 INFO L85 PathProgramCache]: Analyzing trace with hash -365398478, now seen corresponding path program 1 times [2024-10-13 22:38:18,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:38:18,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974379877] [2024-10-13 22:38:18,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:38:18,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:38:18,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:38:19,338 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:38:19,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:38:19,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974379877] [2024-10-13 22:38:19,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974379877] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:38:19,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370854789] [2024-10-13 22:38:19,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:38:19,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:38:19,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:38:19,341 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 22:38:19,342 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 22:38:19,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:38:19,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 22:38:19,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:38:19,474 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2024-10-13 22:38:19,474 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:38:19,520 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2024-10-13 22:38:19,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370854789] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 22:38:19,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-13 22:38:19,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [12, 5] total 17 [2024-10-13 22:38:19,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75916624] [2024-10-13 22:38:19,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:38:19,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 22:38:19,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:38:19,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 22:38:19,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2024-10-13 22:38:19,522 INFO L87 Difference]: Start difference. First operand 919 states and 1274 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 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 22:38:20,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:38:20,342 INFO L93 Difference]: Finished difference Result 984 states and 1371 transitions. [2024-10-13 22:38:20,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 22:38:20,342 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 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 150 [2024-10-13 22:38:20,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:38:20,346 INFO L225 Difference]: With dead ends: 984 [2024-10-13 22:38:20,346 INFO L226 Difference]: Without dead ends: 975 [2024-10-13 22:38:20,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2024-10-13 22:38:20,347 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 32 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 22:38:20,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 360 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 22:38:20,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2024-10-13 22:38:20,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 975. [2024-10-13 22:38:20,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 974 states have (on average 1.3963039014373717) internal successors, (1360), 974 states have internal predecessors, (1360), 0 states have call successors, (0), 0 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 22:38:20,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1360 transitions. [2024-10-13 22:38:20,365 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1360 transitions. Word has length 150 [2024-10-13 22:38:20,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:38:20,365 INFO L471 AbstractCegarLoop]: Abstraction has 975 states and 1360 transitions. [2024-10-13 22:38:20,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 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 22:38:20,365 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1360 transitions. [2024-10-13 22:38:20,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-13 22:38:20,367 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:38:20,367 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:38:20,382 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 22:38:20,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:38:20,571 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:38:20,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:38:20,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1261696569, now seen corresponding path program 1 times [2024-10-13 22:38:20,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:38:20,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470072040] [2024-10-13 22:38:20,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:38:20,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:38:20,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:38:20,882 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:38:20,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:38:20,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470072040] [2024-10-13 22:38:20,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470072040] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:38:20,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932334437] [2024-10-13 22:38:20,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:38:20,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:38:20,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:38:20,884 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 22:38:20,885 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 22:38:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:38:20,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 22:38:20,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:38:21,009 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2024-10-13 22:38:21,009 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:38:21,059 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2024-10-13 22:38:21,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932334437] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 22:38:21,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-13 22:38:21,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12, 6] total 19 [2024-10-13 22:38:21,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328566479] [2024-10-13 22:38:21,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:38:21,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 22:38:21,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:38:21,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 22:38:21,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2024-10-13 22:38:21,061 INFO L87 Difference]: Start difference. First operand 975 states and 1360 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 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 22:38:21,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:38:21,134 INFO L93 Difference]: Finished difference Result 1016 states and 1418 transitions. [2024-10-13 22:38:21,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 22:38:21,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 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 150 [2024-10-13 22:38:21,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:38:21,137 INFO L225 Difference]: With dead ends: 1016 [2024-10-13 22:38:21,137 INFO L226 Difference]: Without dead ends: 990 [2024-10-13 22:38:21,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2024-10-13 22:38:21,138 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 1 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:38:21,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 473 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:38:21,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2024-10-13 22:38:21,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 990. [2024-10-13 22:38:21,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 989 states have (on average 1.3923154701718907) internal successors, (1377), 989 states have internal predecessors, (1377), 0 states have call successors, (0), 0 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 22:38:21,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1377 transitions. [2024-10-13 22:38:21,152 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1377 transitions. Word has length 150 [2024-10-13 22:38:21,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:38:21,153 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1377 transitions. [2024-10-13 22:38:21,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 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 22:38:21,153 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1377 transitions. [2024-10-13 22:38:21,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-13 22:38:21,154 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:38:21,154 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:38:21,167 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 22:38:21,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:38:21,355 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:38:21,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:38:21,355 INFO L85 PathProgramCache]: Analyzing trace with hash 783554901, now seen corresponding path program 1 times [2024-10-13 22:38:21,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:38:21,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066037685] [2024-10-13 22:38:21,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:38:21,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:38:21,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:38:21,567 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-10-13 22:38:21,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:38:21,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066037685] [2024-10-13 22:38:21,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066037685] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:38:21,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:38:21,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 22:38:21,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721620471] [2024-10-13 22:38:21,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:38:21,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 22:38:21,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:38:21,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 22:38:21,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 22:38:21,571 INFO L87 Difference]: Start difference. First operand 990 states and 1377 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:38:21,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:38:21,606 INFO L93 Difference]: Finished difference Result 2260 states and 3167 transitions. [2024-10-13 22:38:21,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 22:38:21,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2024-10-13 22:38:21,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:38:21,610 INFO L225 Difference]: With dead ends: 2260 [2024-10-13 22:38:21,610 INFO L226 Difference]: Without dead ends: 1295 [2024-10-13 22:38:21,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 22:38:21,611 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 7 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:38:21,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 380 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:38:21,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2024-10-13 22:38:21,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1295. [2024-10-13 22:38:21,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1295 states, 1294 states have (on average 1.3415765069551777) internal successors, (1736), 1294 states have internal predecessors, (1736), 0 states have call successors, (0), 0 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 22:38:21,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 1295 states and 1736 transitions. [2024-10-13 22:38:21,631 INFO L78 Accepts]: Start accepts. Automaton has 1295 states and 1736 transitions. Word has length 150 [2024-10-13 22:38:21,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:38:21,631 INFO L471 AbstractCegarLoop]: Abstraction has 1295 states and 1736 transitions. [2024-10-13 22:38:21,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:38:21,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1736 transitions. [2024-10-13 22:38:21,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-13 22:38:21,633 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:38:21,633 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 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] [2024-10-13 22:38:21,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 22:38:21,633 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:38:21,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:38:21,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1733582516, now seen corresponding path program 2 times [2024-10-13 22:38:21,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:38:21,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802549261] [2024-10-13 22:38:21,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:38:21,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:38:21,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:38:21,994 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 0 proven. 533 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:38:21,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:38:21,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802549261] [2024-10-13 22:38:21,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802549261] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:38:21,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860531536] [2024-10-13 22:38:21,995 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 22:38:21,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:38:21,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:38:21,996 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:38:21,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-13 22:38:22,079 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 22:38:22,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 22:38:22,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-13 22:38:22,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:38:22,495 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 44 proven. 65 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2024-10-13 22:38:22,496 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:38:23,008 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 8 proven. 101 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2024-10-13 22:38:23,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860531536] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 22:38:23,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 22:38:23,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 14] total 36 [2024-10-13 22:38:23,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214843257] [2024-10-13 22:38:23,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 22:38:23,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-10-13 22:38:23,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:38:23,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-13 22:38:23,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1192, Unknown=0, NotChecked=0, Total=1332 [2024-10-13 22:38:23,011 INFO L87 Difference]: Start difference. First operand 1295 states and 1736 transitions. Second operand has 37 states, 37 states have (on average 6.594594594594595) internal successors, (244), 36 states have internal predecessors, (244), 0 states have call successors, (0), 0 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 22:38:30,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:38:30,556 INFO L93 Difference]: Finished difference Result 4123 states and 5776 transitions. [2024-10-13 22:38:30,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 342 states. [2024-10-13 22:38:30,557 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 6.594594594594595) internal successors, (244), 36 states have internal predecessors, (244), 0 states have call successors, (0), 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 151 [2024-10-13 22:38:30,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:38:30,570 INFO L225 Difference]: With dead ends: 4123 [2024-10-13 22:38:30,570 INFO L226 Difference]: Without dead ends: 3298 [2024-10-13 22:38:30,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 633 GetRequests, 276 SyntacticMatches, 1 SemanticMatches, 356 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55039 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=7332, Invalid=120474, Unknown=0, NotChecked=0, Total=127806 [2024-10-13 22:38:30,593 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 2112 mSDsluCounter, 6493 mSDsCounter, 0 mSdLazyCounter, 5057 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2112 SdHoareTripleChecker+Valid, 6754 SdHoareTripleChecker+Invalid, 5319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 5057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-13 22:38:30,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2112 Valid, 6754 Invalid, 5319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 5057 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-13 22:38:30,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3298 states. [2024-10-13 22:38:30,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3298 to 1572. [2024-10-13 22:38:30,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1571 states have (on average 1.3647358370464673) internal successors, (2144), 1571 states have internal predecessors, (2144), 0 states have call successors, (0), 0 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 22:38:30,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2144 transitions. [2024-10-13 22:38:30,625 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2144 transitions. Word has length 151 [2024-10-13 22:38:30,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:38:30,625 INFO L471 AbstractCegarLoop]: Abstraction has 1572 states and 2144 transitions. [2024-10-13 22:38:30,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 6.594594594594595) internal successors, (244), 36 states have internal predecessors, (244), 0 states have call successors, (0), 0 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 22:38:30,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2144 transitions. [2024-10-13 22:38:30,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-13 22:38:30,628 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:38:30,628 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:38:30,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-13 22:38:30,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-13 22:38:30,832 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:38:30,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:38:30,833 INFO L85 PathProgramCache]: Analyzing trace with hash -2135670601, now seen corresponding path program 1 times [2024-10-13 22:38:30,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:38:30,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951353758] [2024-10-13 22:38:30,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:38:30,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:38:30,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:38:31,194 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:38:31,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:38:31,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951353758] [2024-10-13 22:38:31,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951353758] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:38:31,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056422168] [2024-10-13 22:38:31,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:38:31,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:38:31,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:38:31,196 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:38:31,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-13 22:38:31,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:38:31,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 22:38:31,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:38:31,322 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2024-10-13 22:38:31,322 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:38:31,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056422168] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:38:31,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 22:38:31,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 17 [2024-10-13 22:38:31,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005395178] [2024-10-13 22:38:31,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:38:31,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 22:38:31,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:38:31,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 22:38:31,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2024-10-13 22:38:31,324 INFO L87 Difference]: Start difference. First operand 1572 states and 2144 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 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 22:38:31,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:38:31,443 INFO L93 Difference]: Finished difference Result 1593 states and 2171 transitions. [2024-10-13 22:38:31,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 22:38:31,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 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 163 [2024-10-13 22:38:31,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:38:31,449 INFO L225 Difference]: With dead ends: 1593 [2024-10-13 22:38:31,449 INFO L226 Difference]: Without dead ends: 1566 [2024-10-13 22:38:31,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2024-10-13 22:38:31,450 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:38:31,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 478 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:38:31,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2024-10-13 22:38:31,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1566. [2024-10-13 22:38:31,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1566 states, 1565 states have (on average 1.3635782747603833) internal successors, (2134), 1565 states have internal predecessors, (2134), 0 states have call successors, (0), 0 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 22:38:31,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 2134 transitions. [2024-10-13 22:38:31,469 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 2134 transitions. Word has length 163 [2024-10-13 22:38:31,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:38:31,469 INFO L471 AbstractCegarLoop]: Abstraction has 1566 states and 2134 transitions. [2024-10-13 22:38:31,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 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 22:38:31,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 2134 transitions. [2024-10-13 22:38:31,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-13 22:38:31,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:38:31,472 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:38:31,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-13 22:38:31,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:38:31,676 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:38:31,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:38:31,676 INFO L85 PathProgramCache]: Analyzing trace with hash -2033446774, now seen corresponding path program 1 times [2024-10-13 22:38:31,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:38:31,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497391405] [2024-10-13 22:38:31,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:38:31,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:38:31,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:38:32,010 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:38:32,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:38:32,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497391405] [2024-10-13 22:38:32,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497391405] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:38:32,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188624009] [2024-10-13 22:38:32,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:38:32,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:38:32,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:38:32,012 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:38:32,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-13 22:38:32,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:38:32,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 22:38:32,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:38:32,152 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-10-13 22:38:32,152 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:38:32,170 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2024-10-13 22:38:32,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188624009] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 22:38:32,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-13 22:38:32,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13, 6] total 18 [2024-10-13 22:38:32,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269434407] [2024-10-13 22:38:32,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:38:32,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:38:32,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:38:32,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:38:32,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2024-10-13 22:38:32,172 INFO L87 Difference]: Start difference. First operand 1566 states and 2134 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 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 22:38:32,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:38:32,198 INFO L93 Difference]: Finished difference Result 1650 states and 2259 transitions. [2024-10-13 22:38:32,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:38:32,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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 163 [2024-10-13 22:38:32,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:38:32,203 INFO L225 Difference]: With dead ends: 1650 [2024-10-13 22:38:32,203 INFO L226 Difference]: Without dead ends: 1574 [2024-10-13 22:38:32,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2024-10-13 22:38:32,204 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:38:32,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 251 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:38:32,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2024-10-13 22:38:32,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 1574. [2024-10-13 22:38:32,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1574 states, 1573 states have (on average 1.3642720915448188) internal successors, (2146), 1573 states have internal predecessors, (2146), 0 states have call successors, (0), 0 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 22:38:32,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 2146 transitions. [2024-10-13 22:38:32,231 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 2146 transitions. Word has length 163 [2024-10-13 22:38:32,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:38:32,231 INFO L471 AbstractCegarLoop]: Abstraction has 1574 states and 2146 transitions. [2024-10-13 22:38:32,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 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 22:38:32,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 2146 transitions. [2024-10-13 22:38:32,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-13 22:38:32,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:38:32,234 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:38:32,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-13 22:38:32,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-13 22:38:32,435 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:38:32,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:38:32,436 INFO L85 PathProgramCache]: Analyzing trace with hash 735670134, now seen corresponding path program 1 times [2024-10-13 22:38:32,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:38:32,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555626032] [2024-10-13 22:38:32,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:38:32,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:38:32,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:38:32,596 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 110 proven. 10 refuted. 0 times theorem prover too weak. 531 trivial. 0 not checked. [2024-10-13 22:38:32,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:38:32,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555626032] [2024-10-13 22:38:32,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555626032] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:38:32,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234853916] [2024-10-13 22:38:32,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:38:32,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:38:32,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:38:32,598 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:38:32,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-13 22:38:32,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:38:32,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 22:38:32,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:38:32,850 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 90 proven. 111 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-10-13 22:38:32,850 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:38:33,042 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 191 proven. 10 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-10-13 22:38:33,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234853916] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 22:38:33,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 22:38:33,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 11 [2024-10-13 22:38:33,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932629178] [2024-10-13 22:38:33,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 22:38:33,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 22:38:33,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:38:33,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 22:38:33,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-13 22:38:33,044 INFO L87 Difference]: Start difference. First operand 1574 states and 2146 transitions. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:38:33,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:38:33,146 INFO L93 Difference]: Finished difference Result 3717 states and 4998 transitions. [2024-10-13 22:38:33,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 22:38:33,147 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 163 [2024-10-13 22:38:33,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:38:33,152 INFO L225 Difference]: With dead ends: 3717 [2024-10-13 22:38:33,152 INFO L226 Difference]: Without dead ends: 2245 [2024-10-13 22:38:33,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 317 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-13 22:38:33,154 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 75 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:38:33,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 848 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:38:33,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2245 states. [2024-10-13 22:38:33,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2245 to 2241. [2024-10-13 22:38:33,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2241 states, 2240 states have (on average 1.3120535714285715) internal successors, (2939), 2240 states have internal predecessors, (2939), 0 states have call successors, (0), 0 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 22:38:33,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2241 states to 2241 states and 2939 transitions. [2024-10-13 22:38:33,187 INFO L78 Accepts]: Start accepts. Automaton has 2241 states and 2939 transitions. Word has length 163 [2024-10-13 22:38:33,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:38:33,187 INFO L471 AbstractCegarLoop]: Abstraction has 2241 states and 2939 transitions. [2024-10-13 22:38:33,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:38:33,187 INFO L276 IsEmpty]: Start isEmpty. Operand 2241 states and 2939 transitions. [2024-10-13 22:38:33,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-13 22:38:33,190 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:38:33,190 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:38:33,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-13 22:38:33,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-13 22:38:33,395 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:38:33,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:38:33,395 INFO L85 PathProgramCache]: Analyzing trace with hash -332479669, now seen corresponding path program 1 times [2024-10-13 22:38:33,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:38:33,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531497815] [2024-10-13 22:38:33,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:38:33,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:38:33,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:38:33,817 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:38:33,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:38:33,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531497815] [2024-10-13 22:38:33,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531497815] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:38:33,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249698835] [2024-10-13 22:38:33,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:38:33,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:38:33,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:38:33,822 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:38:33,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-13 22:38:33,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:38:33,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 22:38:33,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:38:33,940 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-10-13 22:38:33,940 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:38:33,982 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2024-10-13 22:38:33,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249698835] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 22:38:33,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-13 22:38:33,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13, 6] total 20 [2024-10-13 22:38:33,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535324562] [2024-10-13 22:38:33,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:38:33,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 22:38:33,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:38:33,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 22:38:33,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2024-10-13 22:38:33,983 INFO L87 Difference]: Start difference. First operand 2241 states and 2939 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 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 22:38:34,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:38:34,078 INFO L93 Difference]: Finished difference Result 2319 states and 3048 transitions. [2024-10-13 22:38:34,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 22:38:34,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 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 164 [2024-10-13 22:38:34,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:38:34,084 INFO L225 Difference]: With dead ends: 2319 [2024-10-13 22:38:34,084 INFO L226 Difference]: Without dead ends: 2256 [2024-10-13 22:38:34,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2024-10-13 22:38:34,085 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 1 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:38:34,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 473 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:38:34,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2256 states. [2024-10-13 22:38:34,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2256 to 2256. [2024-10-13 22:38:34,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2256 states, 2255 states have (on average 1.3108647450110864) internal successors, (2956), 2255 states have internal predecessors, (2956), 0 states have call successors, (0), 0 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 22:38:34,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2256 states to 2256 states and 2956 transitions. [2024-10-13 22:38:34,117 INFO L78 Accepts]: Start accepts. Automaton has 2256 states and 2956 transitions. Word has length 164 [2024-10-13 22:38:34,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:38:34,117 INFO L471 AbstractCegarLoop]: Abstraction has 2256 states and 2956 transitions. [2024-10-13 22:38:34,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 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 22:38:34,117 INFO L276 IsEmpty]: Start isEmpty. Operand 2256 states and 2956 transitions. [2024-10-13 22:38:34,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-13 22:38:34,120 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:38:34,120 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:38:34,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-13 22:38:34,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-13 22:38:34,321 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:38:34,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:38:34,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1517680494, now seen corresponding path program 1 times [2024-10-13 22:38:34,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:38:34,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239940693] [2024-10-13 22:38:34,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:38:34,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:38:34,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:38:34,630 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:38:34,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:38:34,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239940693] [2024-10-13 22:38:34,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239940693] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:38:34,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865851025] [2024-10-13 22:38:34,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:38:34,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:38:34,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:38:34,631 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:38:34,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-13 22:38:34,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:38:34,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 22:38:34,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:38:34,744 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-10-13 22:38:34,744 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:38:34,782 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2024-10-13 22:38:34,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865851025] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 22:38:34,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-13 22:38:34,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13, 6] total 20 [2024-10-13 22:38:34,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354766888] [2024-10-13 22:38:34,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:38:34,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 22:38:34,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:38:34,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 22:38:34,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2024-10-13 22:38:34,783 INFO L87 Difference]: Start difference. First operand 2256 states and 2956 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 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 22:38:35,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:38:35,825 INFO L93 Difference]: Finished difference Result 2447 states and 3231 transitions. [2024-10-13 22:38:35,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 22:38:35,826 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 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 164 [2024-10-13 22:38:35,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:38:35,831 INFO L225 Difference]: With dead ends: 2447 [2024-10-13 22:38:35,831 INFO L226 Difference]: Without dead ends: 2272 [2024-10-13 22:38:35,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2024-10-13 22:38:35,832 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 1 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:38:35,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 474 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 22:38:35,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2272 states. [2024-10-13 22:38:35,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2272 to 2272. [2024-10-13 22:38:35,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2272 states, 2271 states have (on average 1.310435931307794) internal successors, (2976), 2271 states have internal predecessors, (2976), 0 states have call successors, (0), 0 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 22:38:35,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 2272 states and 2976 transitions. [2024-10-13 22:38:35,864 INFO L78 Accepts]: Start accepts. Automaton has 2272 states and 2976 transitions. Word has length 164 [2024-10-13 22:38:35,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:38:35,864 INFO L471 AbstractCegarLoop]: Abstraction has 2272 states and 2976 transitions. [2024-10-13 22:38:35,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 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 22:38:35,864 INFO L276 IsEmpty]: Start isEmpty. Operand 2272 states and 2976 transitions. [2024-10-13 22:38:35,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-13 22:38:35,869 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:38:35,869 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 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] [2024-10-13 22:38:35,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-13 22:38:36,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-13 22:38:36,070 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:38:36,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:38:36,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1450998176, now seen corresponding path program 2 times [2024-10-13 22:38:36,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:38:36,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621629700] [2024-10-13 22:38:36,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:38:36,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:38:36,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:38:36,287 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2024-10-13 22:38:36,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:38:36,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621629700] [2024-10-13 22:38:36,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621629700] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:38:36,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:38:36,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 22:38:36,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388792740] [2024-10-13 22:38:36,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:38:36,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 22:38:36,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:38:36,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 22:38:36,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-13 22:38:36,290 INFO L87 Difference]: Start difference. First operand 2272 states and 2976 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 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 22:38:36,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:38:36,344 INFO L93 Difference]: Finished difference Result 3811 states and 5099 transitions. [2024-10-13 22:38:36,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 22:38:36,344 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 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 164 [2024-10-13 22:38:36,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:38:36,349 INFO L225 Difference]: With dead ends: 3811 [2024-10-13 22:38:36,349 INFO L226 Difference]: Without dead ends: 2316 [2024-10-13 22:38:36,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-13 22:38:36,351 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 47 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:38:36,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 313 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:38:36,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2316 states. [2024-10-13 22:38:36,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2316 to 2312. [2024-10-13 22:38:36,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2312 states, 2311 states have (on average 1.305062743401125) internal successors, (3016), 2311 states have internal predecessors, (3016), 0 states have call successors, (0), 0 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 22:38:36,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 3016 transitions. [2024-10-13 22:38:36,389 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 3016 transitions. Word has length 164 [2024-10-13 22:38:36,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:38:36,389 INFO L471 AbstractCegarLoop]: Abstraction has 2312 states and 3016 transitions. [2024-10-13 22:38:36,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 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 22:38:36,390 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 3016 transitions. [2024-10-13 22:38:36,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-13 22:38:36,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:38:36,393 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 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] [2024-10-13 22:38:36,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 22:38:36,393 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:38:36,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:38:36,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1022257921, now seen corresponding path program 1 times [2024-10-13 22:38:36,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:38:36,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849592586] [2024-10-13 22:38:36,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:38:36,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:38:36,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:38:36,708 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 0 proven. 653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:38:36,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:38:36,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849592586] [2024-10-13 22:38:36,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849592586] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:38:36,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206139996] [2024-10-13 22:38:36,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:38:36,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:38:36,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:38:36,710 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:38:36,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-13 22:38:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:38:36,784 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 22:38:36,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:38:36,974 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 51 proven. 21 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2024-10-13 22:38:36,974 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:38:37,225 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2024-10-13 22:38:37,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206139996] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 22:38:37,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-13 22:38:37,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13, 6] total 21 [2024-10-13 22:38:37,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020648494] [2024-10-13 22:38:37,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:38:37,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 22:38:37,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:38:37,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 22:38:37,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2024-10-13 22:38:37,226 INFO L87 Difference]: Start difference. First operand 2312 states and 3016 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:38:39,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 22:38:43,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 22:38:43,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:38:43,289 INFO L93 Difference]: Finished difference Result 3159 states and 4069 transitions. [2024-10-13 22:38:43,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 22:38:43,290 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2024-10-13 22:38:43,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:38:43,296 INFO L225 Difference]: With dead ends: 3159 [2024-10-13 22:38:43,296 INFO L226 Difference]: Without dead ends: 2868 [2024-10-13 22:38:43,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2024-10-13 22:38:43,297 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 69 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:38:43,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 448 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 68 Invalid, 1 Unknown, 0 Unchecked, 6.0s Time] [2024-10-13 22:38:43,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2868 states. [2024-10-13 22:38:43,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2868 to 2859. [2024-10-13 22:38:43,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2859 states, 2858 states have (on average 1.2834149755073478) internal successors, (3668), 2858 states have internal predecessors, (3668), 0 states have call successors, (0), 0 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 22:38:43,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2859 states to 2859 states and 3668 transitions. [2024-10-13 22:38:43,341 INFO L78 Accepts]: Start accepts. Automaton has 2859 states and 3668 transitions. Word has length 165 [2024-10-13 22:38:43,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:38:43,341 INFO L471 AbstractCegarLoop]: Abstraction has 2859 states and 3668 transitions. [2024-10-13 22:38:43,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:38:43,341 INFO L276 IsEmpty]: Start isEmpty. Operand 2859 states and 3668 transitions. [2024-10-13 22:38:43,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-13 22:38:43,345 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:38:43,345 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:38:43,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-10-13 22:38:43,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:38:43,546 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:38:43,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:38:43,546 INFO L85 PathProgramCache]: Analyzing trace with hash 715960593, now seen corresponding path program 1 times [2024-10-13 22:38:43,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:38:43,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807776207] [2024-10-13 22:38:43,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:38:43,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:38:43,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:38:43,925 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:38:43,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:38:43,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807776207] [2024-10-13 22:38:43,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807776207] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:38:43,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422381570] [2024-10-13 22:38:43,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:38:43,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:38:43,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:38:43,927 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:38:43,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-13 22:38:44,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:38:44,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 22:38:44,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:38:44,052 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2024-10-13 22:38:44,052 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:38:44,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422381570] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:38:44,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 22:38:44,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 17 [2024-10-13 22:38:44,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015220309] [2024-10-13 22:38:44,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:38:44,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 22:38:44,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:38:44,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 22:38:44,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2024-10-13 22:38:44,053 INFO L87 Difference]: Start difference. First operand 2859 states and 3668 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 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 22:38:44,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:38:44,157 INFO L93 Difference]: Finished difference Result 2917 states and 3746 transitions. [2024-10-13 22:38:44,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 22:38:44,158 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 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 165 [2024-10-13 22:38:44,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:38:44,164 INFO L225 Difference]: With dead ends: 2917 [2024-10-13 22:38:44,164 INFO L226 Difference]: Without dead ends: 2853 [2024-10-13 22:38:44,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2024-10-13 22:38:44,165 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:38:44,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 478 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:38:44,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2853 states. [2024-10-13 22:38:44,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2853 to 2853. [2024-10-13 22:38:44,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2853 states, 2852 states have (on average 1.2826086956521738) internal successors, (3658), 2852 states have internal predecessors, (3658), 0 states have call successors, (0), 0 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 22:38:44,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2853 states to 2853 states and 3658 transitions. [2024-10-13 22:38:44,209 INFO L78 Accepts]: Start accepts. Automaton has 2853 states and 3658 transitions. Word has length 165 [2024-10-13 22:38:44,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:38:44,209 INFO L471 AbstractCegarLoop]: Abstraction has 2853 states and 3658 transitions. [2024-10-13 22:38:44,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 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 22:38:44,209 INFO L276 IsEmpty]: Start isEmpty. Operand 2853 states and 3658 transitions. [2024-10-13 22:38:44,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-13 22:38:44,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:38:44,213 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:38:44,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-10-13 22:38:44,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-13 22:38:44,418 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:38:44,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:38:44,418 INFO L85 PathProgramCache]: Analyzing trace with hash -539606701, now seen corresponding path program 1 times [2024-10-13 22:38:44,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:38:44,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491087709] [2024-10-13 22:38:44,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:38:44,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:38:44,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:38:44,717 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:38:44,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:38:44,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491087709] [2024-10-13 22:38:44,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491087709] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:38:44,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704898123] [2024-10-13 22:38:44,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:38:44,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:38:44,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:38:44,719 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:38:44,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-13 22:38:44,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:38:44,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 22:38:44,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:38:44,825 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2024-10-13 22:38:44,825 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:38:44,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704898123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:38:44,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 22:38:44,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [13] total 16 [2024-10-13 22:38:44,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497022059] [2024-10-13 22:38:44,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:38:44,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 22:38:44,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:38:44,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 22:38:44,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-10-13 22:38:44,826 INFO L87 Difference]: Start difference. First operand 2853 states and 3658 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 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 22:38:45,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:38:45,498 INFO L93 Difference]: Finished difference Result 3021 states and 3887 transitions. [2024-10-13 22:38:45,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 22:38:45,499 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 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 165 [2024-10-13 22:38:45,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:38:45,503 INFO L225 Difference]: With dead ends: 3021 [2024-10-13 22:38:45,503 INFO L226 Difference]: Without dead ends: 2848 [2024-10-13 22:38:45,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-10-13 22:38:45,504 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 22:38:45,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 360 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 22:38:45,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2848 states. [2024-10-13 22:38:45,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2848 to 2848. [2024-10-13 22:38:45,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2848 states, 2847 states have (on average 1.2813487881981032) internal successors, (3648), 2847 states have internal predecessors, (3648), 0 states have call successors, (0), 0 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 22:38:45,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2848 states to 2848 states and 3648 transitions. [2024-10-13 22:38:45,546 INFO L78 Accepts]: Start accepts. Automaton has 2848 states and 3648 transitions. Word has length 165 [2024-10-13 22:38:45,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:38:45,546 INFO L471 AbstractCegarLoop]: Abstraction has 2848 states and 3648 transitions. [2024-10-13 22:38:45,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 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 22:38:45,546 INFO L276 IsEmpty]: Start isEmpty. Operand 2848 states and 3648 transitions. [2024-10-13 22:38:45,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-13 22:38:45,550 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:38:45,550 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 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] [2024-10-13 22:38:45,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-10-13 22:38:45,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:38:45,750 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:38:45,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:38:45,751 INFO L85 PathProgramCache]: Analyzing trace with hash -778912676, now seen corresponding path program 1 times [2024-10-13 22:38:45,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:38:45,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950902326] [2024-10-13 22:38:45,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:38:45,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:38:45,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:38:46,035 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 0 proven. 652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:38:46,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:38:46,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950902326] [2024-10-13 22:38:46,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950902326] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:38:46,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083569085] [2024-10-13 22:38:46,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:38:46,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:38:46,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:38:46,038 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:38:46,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-13 22:38:46,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:38:46,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 22:38:46,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:38:46,358 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 30 proven. 20 refuted. 0 times theorem prover too weak. 602 trivial. 0 not checked. [2024-10-13 22:38:46,358 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:38:46,432 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2024-10-13 22:38:46,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083569085] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 22:38:46,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-13 22:38:46,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13, 6] total 21 [2024-10-13 22:38:46,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809023441] [2024-10-13 22:38:46,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:38:46,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 22:38:46,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:38:46,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 22:38:46,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2024-10-13 22:38:46,434 INFO L87 Difference]: Start difference. First operand 2848 states and 3648 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:38:47,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 22:38:51,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 22:38:55,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 22:38:59,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 22:39:03,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.61s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 22:39:07,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 22:39:11,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 22:39:15,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 22:39:15,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:15,537 INFO L93 Difference]: Finished difference Result 3154 states and 4089 transitions. [2024-10-13 22:39:15,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 22:39:15,537 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2024-10-13 22:39:15,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:15,541 INFO L225 Difference]: With dead ends: 3154 [2024-10-13 22:39:15,541 INFO L226 Difference]: Without dead ends: 2856 [2024-10-13 22:39:15,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2024-10-13 22:39:15,542 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 23 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:15,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 498 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 6 Unknown, 0 Unchecked, 29.1s Time] [2024-10-13 22:39:15,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2856 states. [2024-10-13 22:39:15,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2856 to 2856. [2024-10-13 22:39:15,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2856 states, 2855 states have (on average 1.2802101576182137) internal successors, (3655), 2855 states have internal predecessors, (3655), 0 states have call successors, (0), 0 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 22:39:15,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2856 states to 2856 states and 3655 transitions. [2024-10-13 22:39:15,581 INFO L78 Accepts]: Start accepts. Automaton has 2856 states and 3655 transitions. Word has length 165 [2024-10-13 22:39:15,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:15,582 INFO L471 AbstractCegarLoop]: Abstraction has 2856 states and 3655 transitions. [2024-10-13 22:39:15,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:15,582 INFO L276 IsEmpty]: Start isEmpty. Operand 2856 states and 3655 transitions. [2024-10-13 22:39:15,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-13 22:39:15,585 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:15,585 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 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] [2024-10-13 22:39:15,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-10-13 22:39:15,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:15,790 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:15,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:15,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1937505467, now seen corresponding path program 1 times [2024-10-13 22:39:15,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:15,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553732436] [2024-10-13 22:39:15,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:15,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:16,046 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 0 proven. 653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:39:16,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:16,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553732436] [2024-10-13 22:39:16,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553732436] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:16,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400045221] [2024-10-13 22:39:16,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:16,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:16,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:16,047 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:39:16,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-10-13 22:39:16,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:16,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 22:39:16,130 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:16,395 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 62 proven. 10 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2024-10-13 22:39:16,395 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:39:16,637 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2024-10-13 22:39:16,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400045221] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:16,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-13 22:39:16,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13, 6] total 21 [2024-10-13 22:39:16,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922544832] [2024-10-13 22:39:16,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:16,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 22:39:16,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:16,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 22:39:16,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2024-10-13 22:39:16,638 INFO L87 Difference]: Start difference. First operand 2856 states and 3655 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 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 22:39:16,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:16,796 INFO L93 Difference]: Finished difference Result 2971 states and 3816 transitions. [2024-10-13 22:39:16,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 22:39:16,797 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 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 166 [2024-10-13 22:39:16,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:16,800 INFO L225 Difference]: With dead ends: 2971 [2024-10-13 22:39:16,801 INFO L226 Difference]: Without dead ends: 2860 [2024-10-13 22:39:16,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 323 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2024-10-13 22:39:16,802 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 53 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:16,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 756 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:39:16,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2860 states. [2024-10-13 22:39:16,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2860 to 2860. [2024-10-13 22:39:16,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2860 states, 2859 states have (on average 1.279818118223155) internal successors, (3659), 2859 states have internal predecessors, (3659), 0 states have call successors, (0), 0 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 22:39:16,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 3659 transitions. [2024-10-13 22:39:16,843 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 3659 transitions. Word has length 166 [2024-10-13 22:39:16,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:16,844 INFO L471 AbstractCegarLoop]: Abstraction has 2860 states and 3659 transitions. [2024-10-13 22:39:16,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 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 22:39:16,844 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 3659 transitions. [2024-10-13 22:39:16,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-13 22:39:16,847 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:16,847 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:39:16,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-10-13 22:39:17,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:17,049 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:17,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:17,049 INFO L85 PathProgramCache]: Analyzing trace with hash -892805294, now seen corresponding path program 1 times [2024-10-13 22:39:17,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:17,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450687833] [2024-10-13 22:39:17,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:17,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:17,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:17,311 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:39:17,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:17,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450687833] [2024-10-13 22:39:17,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450687833] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:17,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829403411] [2024-10-13 22:39:17,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:17,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:17,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:17,313 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:39:17,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-10-13 22:39:17,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:17,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 22:39:17,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:17,464 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-10-13 22:39:17,464 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:39:17,482 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2024-10-13 22:39:17,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829403411] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:17,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-13 22:39:17,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13, 6] total 18 [2024-10-13 22:39:17,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822525779] [2024-10-13 22:39:17,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:17,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:17,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:17,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:17,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2024-10-13 22:39:17,484 INFO L87 Difference]: Start difference. First operand 2860 states and 3659 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 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 22:39:17,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:17,514 INFO L93 Difference]: Finished difference Result 2945 states and 3778 transitions. [2024-10-13 22:39:17,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:17,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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 166 [2024-10-13 22:39:17,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:17,518 INFO L225 Difference]: With dead ends: 2945 [2024-10-13 22:39:17,518 INFO L226 Difference]: Without dead ends: 2868 [2024-10-13 22:39:17,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2024-10-13 22:39:17,519 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:17,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 251 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:39:17,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2868 states. [2024-10-13 22:39:17,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2868 to 2868. [2024-10-13 22:39:17,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2868 states, 2867 states have (on average 1.2800837111963725) internal successors, (3670), 2867 states have internal predecessors, (3670), 0 states have call successors, (0), 0 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 22:39:17,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2868 states to 2868 states and 3670 transitions. [2024-10-13 22:39:17,554 INFO L78 Accepts]: Start accepts. Automaton has 2868 states and 3670 transitions. Word has length 166 [2024-10-13 22:39:17,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:17,555 INFO L471 AbstractCegarLoop]: Abstraction has 2868 states and 3670 transitions. [2024-10-13 22:39:17,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 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 22:39:17,555 INFO L276 IsEmpty]: Start isEmpty. Operand 2868 states and 3670 transitions. [2024-10-13 22:39:17,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-13 22:39:17,558 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:17,558 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:39:17,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-10-13 22:39:17,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:17,759 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:17,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:17,760 INFO L85 PathProgramCache]: Analyzing trace with hash -393351231, now seen corresponding path program 1 times [2024-10-13 22:39:17,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:17,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131263188] [2024-10-13 22:39:17,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:17,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:17,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:18,006 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:39:18,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:18,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131263188] [2024-10-13 22:39:18,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131263188] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:18,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219654373] [2024-10-13 22:39:18,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:18,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:18,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:18,008 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:39:18,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-10-13 22:39:18,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:18,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 22:39:18,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:18,122 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-10-13 22:39:18,122 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:39:18,161 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2024-10-13 22:39:18,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219654373] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:18,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-13 22:39:18,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13, 6] total 20 [2024-10-13 22:39:18,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15408727] [2024-10-13 22:39:18,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:18,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 22:39:18,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:18,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 22:39:18,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2024-10-13 22:39:18,162 INFO L87 Difference]: Start difference. First operand 2868 states and 3670 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 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 22:39:19,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 22:39:19,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:19,452 INFO L93 Difference]: Finished difference Result 3133 states and 4044 transitions. [2024-10-13 22:39:19,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 22:39:19,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 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 166 [2024-10-13 22:39:19,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:19,456 INFO L225 Difference]: With dead ends: 3133 [2024-10-13 22:39:19,456 INFO L226 Difference]: Without dead ends: 2888 [2024-10-13 22:39:19,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2024-10-13 22:39:19,457 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 1 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:19,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 474 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 22:39:19,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2888 states. [2024-10-13 22:39:19,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2888 to 2888. [2024-10-13 22:39:19,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2888 states, 2887 states have (on average 1.279875303082785) internal successors, (3695), 2887 states have internal predecessors, (3695), 0 states have call successors, (0), 0 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 22:39:19,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2888 states to 2888 states and 3695 transitions. [2024-10-13 22:39:19,512 INFO L78 Accepts]: Start accepts. Automaton has 2888 states and 3695 transitions. Word has length 166 [2024-10-13 22:39:19,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:19,512 INFO L471 AbstractCegarLoop]: Abstraction has 2888 states and 3695 transitions. [2024-10-13 22:39:19,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 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 22:39:19,512 INFO L276 IsEmpty]: Start isEmpty. Operand 2888 states and 3695 transitions. [2024-10-13 22:39:19,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-13 22:39:19,515 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:19,515 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:39:19,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-10-13 22:39:19,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-13 22:39:19,716 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:19,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:19,716 INFO L85 PathProgramCache]: Analyzing trace with hash 883810176, now seen corresponding path program 1 times [2024-10-13 22:39:19,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:19,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322018460] [2024-10-13 22:39:19,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:19,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:19,980 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 0 proven. 652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:39:19,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:19,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322018460] [2024-10-13 22:39:19,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322018460] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:19,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960148670] [2024-10-13 22:39:19,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:19,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:19,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:19,981 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:39:19,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-10-13 22:39:20,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:20,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 22:39:20,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:20,135 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 89 proven. 9 refuted. 0 times theorem prover too weak. 554 trivial. 0 not checked. [2024-10-13 22:39:20,135 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:39:20,210 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2024-10-13 22:39:20,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960148670] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:20,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-13 22:39:20,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13, 6] total 21 [2024-10-13 22:39:20,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592868429] [2024-10-13 22:39:20,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:20,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 22:39:20,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:20,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 22:39:20,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2024-10-13 22:39:20,211 INFO L87 Difference]: Start difference. First operand 2888 states and 3695 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 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 22:39:20,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:20,309 INFO L93 Difference]: Finished difference Result 3207 states and 4147 transitions. [2024-10-13 22:39:20,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 22:39:20,309 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 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 166 [2024-10-13 22:39:20,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:20,312 INFO L225 Difference]: With dead ends: 3207 [2024-10-13 22:39:20,312 INFO L226 Difference]: Without dead ends: 2892 [2024-10-13 22:39:20,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 323 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2024-10-13 22:39:20,313 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 48 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:20,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 483 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:39:20,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2892 states. [2024-10-13 22:39:20,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2892 to 2892. [2024-10-13 22:39:20,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2892 states, 2891 states have (on average 1.2791421653407125) internal successors, (3698), 2891 states have internal predecessors, (3698), 0 states have call successors, (0), 0 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 22:39:20,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2892 states to 2892 states and 3698 transitions. [2024-10-13 22:39:20,349 INFO L78 Accepts]: Start accepts. Automaton has 2892 states and 3698 transitions. Word has length 166 [2024-10-13 22:39:20,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:20,349 INFO L471 AbstractCegarLoop]: Abstraction has 2892 states and 3698 transitions. [2024-10-13 22:39:20,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 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 22:39:20,349 INFO L276 IsEmpty]: Start isEmpty. Operand 2892 states and 3698 transitions. [2024-10-13 22:39:20,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-13 22:39:20,352 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:20,353 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 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] [2024-10-13 22:39:20,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2024-10-13 22:39:20,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-10-13 22:39:20,553 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:20,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:20,554 INFO L85 PathProgramCache]: Analyzing trace with hash 481740379, now seen corresponding path program 1 times [2024-10-13 22:39:20,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:20,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865500778] [2024-10-13 22:39:20,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:20,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:20,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:20,830 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 0 proven. 653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:39:20,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:20,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865500778] [2024-10-13 22:39:20,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865500778] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:20,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784416633] [2024-10-13 22:39:20,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:20,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:20,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:20,832 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:39:20,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-10-13 22:39:20,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:20,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 22:39:20,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:20,992 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 653 trivial. 0 not checked. [2024-10-13 22:39:20,992 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:39:20,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784416633] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:20,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 22:39:20,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 17 [2024-10-13 22:39:20,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124327067] [2024-10-13 22:39:20,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:20,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 22:39:20,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:20,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 22:39:20,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2024-10-13 22:39:20,993 INFO L87 Difference]: Start difference. First operand 2892 states and 3698 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 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 22:39:21,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:21,099 INFO L93 Difference]: Finished difference Result 3023 states and 3878 transitions. [2024-10-13 22:39:21,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 22:39:21,099 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 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 22:39:21,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:21,103 INFO L225 Difference]: With dead ends: 3023 [2024-10-13 22:39:21,103 INFO L226 Difference]: Without dead ends: 2904 [2024-10-13 22:39:21,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2024-10-13 22:39:21,104 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 34 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:21,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 419 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:39:21,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2904 states. [2024-10-13 22:39:21,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2904 to 2900. [2024-10-13 22:39:21,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2900 states, 2899 states have (on average 1.2783718523628838) internal successors, (3706), 2899 states have internal predecessors, (3706), 0 states have call successors, (0), 0 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 22:39:21,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2900 states to 2900 states and 3706 transitions. [2024-10-13 22:39:21,141 INFO L78 Accepts]: Start accepts. Automaton has 2900 states and 3706 transitions. Word has length 167 [2024-10-13 22:39:21,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:21,141 INFO L471 AbstractCegarLoop]: Abstraction has 2900 states and 3706 transitions. [2024-10-13 22:39:21,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 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 22:39:21,142 INFO L276 IsEmpty]: Start isEmpty. Operand 2900 states and 3706 transitions. [2024-10-13 22:39:21,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-13 22:39:21,145 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:21,145 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:39:21,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-10-13 22:39:21,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:21,346 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:21,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:21,346 INFO L85 PathProgramCache]: Analyzing trace with hash -756542770, now seen corresponding path program 1 times [2024-10-13 22:39:21,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:21,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107963074] [2024-10-13 22:39:21,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:21,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:21,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:21,634 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:39:21,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:21,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107963074] [2024-10-13 22:39:21,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107963074] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:21,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018982511] [2024-10-13 22:39:21,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:21,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:21,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:21,636 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:39:21,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-10-13 22:39:21,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:21,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 22:39:21,720 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:21,759 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-10-13 22:39:21,759 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:39:21,799 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2024-10-13 22:39:21,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018982511] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:21,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-13 22:39:21,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13, 6] total 20 [2024-10-13 22:39:21,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103868905] [2024-10-13 22:39:21,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:21,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 22:39:21,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:21,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 22:39:21,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2024-10-13 22:39:21,800 INFO L87 Difference]: Start difference. First operand 2900 states and 3706 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 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 22:39:22,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:22,108 INFO L93 Difference]: Finished difference Result 3019 states and 3870 transitions. [2024-10-13 22:39:22,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 22:39:22,108 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 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 22:39:22,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:22,112 INFO L225 Difference]: With dead ends: 3019 [2024-10-13 22:39:22,112 INFO L226 Difference]: Without dead ends: 2915 [2024-10-13 22:39:22,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2024-10-13 22:39:22,113 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 1 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:22,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 473 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 22:39:22,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2915 states. [2024-10-13 22:39:22,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2915 to 2915. [2024-10-13 22:39:22,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2915 states, 2914 states have (on average 1.2776252573781743) internal successors, (3723), 2914 states have internal predecessors, (3723), 0 states have call successors, (0), 0 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 22:39:22,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2915 states to 2915 states and 3723 transitions. [2024-10-13 22:39:22,147 INFO L78 Accepts]: Start accepts. Automaton has 2915 states and 3723 transitions. Word has length 167 [2024-10-13 22:39:22,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:22,147 INFO L471 AbstractCegarLoop]: Abstraction has 2915 states and 3723 transitions. [2024-10-13 22:39:22,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 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 22:39:22,148 INFO L276 IsEmpty]: Start isEmpty. Operand 2915 states and 3723 transitions. [2024-10-13 22:39:22,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-13 22:39:22,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:22,150 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:39:22,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2024-10-13 22:39:22,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:22,351 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:22,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:22,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1408721735, now seen corresponding path program 1 times [2024-10-13 22:39:22,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:22,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120547290] [2024-10-13 22:39:22,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:22,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:22,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:22,612 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:39:22,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:22,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120547290] [2024-10-13 22:39:22,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120547290] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:22,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930760524] [2024-10-13 22:39:22,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:22,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:22,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:22,613 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:39:22,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-10-13 22:39:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:22,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 22:39:22,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:22,729 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2024-10-13 22:39:22,730 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:39:22,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930760524] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:22,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 22:39:22,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 17 [2024-10-13 22:39:22,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875342503] [2024-10-13 22:39:22,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:22,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 22:39:22,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:22,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 22:39:22,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2024-10-13 22:39:22,732 INFO L87 Difference]: Start difference. First operand 2915 states and 3723 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 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 22:39:26,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 22:39:26,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:26,827 INFO L93 Difference]: Finished difference Result 3178 states and 4082 transitions. [2024-10-13 22:39:26,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 22:39:26,828 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 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 22:39:26,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:26,831 INFO L225 Difference]: With dead ends: 3178 [2024-10-13 22:39:26,831 INFO L226 Difference]: Without dead ends: 2910 [2024-10-13 22:39:26,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2024-10-13 22:39:26,832 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:26,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 479 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2024-10-13 22:39:26,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2024-10-13 22:39:26,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 2910. [2024-10-13 22:39:26,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2910 states, 2909 states have (on average 1.2763836369886559) internal successors, (3713), 2909 states have internal predecessors, (3713), 0 states have call successors, (0), 0 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 22:39:26,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2910 states to 2910 states and 3713 transitions. [2024-10-13 22:39:26,866 INFO L78 Accepts]: Start accepts. Automaton has 2910 states and 3713 transitions. Word has length 167 [2024-10-13 22:39:26,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:26,866 INFO L471 AbstractCegarLoop]: Abstraction has 2910 states and 3713 transitions. [2024-10-13 22:39:26,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 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 22:39:26,866 INFO L276 IsEmpty]: Start isEmpty. Operand 2910 states and 3713 transitions. [2024-10-13 22:39:26,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-13 22:39:26,869 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:26,869 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:39:26,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2024-10-13 22:39:27,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-13 22:39:27,070 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:27,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:27,070 INFO L85 PathProgramCache]: Analyzing trace with hash 2017848822, now seen corresponding path program 1 times [2024-10-13 22:39:27,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:27,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856467568] [2024-10-13 22:39:27,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:27,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:27,334 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 0 proven. 652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:39:27,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:27,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856467568] [2024-10-13 22:39:27,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856467568] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:27,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312365735] [2024-10-13 22:39:27,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:27,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:27,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:27,336 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:39:27,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-10-13 22:39:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:27,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-13 22:39:27,424 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:27,498 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 89 proven. 9 refuted. 0 times theorem prover too weak. 554 trivial. 0 not checked. [2024-10-13 22:39:27,498 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:39:27,542 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2024-10-13 22:39:27,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312365735] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:27,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-13 22:39:27,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [13, 6] total 20 [2024-10-13 22:39:27,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542849443] [2024-10-13 22:39:27,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:27,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 22:39:27,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:27,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 22:39:27,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2024-10-13 22:39:27,543 INFO L87 Difference]: Start difference. First operand 2910 states and 3713 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:28,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:28,181 INFO L93 Difference]: Finished difference Result 3233 states and 4157 transitions. [2024-10-13 22:39:28,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 22:39:28,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 167 [2024-10-13 22:39:28,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:28,184 INFO L225 Difference]: With dead ends: 3233 [2024-10-13 22:39:28,184 INFO L226 Difference]: Without dead ends: 2920 [2024-10-13 22:39:28,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2024-10-13 22:39:28,185 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 5 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:28,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 334 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 22:39:28,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2024-10-13 22:39:28,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 2920. [2024-10-13 22:39:28,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2920 states, 2919 states have (on average 1.275436793422405) internal successors, (3723), 2919 states have internal predecessors, (3723), 0 states have call successors, (0), 0 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 22:39:28,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2920 states and 3723 transitions. [2024-10-13 22:39:28,218 INFO L78 Accepts]: Start accepts. Automaton has 2920 states and 3723 transitions. Word has length 167 [2024-10-13 22:39:28,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:28,219 INFO L471 AbstractCegarLoop]: Abstraction has 2920 states and 3723 transitions. [2024-10-13 22:39:28,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:28,219 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 3723 transitions. [2024-10-13 22:39:28,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-13 22:39:28,222 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:28,222 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 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] [2024-10-13 22:39:28,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2024-10-13 22:39:28,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-10-13 22:39:28,425 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:28,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:28,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1469616258, now seen corresponding path program 1 times [2024-10-13 22:39:28,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:28,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265064786] [2024-10-13 22:39:28,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:28,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:28,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:28,672 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 0 proven. 653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:39:28,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:28,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265064786] [2024-10-13 22:39:28,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265064786] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:28,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790909351] [2024-10-13 22:39:28,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:28,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:28,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:28,675 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:39:28,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-10-13 22:39:28,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:28,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 22:39:28,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:28,970 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 51 proven. 11 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2024-10-13 22:39:28,970 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:39:29,174 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 51 proven. 11 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2024-10-13 22:39:29,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790909351] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 22:39:29,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 22:39:29,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5, 5] total 20 [2024-10-13 22:39:29,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952899610] [2024-10-13 22:39:29,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 22:39:29,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-13 22:39:29,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:29,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-13 22:39:29,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2024-10-13 22:39:29,175 INFO L87 Difference]: Start difference. First operand 2920 states and 3723 transitions. Second operand has 20 states, 20 states have (on average 12.15) internal successors, (243), 20 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 22:39:31,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:31,011 INFO L93 Difference]: Finished difference Result 6132 states and 7914 transitions. [2024-10-13 22:39:31,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2024-10-13 22:39:31,011 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 12.15) internal successors, (243), 20 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 168 [2024-10-13 22:39:31,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:31,015 INFO L225 Difference]: With dead ends: 6132 [2024-10-13 22:39:31,015 INFO L226 Difference]: Without dead ends: 5626 [2024-10-13 22:39:31,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1241 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=532, Invalid=4298, Unknown=0, NotChecked=0, Total=4830 [2024-10-13 22:39:31,017 INFO L432 NwaCegarLoop]: 476 mSDtfsCounter, 1308 mSDsluCounter, 6471 mSDsCounter, 0 mSdLazyCounter, 3633 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1308 SdHoareTripleChecker+Valid, 6947 SdHoareTripleChecker+Invalid, 3659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 3633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:31,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1308 Valid, 6947 Invalid, 3659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 3633 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 22:39:31,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5626 states. [2024-10-13 22:39:31,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5626 to 3106. [2024-10-13 22:39:31,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3106 states, 3105 states have (on average 1.2711755233494364) internal successors, (3947), 3105 states have internal predecessors, (3947), 0 states have call successors, (0), 0 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 22:39:31,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3106 states to 3106 states and 3947 transitions. [2024-10-13 22:39:31,065 INFO L78 Accepts]: Start accepts. Automaton has 3106 states and 3947 transitions. Word has length 168 [2024-10-13 22:39:31,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:31,065 INFO L471 AbstractCegarLoop]: Abstraction has 3106 states and 3947 transitions. [2024-10-13 22:39:31,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 12.15) internal successors, (243), 20 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 22:39:31,066 INFO L276 IsEmpty]: Start isEmpty. Operand 3106 states and 3947 transitions. [2024-10-13 22:39:31,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-10-13 22:39:31,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:31,069 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 10, 10, 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] [2024-10-13 22:39:31,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2024-10-13 22:39:31,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-10-13 22:39:31,270 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:31,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:31,270 INFO L85 PathProgramCache]: Analyzing trace with hash -297481807, now seen corresponding path program 1 times [2024-10-13 22:39:31,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:31,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512416694] [2024-10-13 22:39:31,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:31,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:31,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:31,583 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:39:31,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:31,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512416694] [2024-10-13 22:39:31,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512416694] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:31,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781930941] [2024-10-13 22:39:31,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:31,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:31,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:31,585 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:39:31,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-10-13 22:39:31,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:31,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 22:39:31,666 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:31,692 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2024-10-13 22:39:31,692 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:39:31,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781930941] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:31,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 22:39:31,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [14] total 17 [2024-10-13 22:39:31,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207930739] [2024-10-13 22:39:31,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:31,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 22:39:31,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:31,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 22:39:31,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2024-10-13 22:39:31,694 INFO L87 Difference]: Start difference. First operand 3106 states and 3947 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:31,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:31,785 INFO L93 Difference]: Finished difference Result 3220 states and 4098 transitions. [2024-10-13 22:39:31,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 22:39:31,785 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 180 [2024-10-13 22:39:31,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:31,788 INFO L225 Difference]: With dead ends: 3220 [2024-10-13 22:39:31,788 INFO L226 Difference]: Without dead ends: 3122 [2024-10-13 22:39:31,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2024-10-13 22:39:31,789 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 2 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:31,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 362 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:39:31,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3122 states. [2024-10-13 22:39:31,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3122 to 3118. [2024-10-13 22:39:31,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3118 states, 3117 states have (on average 1.2701315367340391) internal successors, (3959), 3117 states have internal predecessors, (3959), 0 states have call successors, (0), 0 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 22:39:31,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3118 states to 3118 states and 3959 transitions. [2024-10-13 22:39:31,827 INFO L78 Accepts]: Start accepts. Automaton has 3118 states and 3959 transitions. Word has length 180 [2024-10-13 22:39:31,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:31,828 INFO L471 AbstractCegarLoop]: Abstraction has 3118 states and 3959 transitions. [2024-10-13 22:39:31,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:31,828 INFO L276 IsEmpty]: Start isEmpty. Operand 3118 states and 3959 transitions. [2024-10-13 22:39:31,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-10-13 22:39:31,831 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:31,831 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:39:31,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2024-10-13 22:39:32,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:32,031 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:32,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:32,032 INFO L85 PathProgramCache]: Analyzing trace with hash -276650238, now seen corresponding path program 1 times [2024-10-13 22:39:32,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:32,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152855771] [2024-10-13 22:39:32,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:32,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:32,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:32,322 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:39:32,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:32,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152855771] [2024-10-13 22:39:32,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152855771] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:32,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215384084] [2024-10-13 22:39:32,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:32,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:32,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:32,324 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:39:32,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-10-13 22:39:32,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:32,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 22:39:32,407 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:32,450 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 782 trivial. 0 not checked. [2024-10-13 22:39:32,450 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:39:32,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215384084] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:32,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 22:39:32,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 18 [2024-10-13 22:39:32,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432793344] [2024-10-13 22:39:32,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:32,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 22:39:32,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:32,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 22:39:32,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2024-10-13 22:39:32,451 INFO L87 Difference]: Start difference. First operand 3118 states and 3959 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:32,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:32,526 INFO L93 Difference]: Finished difference Result 3158 states and 4012 transitions. [2024-10-13 22:39:32,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 22:39:32,527 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 180 [2024-10-13 22:39:32,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:32,529 INFO L225 Difference]: With dead ends: 3158 [2024-10-13 22:39:32,529 INFO L226 Difference]: Without dead ends: 3134 [2024-10-13 22:39:32,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2024-10-13 22:39:32,530 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:32,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 475 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:39:32,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3134 states. [2024-10-13 22:39:32,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3134 to 3130. [2024-10-13 22:39:32,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3130 states, 3129 states have (on average 1.2690955576861618) internal successors, (3971), 3129 states have internal predecessors, (3971), 0 states have call successors, (0), 0 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 22:39:32,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 3971 transitions. [2024-10-13 22:39:32,569 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 3971 transitions. Word has length 180 [2024-10-13 22:39:32,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:32,569 INFO L471 AbstractCegarLoop]: Abstraction has 3130 states and 3971 transitions. [2024-10-13 22:39:32,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:32,569 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 3971 transitions. [2024-10-13 22:39:32,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-10-13 22:39:32,572 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:32,572 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:39:32,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2024-10-13 22:39:32,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:32,773 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:32,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:32,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1324227425, now seen corresponding path program 1 times [2024-10-13 22:39:32,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:32,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764973132] [2024-10-13 22:39:32,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:32,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:32,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:33,051 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:39:33,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:33,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764973132] [2024-10-13 22:39:33,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764973132] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:33,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964619400] [2024-10-13 22:39:33,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:33,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:33,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:33,052 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:39:33,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-10-13 22:39:33,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:33,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 22:39:33,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:33,171 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2024-10-13 22:39:33,171 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:39:33,187 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 782 trivial. 0 not checked. [2024-10-13 22:39:33,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964619400] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:33,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-13 22:39:33,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [14, 6] total 19 [2024-10-13 22:39:33,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091740860] [2024-10-13 22:39:33,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:33,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:33,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:33,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:33,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2024-10-13 22:39:33,189 INFO L87 Difference]: Start difference. First operand 3130 states and 3971 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:33,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:33,223 INFO L93 Difference]: Finished difference Result 3424 states and 4368 transitions. [2024-10-13 22:39:33,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:33,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 180 [2024-10-13 22:39:33,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:33,226 INFO L225 Difference]: With dead ends: 3424 [2024-10-13 22:39:33,226 INFO L226 Difference]: Without dead ends: 3138 [2024-10-13 22:39:33,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2024-10-13 22:39:33,227 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:33,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 251 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:39:33,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3138 states. [2024-10-13 22:39:33,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3138 to 3138. [2024-10-13 22:39:33,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3138 states, 3137 states have (on average 1.2696844118584636) internal successors, (3983), 3137 states have internal predecessors, (3983), 0 states have call successors, (0), 0 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 22:39:33,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 3983 transitions. [2024-10-13 22:39:33,263 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 3983 transitions. Word has length 180 [2024-10-13 22:39:33,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:33,264 INFO L471 AbstractCegarLoop]: Abstraction has 3138 states and 3983 transitions. [2024-10-13 22:39:33,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:33,264 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 3983 transitions. [2024-10-13 22:39:33,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-10-13 22:39:33,266 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:33,266 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 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] [2024-10-13 22:39:33,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2024-10-13 22:39:33,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:33,467 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:33,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:33,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1398900206, now seen corresponding path program 1 times [2024-10-13 22:39:33,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:33,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071351438] [2024-10-13 22:39:33,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:33,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:33,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:33,774 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 0 proven. 783 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:39:33,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:33,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071351438] [2024-10-13 22:39:33,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071351438] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:33,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451763405] [2024-10-13 22:39:33,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:33,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:33,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:33,776 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:39:33,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2024-10-13 22:39:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:33,859 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-13 22:39:33,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:34,003 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 98 proven. 10 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2024-10-13 22:39:34,003 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:39:34,133 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 22:39:34,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451763405] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:34,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-13 22:39:34,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14, 8] total 26 [2024-10-13 22:39:34,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071899602] [2024-10-13 22:39:34,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:34,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 22:39:34,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:34,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 22:39:34,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2024-10-13 22:39:34,134 INFO L87 Difference]: Start difference. First operand 3138 states and 3983 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 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 22:39:34,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:34,251 INFO L93 Difference]: Finished difference Result 3265 states and 4138 transitions. [2024-10-13 22:39:34,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 22:39:34,251 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 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 180 [2024-10-13 22:39:34,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:34,253 INFO L225 Difference]: With dead ends: 3265 [2024-10-13 22:39:34,253 INFO L226 Difference]: Without dead ends: 3142 [2024-10-13 22:39:34,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 347 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2024-10-13 22:39:34,254 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 49 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:34,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 727 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:39:34,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3142 states. [2024-10-13 22:39:34,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3142 to 3142. [2024-10-13 22:39:34,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3142 states, 3141 states have (on average 1.268067494428526) internal successors, (3983), 3141 states have internal predecessors, (3983), 0 states have call successors, (0), 0 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 22:39:34,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3142 states to 3142 states and 3983 transitions. [2024-10-13 22:39:34,291 INFO L78 Accepts]: Start accepts. Automaton has 3142 states and 3983 transitions. Word has length 180 [2024-10-13 22:39:34,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:34,291 INFO L471 AbstractCegarLoop]: Abstraction has 3142 states and 3983 transitions. [2024-10-13 22:39:34,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 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 22:39:34,292 INFO L276 IsEmpty]: Start isEmpty. Operand 3142 states and 3983 transitions. [2024-10-13 22:39:34,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-10-13 22:39:34,294 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:34,294 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 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] [2024-10-13 22:39:34,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2024-10-13 22:39:34,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-10-13 22:39:34,494 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:34,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:34,495 INFO L85 PathProgramCache]: Analyzing trace with hash 607212170, now seen corresponding path program 1 times [2024-10-13 22:39:34,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:34,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331848094] [2024-10-13 22:39:34,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:34,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:34,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:34,776 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 0 proven. 783 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:39:34,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:34,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331848094] [2024-10-13 22:39:34,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331848094] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:34,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347588415] [2024-10-13 22:39:34,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:34,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:34,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:34,778 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:39:34,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-10-13 22:39:34,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:34,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-13 22:39:34,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:35,073 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 100 proven. 83 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2024-10-13 22:39:35,073 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:39:35,364 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 172 proven. 11 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2024-10-13 22:39:35,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347588415] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 22:39:35,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 22:39:35,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 8] total 26 [2024-10-13 22:39:35,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052825169] [2024-10-13 22:39:35,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 22:39:35,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-13 22:39:35,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:35,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-13 22:39:35,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2024-10-13 22:39:35,366 INFO L87 Difference]: Start difference. First operand 3142 states and 3983 transitions. Second operand has 26 states, 26 states have (on average 8.615384615384615) internal successors, (224), 26 states have internal predecessors, (224), 0 states have call successors, (0), 0 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 22:39:38,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:38,415 INFO L93 Difference]: Finished difference Result 6921 states and 8799 transitions. [2024-10-13 22:39:38,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2024-10-13 22:39:38,415 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 8.615384615384615) internal successors, (224), 26 states have internal predecessors, (224), 0 states have call successors, (0), 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 180 [2024-10-13 22:39:38,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:38,419 INFO L225 Difference]: With dead ends: 6921 [2024-10-13 22:39:38,419 INFO L226 Difference]: Without dead ends: 4511 [2024-10-13 22:39:38,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6047 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1487, Invalid=16335, Unknown=0, NotChecked=0, Total=17822 [2024-10-13 22:39:38,423 INFO L432 NwaCegarLoop]: 489 mSDtfsCounter, 1163 mSDsluCounter, 7539 mSDsCounter, 0 mSdLazyCounter, 5292 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1163 SdHoareTripleChecker+Valid, 8028 SdHoareTripleChecker+Invalid, 5347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 5292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:38,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1163 Valid, 8028 Invalid, 5347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 5292 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-13 22:39:38,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4511 states. [2024-10-13 22:39:38,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4511 to 4157. [2024-10-13 22:39:38,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4157 states, 4156 states have (on average 1.2473532242540906) internal successors, (5184), 4156 states have internal predecessors, (5184), 0 states have call successors, (0), 0 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 22:39:38,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4157 states to 4157 states and 5184 transitions. [2024-10-13 22:39:38,467 INFO L78 Accepts]: Start accepts. Automaton has 4157 states and 5184 transitions. Word has length 180 [2024-10-13 22:39:38,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:38,467 INFO L471 AbstractCegarLoop]: Abstraction has 4157 states and 5184 transitions. [2024-10-13 22:39:38,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 8.615384615384615) internal successors, (224), 26 states have internal predecessors, (224), 0 states have call successors, (0), 0 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 22:39:38,467 INFO L276 IsEmpty]: Start isEmpty. Operand 4157 states and 5184 transitions. [2024-10-13 22:39:38,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-10-13 22:39:38,470 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:38,470 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 11, 11, 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] [2024-10-13 22:39:38,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2024-10-13 22:39:38,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:38,671 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:38,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:38,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1697311087, now seen corresponding path program 1 times [2024-10-13 22:39:38,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:38,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690918481] [2024-10-13 22:39:38,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:38,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:38,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:38,984 INFO L134 CoverageAnalysis]: Checked inductivity of 927 backedges. 0 proven. 927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:39:38,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:38,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690918481] [2024-10-13 22:39:38,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690918481] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:38,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101903703] [2024-10-13 22:39:38,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:38,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:38,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:38,985 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:39:38,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-10-13 22:39:39,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:39,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-13 22:39:39,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:39,199 INFO L134 CoverageAnalysis]: Checked inductivity of 927 backedges. 0 proven. 927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:39:39,199 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:39:39,576 INFO L134 CoverageAnalysis]: Checked inductivity of 927 backedges. 0 proven. 927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:39:39,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101903703] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 22:39:39,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 22:39:39,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 30 [2024-10-13 22:39:39,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980168150] [2024-10-13 22:39:39,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 22:39:39,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-13 22:39:39,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:39,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-13 22:39:39,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=724, Unknown=0, NotChecked=0, Total=930 [2024-10-13 22:39:39,578 INFO L87 Difference]: Start difference. First operand 4157 states and 5184 transitions. Second operand has 31 states, 31 states have (on average 11.451612903225806) internal successors, (355), 30 states have internal predecessors, (355), 0 states have call successors, (0), 0 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 22:39:40,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:40,106 INFO L93 Difference]: Finished difference Result 5484 states and 6894 transitions. [2024-10-13 22:39:40,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 22:39:40,107 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 11.451612903225806) internal successors, (355), 30 states have internal predecessors, (355), 0 states have call successors, (0), 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 193 [2024-10-13 22:39:40,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:40,111 INFO L225 Difference]: With dead ends: 5484 [2024-10-13 22:39:40,111 INFO L226 Difference]: Without dead ends: 5105 [2024-10-13 22:39:40,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=225, Invalid=767, Unknown=0, NotChecked=0, Total=992 [2024-10-13 22:39:40,112 INFO L432 NwaCegarLoop]: 427 mSDtfsCounter, 1231 mSDsluCounter, 6238 mSDsCounter, 0 mSdLazyCounter, 1693 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1231 SdHoareTripleChecker+Valid, 6665 SdHoareTripleChecker+Invalid, 1694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:40,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1231 Valid, 6665 Invalid, 1694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1693 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 22:39:40,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5105 states. [2024-10-13 22:39:40,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5105 to 5096. [2024-10-13 22:39:40,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5096 states, 5095 states have (on average 1.2447497546614328) internal successors, (6342), 5095 states have internal predecessors, (6342), 0 states have call successors, (0), 0 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 22:39:40,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5096 states to 5096 states and 6342 transitions. [2024-10-13 22:39:40,182 INFO L78 Accepts]: Start accepts. Automaton has 5096 states and 6342 transitions. Word has length 193 [2024-10-13 22:39:40,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:40,182 INFO L471 AbstractCegarLoop]: Abstraction has 5096 states and 6342 transitions. [2024-10-13 22:39:40,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 11.451612903225806) internal successors, (355), 30 states have internal predecessors, (355), 0 states have call successors, (0), 0 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 22:39:40,182 INFO L276 IsEmpty]: Start isEmpty. Operand 5096 states and 6342 transitions. [2024-10-13 22:39:40,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-10-13 22:39:40,185 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:40,186 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 14, 14, 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] [2024-10-13 22:39:40,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2024-10-13 22:39:40,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:40,386 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:40,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:40,387 INFO L85 PathProgramCache]: Analyzing trace with hash -726814204, now seen corresponding path program 2 times [2024-10-13 22:39:40,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:40,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836409401] [2024-10-13 22:39:40,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:40,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:40,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 22:39:40,527 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 22:39:40,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 22:39:40,697 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 22:39:40,697 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 22:39:40,698 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 22:39:40,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-13 22:39:40,702 INFO L407 BasicCegarLoop]: Path program histogram: [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] [2024-10-13 22:39:40,770 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 22:39:40,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 10:39:40 BoogieIcfgContainer [2024-10-13 22:39:40,774 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 22:39:40,774 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 22:39:40,774 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 22:39:40,775 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 22:39:40,775 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:38:13" (3/4) ... [2024-10-13 22:39:40,776 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 22:39:40,777 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 22:39:40,778 INFO L158 Benchmark]: Toolchain (without parser) took 88739.06ms. Allocated memory was 167.8MB in the beginning and 650.1MB in the end (delta: 482.3MB). Free memory was 95.2MB in the beginning and 397.8MB in the end (delta: -302.7MB). Peak memory consumption was 180.1MB. Max. memory is 16.1GB. [2024-10-13 22:39:40,778 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 167.8MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 22:39:40,778 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.23ms. Allocated memory was 167.8MB in the beginning and 216.0MB in the end (delta: 48.2MB). Free memory was 94.9MB in the beginning and 185.6MB in the end (delta: -90.6MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2024-10-13 22:39:40,779 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.58ms. Allocated memory is still 216.0MB. Free memory was 185.6MB in the beginning and 183.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 22:39:40,779 INFO L158 Benchmark]: Boogie Preprocessor took 44.27ms. Allocated memory is still 216.0MB. Free memory was 183.5MB in the beginning and 181.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 22:39:40,779 INFO L158 Benchmark]: RCFGBuilder took 1428.91ms. Allocated memory is still 216.0MB. Free memory was 180.3MB in the beginning and 152.0MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-13 22:39:40,779 INFO L158 Benchmark]: TraceAbstraction took 86992.34ms. Allocated memory was 216.0MB in the beginning and 650.1MB in the end (delta: 434.1MB). Free memory was 152.0MB in the beginning and 397.8MB in the end (delta: -245.8MB). Peak memory consumption was 187.3MB. Max. memory is 16.1GB. [2024-10-13 22:39:40,780 INFO L158 Benchmark]: Witness Printer took 2.97ms. Allocated memory is still 650.1MB. Free memory is still 397.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 22:39:40,781 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 167.8MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.23ms. Allocated memory was 167.8MB in the beginning and 216.0MB in the end (delta: 48.2MB). Free memory was 94.9MB in the beginning and 185.6MB in the end (delta: -90.6MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.58ms. Allocated memory is still 216.0MB. Free memory was 185.6MB in the beginning and 183.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.27ms. Allocated memory is still 216.0MB. Free memory was 183.5MB in the beginning and 181.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1428.91ms. Allocated memory is still 216.0MB. Free memory was 180.3MB in the beginning and 152.0MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 86992.34ms. Allocated memory was 216.0MB in the beginning and 650.1MB in the end (delta: 434.1MB). Free memory was 152.0MB in the beginning and 397.8MB in the end (delta: -245.8MB). Peak memory consumption was 187.3MB. Max. memory is 16.1GB. * Witness Printer took 2.97ms. Allocated memory is still 650.1MB. Free memory is still 397.8MB. There was no memory consumed. 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 - UnprovableResult [Line: 25]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 50, overapproximation of bitwiseOr at line 59, overapproximation of bitwiseAnd at line 59. Possible FailurePath: [L42] unsigned short x = __VERIFIER_nondet_ushort(); [L43] unsigned short y = __VERIFIER_nondet_ushort(); [L44] unsigned int xx; [L45] unsigned int yy; [L46] unsigned int zz; [L47] unsigned int z = 0; [L48] unsigned int i = 0; VAL [i=0, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=0, z=0] [L50] EXPR 1U << i VAL [i=0, z=0] [L50] EXPR x & (1U << i) VAL [i=0, x=0, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=0, x=0, z=0] [L50] EXPR 1U << i VAL [i=0, x=0, z=0] [L50] EXPR y & (1U << i) VAL [i=0, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=0, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=0, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=1, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=1, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=1, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=1, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=1, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=1, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=1, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=1, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=1, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=2, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=2, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=2, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=2, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=2, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=2, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=2, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=2, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=2, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=3, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=3, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=3, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=3, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=3, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=3, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=3, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=3, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=3, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=4, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=4, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=4, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=4, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=4, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=4, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=4, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=4, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=4, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=5, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=5, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=5, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=5, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=5, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=5, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=5, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=5, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=5, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=6, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=6, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=6, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=6, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=6, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=6, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=6, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=6, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=6, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=7, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=7, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=7, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=7, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=7, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=7, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=7, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=7, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=7, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=8, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=8, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=8, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=8, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=8, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=8, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=8, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=8, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=8, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=9, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=9, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=9, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=9, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=9, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=9, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=9, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=9, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=9, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=10, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=10, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=10, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=10, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=10, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=10, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=10, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=10, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=10, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=11, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=11, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=11, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=11, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=11, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=11, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=11, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=11, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=11, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=12, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=12, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=12, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=12, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=12, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=12, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=12, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=12, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=12, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=13, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=13, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=13, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=13, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=13, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=13, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=13, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=13, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=13, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=14, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=14, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=14, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=14, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=14, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=14, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=14, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=14, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=14, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=15, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=15, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=15, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=15, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=15, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=15, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=15, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=15, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=15, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=16, x=0, y=1, z=-4294967295] [L49] COND FALSE !(i < sizeof(x) * 8) VAL [x=0, y=1, z=-4294967295] [L53] xx = x [L54] yy = y VAL [xx=0, yy=1, z=-4294967295] [L55] EXPR xx | (xx << 8u) VAL [yy=1, z=-4294967295] [L55] EXPR (xx | (xx << 8u)) & 16711935U VAL [yy=1, z=-4294967295] [L55] xx = (xx | (xx << 8u)) & 16711935U [L56] EXPR xx | (xx << 4u) VAL [yy=1, z=-4294967295] [L56] EXPR (xx | (xx << 4u)) & 252645135U VAL [yy=1, z=-4294967295] [L56] xx = (xx | (xx << 4u)) & 252645135U [L57] EXPR xx | (xx << 2u) VAL [yy=1, z=-4294967295] [L57] EXPR (xx | (xx << 2u)) & 858993459U VAL [yy=1, z=-4294967295] [L57] xx = (xx | (xx << 2u)) & 858993459U [L58] EXPR xx | (xx << 1u) VAL [yy=1, z=-4294967295] [L58] EXPR (xx | (xx << 1u)) & 1431655765U VAL [yy=1, z=-4294967295] [L58] xx = (xx | (xx << 1u)) & 1431655765U [L59] EXPR yy | (yy << 8u) VAL [xx=0, z=-4294967295] [L59] EXPR (yy | (yy << 8u)) & 16711935U VAL [xx=0, z=-4294967295] [L59] yy = (yy | (yy << 8u)) & 16711935U [L60] EXPR yy | (yy << 4u) VAL [xx=0, z=-4294967295] [L60] EXPR (yy | (yy << 4u)) & 252645135U VAL [xx=0, z=-4294967295] [L60] yy = (yy | (yy << 4u)) & 252645135U [L61] EXPR yy | (yy << 2u) VAL [xx=0, z=-4294967295] [L61] EXPR (yy | (yy << 2u)) & 858993459U VAL [xx=0, z=-4294967295] [L61] yy = (yy | (yy << 2u)) & 858993459U [L62] EXPR yy | (yy << 1u) VAL [xx=0, z=-4294967295] [L62] EXPR (yy | (yy << 1u)) & 1431655765U VAL [xx=0, z=-4294967295] [L62] yy = (yy | (yy << 1u)) & 1431655765U [L64] EXPR xx | (yy << 1U) VAL [z=-4294967295] [L64] zz = xx | (yy << 1U) [L66] CALL __VERIFIER_assert(z == zz) [L24] COND TRUE !(cond) [L25] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 86.9s, OverallIterations: 36, TraceHistogramMax: 16, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 59.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 8 mSolverCounterUnknown, 7812 SdHoareTripleChecker+Valid, 50.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7812 mSDsluCounter, 44193 SdHoareTripleChecker+Invalid, 49.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38290 mSDsCounter, 449 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17923 IncrementalHoareTripleChecker+Invalid, 18380 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 449 mSolverCounterUnsat, 5903 mSDtfsCounter, 17923 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9549 GetRequests, 8502 SyntacticMatches, 8 SemanticMatches, 1039 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62707 ImplicationChecksByTransitivity, 11.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5096occurred in iteration=35, InterpolantAutomatonStates: 726, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 35 MinimizatonAttempts, 4659 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 15.7s InterpolantComputationTime, 10600 NumberOfCodeBlocks, 10494 NumberOfCodeBlocksAsserted, 71 NumberOfCheckSat, 13957 ConstructedInterpolants, 0 QuantifiedInterpolants, 36740 SizeOfPredicates, 40 NumberOfNonLiveVariables, 12538 ConjunctsInSsa, 405 ConjunctsInUnsatCore, 91 InterpolantComputations, 26 PerfectInterpolantSequences, 32977/53933 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 22:39:40,806 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/bitvector/interleave_bits.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 41cbcdfa6f09b615c08bb2dbf908be5e0a68dc8c6a10c0ba76a3c4e4c07e69fb --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-13 22:39:42,598 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 22:39:42,663 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 22:39:42,666 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 22:39:42,667 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 22:39:42,691 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 22:39:42,693 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 22:39:42,694 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 22:39:42,694 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 22:39:42,694 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 22:39:42,695 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 22:39:42,695 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 22:39:42,695 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 22:39:42,697 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 22:39:42,697 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 22:39:42,697 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 22:39:42,697 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 22:39:42,698 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 22:39:42,698 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 22:39:42,700 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 22:39:42,701 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 22:39:42,701 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 22:39:42,701 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 22:39:42,701 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 22:39:42,701 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 22:39:42,702 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 22:39:42,702 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 22:39:42,702 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 22:39:42,702 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 22:39:42,702 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 22:39:42,702 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 22:39:42,702 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 22:39:42,702 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 22:39:42,703 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 22:39:42,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 22:39:42,703 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 22:39:42,703 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 22:39:42,703 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 22:39:42,703 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 22:39:42,703 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-13 22:39:42,704 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 22:39:42,704 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 22:39:42,704 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 22:39:42,704 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 22:39:42,705 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 22:39:42,705 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 -> 41cbcdfa6f09b615c08bb2dbf908be5e0a68dc8c6a10c0ba76a3c4e4c07e69fb [2024-10-13 22:39:42,967 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 22:39:42,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 22:39:42,988 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 22:39:42,989 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 22:39:42,989 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 22:39:42,991 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i