./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/interleave_bits.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../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-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 09:31:49,317 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 09:31:49,421 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 09:31:49,429 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 09:31:49,430 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 09:31:49,458 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 09:31:49,460 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 09:31:49,460 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 09:31:49,461 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 09:31:49,465 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 09:31:49,465 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 09:31:49,465 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 09:31:49,466 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 09:31:49,466 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 09:31:49,466 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 09:31:49,466 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 09:31:49,467 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 09:31:49,467 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 09:31:49,467 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 09:31:49,469 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 09:31:49,469 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 09:31:49,470 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 09:31:49,470 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 09:31:49,470 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 09:31:49,470 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 09:31:49,470 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 09:31:49,470 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 09:31:49,471 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 09:31:49,471 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 09:31:49,471 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 09:31:49,471 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 09:31:49,471 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 09:31:49,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 09:31:49,472 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 09:31:49,472 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 09:31:49,472 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 09:31:49,474 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 09:31:49,474 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 09:31:49,474 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 09:31:49,475 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 09:31:49,475 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 09:31:49,475 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 09:31:49,475 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-11-18 09:31:49,701 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 09:31:49,725 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 09:31:49,727 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 09:31:49,728 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 09:31:49,729 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 09:31:49,730 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/interleave_bits.i [2024-11-18 09:31:51,176 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 09:31:51,367 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 09:31:51,368 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i [2024-11-18 09:31:51,374 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fed6ac307/6471fd0571804c6ba4e4967b69ee844f/FLAG3c8d40696 [2024-11-18 09:31:51,386 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fed6ac307/6471fd0571804c6ba4e4967b69ee844f [2024-11-18 09:31:51,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 09:31:51,390 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 09:31:51,391 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 09:31:51,391 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 09:31:51,398 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 09:31:51,399 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:31:51" (1/1) ... [2024-11-18 09:31:51,400 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b341d8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:51, skipping insertion in model container [2024-11-18 09:31:51,402 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:31:51" (1/1) ... [2024-11-18 09:31:51,424 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 09:31:51,632 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i[1175,1188] [2024-11-18 09:31:51,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 09:31:51,695 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 09:31:51,711 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i[1175,1188] [2024-11-18 09:31:51,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 09:31:51,739 INFO L204 MainTranslator]: Completed translation [2024-11-18 09:31:51,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:51 WrapperNode [2024-11-18 09:31:51,739 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 09:31:51,741 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 09:31:51,741 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 09:31:51,741 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 09:31:51,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:51" (1/1) ... [2024-11-18 09:31:51,757 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:51" (1/1) ... [2024-11-18 09:31:51,791 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 235 [2024-11-18 09:31:51,791 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 09:31:51,792 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 09:31:51,792 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 09:31:51,792 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 09:31:51,803 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:51" (1/1) ... [2024-11-18 09:31:51,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:51" (1/1) ... [2024-11-18 09:31:51,806 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:51" (1/1) ... [2024-11-18 09:31:51,821 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-18 09:31:51,821 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:51" (1/1) ... [2024-11-18 09:31:51,821 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:51" (1/1) ... [2024-11-18 09:31:51,827 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:51" (1/1) ... [2024-11-18 09:31:51,835 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:51" (1/1) ... [2024-11-18 09:31:51,839 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:51" (1/1) ... [2024-11-18 09:31:51,841 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:51" (1/1) ... [2024-11-18 09:31:51,848 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 09:31:51,849 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 09:31:51,849 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 09:31:51,849 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 09:31:51,850 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:51" (1/1) ... [2024-11-18 09:31:51,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 09:31:51,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:31:51,889 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 09:31:51,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 09:31:51,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 09:31:51,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 09:31:51,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 09:31:51,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 09:31:52,021 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 09:31:52,023 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 09:31:53,528 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2024-11-18 09:31:53,528 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 09:31:53,553 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 09:31:53,554 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 09:31:53,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:31:53 BoogieIcfgContainer [2024-11-18 09:31:53,554 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 09:31:53,556 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 09:31:53,557 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 09:31:53,560 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 09:31:53,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:31:51" (1/3) ... [2024-11-18 09:31:53,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@475f0f7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:31:53, skipping insertion in model container [2024-11-18 09:31:53,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:51" (2/3) ... [2024-11-18 09:31:53,563 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@475f0f7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:31:53, skipping insertion in model container [2024-11-18 09:31:53,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:31:53" (3/3) ... [2024-11-18 09:31:53,565 INFO L112 eAbstractionObserver]: Analyzing ICFG interleave_bits.i [2024-11-18 09:31:53,586 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 09:31:53,587 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 09:31:53,652 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 09:31:53,658 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;@611e8f25, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 09:31:53,658 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 09:31:53,662 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 90 states have (on average 1.5555555555555556) internal successors, (140), 91 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:31:53,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-18 09:31:53,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:53,669 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] [2024-11-18 09:31:53,670 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:53,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:53,674 INFO L85 PathProgramCache]: Analyzing trace with hash -245652538, now seen corresponding path program 1 times [2024-11-18 09:31:53,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:31:53,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212288641] [2024-11-18 09:31:53,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:53,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:31:53,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:54,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:31:54,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:31:54,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212288641] [2024-11-18 09:31:54,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212288641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:54,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:31:54,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 09:31:54,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170698374] [2024-11-18 09:31:54,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:54,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 09:31:54,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:31:54,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 09:31:54,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:31:54,123 INFO L87 Difference]: Start difference. First operand has 92 states, 90 states have (on average 1.5555555555555556) internal successors, (140), 91 states have internal predecessors, (140), 0 states have call successors, (0), 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.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:31:54,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:54,188 INFO L93 Difference]: Finished difference Result 201 states and 311 transitions. [2024-11-18 09:31:54,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 09:31:54,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2024-11-18 09:31:54,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:54,200 INFO L225 Difference]: With dead ends: 201 [2024-11-18 09:31:54,200 INFO L226 Difference]: Without dead ends: 107 [2024-11-18 09:31:54,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:31:54,206 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 27 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:54,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 256 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 09:31:54,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-18 09:31:54,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 95. [2024-11-18 09:31:54,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.5212765957446808) internal successors, (143), 94 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:31:54,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 143 transitions. [2024-11-18 09:31:54,244 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 143 transitions. Word has length 32 [2024-11-18 09:31:54,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:54,245 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 143 transitions. [2024-11-18 09:31:54,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:31:54,245 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 143 transitions. [2024-11-18 09:31:54,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-18 09:31:54,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:54,247 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:54,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 09:31:54,247 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:54,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:54,248 INFO L85 PathProgramCache]: Analyzing trace with hash -884403507, now seen corresponding path program 1 times [2024-11-18 09:31:54,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:31:54,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775381856] [2024-11-18 09:31:54,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:54,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:31:54,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:54,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:31:54,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:31:54,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775381856] [2024-11-18 09:31:54,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775381856] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:31:54,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950028552] [2024-11-18 09:31:54,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:54,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:31:54,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:31:54,491 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 09:31:54,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 09:31:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:54,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-18 09:31:54,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:54,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:31:54,681 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:31:54,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:31:54,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950028552] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:31:54,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 09:31:54,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-18 09:31:54,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260971460] [2024-11-18 09:31:54,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 09:31:54,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 09:31:54,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:31:54,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 09:31:54,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-18 09:31:54,772 INFO L87 Difference]: Start difference. First operand 95 states and 143 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 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-11-18 09:31:54,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:54,908 INFO L93 Difference]: Finished difference Result 238 states and 366 transitions. [2024-11-18 09:31:54,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 09:31:54,908 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 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 42 [2024-11-18 09:31:54,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:54,910 INFO L225 Difference]: With dead ends: 238 [2024-11-18 09:31:54,910 INFO L226 Difference]: Without dead ends: 152 [2024-11-18 09:31:54,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 81 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-11-18 09:31:54,912 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 230 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:54,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 434 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:31:54,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-18 09:31:54,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2024-11-18 09:31:54,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 1.5165562913907285) internal successors, (229), 151 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:31:54,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 229 transitions. [2024-11-18 09:31:54,924 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 229 transitions. Word has length 42 [2024-11-18 09:31:54,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:54,924 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 229 transitions. [2024-11-18 09:31:54,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 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-11-18 09:31:54,924 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 229 transitions. [2024-11-18 09:31:54,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-18 09:31:54,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:54,931 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, 1] [2024-11-18 09:31:54,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-18 09:31:55,132 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-11-18 09:31:55,133 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:55,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:55,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1767930910, now seen corresponding path program 1 times [2024-11-18 09:31:55,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:31:55,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309792018] [2024-11-18 09:31:55,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:55,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:31:55,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:55,485 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 43 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-18 09:31:55,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:31:55,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309792018] [2024-11-18 09:31:55,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309792018] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:31:55,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568123154] [2024-11-18 09:31:55,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:55,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:31:55,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:31:55,492 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 09:31:55,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-18 09:31:55,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:55,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-18 09:31:55,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:55,672 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 43 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-18 09:31:55,676 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:31:55,787 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 43 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-18 09:31:55,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568123154] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:31:55,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 09:31:55,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-11-18 09:31:55,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578379441] [2024-11-18 09:31:55,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 09:31:55,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-18 09:31:55,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:31:55,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-18 09:31:55,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-18 09:31:55,790 INFO L87 Difference]: Start difference. First operand 152 states and 229 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:31:55,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:55,945 INFO L93 Difference]: Finished difference Result 258 states and 392 transitions. [2024-11-18 09:31:55,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 09:31:55,945 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 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 76 [2024-11-18 09:31:55,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:55,947 INFO L225 Difference]: With dead ends: 258 [2024-11-18 09:31:55,947 INFO L226 Difference]: Without dead ends: 152 [2024-11-18 09:31:55,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 150 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-11-18 09:31:55,949 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 180 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:55,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 886 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:31:55,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-18 09:31:55,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2024-11-18 09:31:55,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 1.490066225165563) internal successors, (225), 151 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:31:55,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 225 transitions. [2024-11-18 09:31:55,960 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 225 transitions. Word has length 76 [2024-11-18 09:31:55,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:55,961 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 225 transitions. [2024-11-18 09:31:55,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:31:55,961 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 225 transitions. [2024-11-18 09:31:55,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-18 09:31:55,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:55,963 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, 1] [2024-11-18 09:31:55,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-18 09:31:56,165 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-11-18 09:31:56,166 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:56,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:56,166 INFO L85 PathProgramCache]: Analyzing trace with hash 804295714, now seen corresponding path program 2 times [2024-11-18 09:31:56,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:31:56,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101161969] [2024-11-18 09:31:56,167 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 09:31:56,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:31:56,201 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 09:31:56,202 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 09:31:56,455 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:31:56,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:31:56,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101161969] [2024-11-18 09:31:56,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101161969] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:31:56,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837617034] [2024-11-18 09:31:56,456 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 09:31:56,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:31:56,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:31:56,460 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-11-18 09:31:56,462 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-11-18 09:31:56,586 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 09:31:56,586 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 09:31:56,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-18 09:31:56,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:56,678 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:31:56,678 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:31:56,881 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:31:56,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837617034] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:31:56,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 09:31:56,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-18 09:31:56,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920354578] [2024-11-18 09:31:56,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 09:31:56,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-18 09:31:56,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:31:56,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-18 09:31:56,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2024-11-18 09:31:56,884 INFO L87 Difference]: Start difference. First operand 152 states and 225 transitions. Second operand has 13 states, 13 states have (on average 9.846153846153847) internal successors, (128), 13 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:31:57,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:57,241 INFO L93 Difference]: Finished difference Result 348 states and 520 transitions. [2024-11-18 09:31:57,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-18 09:31:57,242 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.846153846153847) internal successors, (128), 13 states have internal predecessors, (128), 0 states have call successors, (0), 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 78 [2024-11-18 09:31:57,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:57,243 INFO L225 Difference]: With dead ends: 348 [2024-11-18 09:31:57,244 INFO L226 Difference]: Without dead ends: 284 [2024-11-18 09:31:57,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 150 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-11-18 09:31:57,245 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 744 mSDsluCounter, 1078 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 744 SdHoareTripleChecker+Valid, 1295 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:57,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [744 Valid, 1295 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 09:31:57,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-18 09:31:57,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2024-11-18 09:31:57,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 1.4734982332155477) internal successors, (417), 283 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:31:57,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 417 transitions. [2024-11-18 09:31:57,271 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 417 transitions. Word has length 78 [2024-11-18 09:31:57,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:57,271 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 417 transitions. [2024-11-18 09:31:57,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.846153846153847) internal successors, (128), 13 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:31:57,272 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 417 transitions. [2024-11-18 09:31:57,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-18 09:31:57,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:57,283 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-11-18 09:31:57,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-18 09:31:57,484 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-11-18 09:31:57,484 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:57,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:57,485 INFO L85 PathProgramCache]: Analyzing trace with hash -781778100, now seen corresponding path program 3 times [2024-11-18 09:31:57,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:31:57,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747415110] [2024-11-18 09:31:57,485 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-18 09:31:57,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:31:57,546 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-18 09:31:57,547 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 09:31:57,885 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2024-11-18 09:31:57,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:31:57,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747415110] [2024-11-18 09:31:57,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747415110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:57,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:31:57,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-18 09:31:57,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923274778] [2024-11-18 09:31:57,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:57,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-18 09:31:57,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:31:57,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-18 09:31:57,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-18 09:31:57,888 INFO L87 Difference]: Start difference. First operand 284 states and 417 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 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-11-18 09:31:58,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:58,138 INFO L93 Difference]: Finished difference Result 886 states and 1349 transitions. [2024-11-18 09:31:58,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-18 09:31:58,139 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 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 150 [2024-11-18 09:31:58,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:58,143 INFO L225 Difference]: With dead ends: 886 [2024-11-18 09:31:58,143 INFO L226 Difference]: Without dead ends: 613 [2024-11-18 09:31:58,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-18 09:31:58,145 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 107 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:58,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 1167 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 09:31:58,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2024-11-18 09:31:58,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 606. [2024-11-18 09:31:58,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 605 states have (on average 1.4363636363636363) internal successors, (869), 605 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:31:58,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 869 transitions. [2024-11-18 09:31:58,179 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 869 transitions. Word has length 150 [2024-11-18 09:31:58,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:58,183 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 869 transitions. [2024-11-18 09:31:58,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 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-11-18 09:31:58,183 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 869 transitions. [2024-11-18 09:31:58,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-18 09:31:58,185 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:58,185 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, 1] [2024-11-18 09:31:58,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 09:31:58,185 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:58,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:58,186 INFO L85 PathProgramCache]: Analyzing trace with hash 491489678, now seen corresponding path program 1 times [2024-11-18 09:31:58,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:31:58,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931495853] [2024-11-18 09:31:58,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:58,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:31:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:58,482 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 91 proven. 9 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2024-11-18 09:31:58,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:31:58,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931495853] [2024-11-18 09:31:58,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931495853] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:31:58,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010457757] [2024-11-18 09:31:58,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:58,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:31:58,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:31:58,489 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-11-18 09:31:58,491 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-11-18 09:31:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:58,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-18 09:31:58,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:58,894 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 46 proven. 102 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2024-11-18 09:31:58,894 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:31:59,193 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 139 proven. 9 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2024-11-18 09:31:59,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010457757] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:31:59,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 09:31:59,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 6] total 11 [2024-11-18 09:31:59,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745206001] [2024-11-18 09:31:59,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 09:31:59,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-18 09:31:59,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:31:59,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-18 09:31:59,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-18 09:31:59,196 INFO L87 Difference]: Start difference. First operand 606 states and 869 transitions. Second operand has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:31:59,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:59,338 INFO L93 Difference]: Finished difference Result 1457 states and 2069 transitions. [2024-11-18 09:31:59,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-18 09:31:59,339 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 0 states have call successors, (0), 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-11-18 09:31:59,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:59,344 INFO L225 Difference]: With dead ends: 1457 [2024-11-18 09:31:59,344 INFO L226 Difference]: Without dead ends: 922 [2024-11-18 09:31:59,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-18 09:31:59,346 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 71 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:59,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1005 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:31:59,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2024-11-18 09:31:59,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 920. [2024-11-18 09:31:59,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 919 states have (on average 1.3873775843307943) internal successors, (1275), 919 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:31:59,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1275 transitions. [2024-11-18 09:31:59,387 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1275 transitions. Word has length 151 [2024-11-18 09:31:59,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:59,388 INFO L471 AbstractCegarLoop]: Abstraction has 920 states and 1275 transitions. [2024-11-18 09:31:59,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:31:59,389 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1275 transitions. [2024-11-18 09:31:59,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-18 09:31:59,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:59,394 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, 1] [2024-11-18 09:31:59,412 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-11-18 09:31:59,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:31:59,599 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:59,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:59,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1536378128, now seen corresponding path program 1 times [2024-11-18 09:31:59,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:31:59,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980314903] [2024-11-18 09:31:59,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:59,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:31:59,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:00,167 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:32:00,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:32:00,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980314903] [2024-11-18 09:32:00,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980314903] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:32:00,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688630334] [2024-11-18 09:32:00,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:00,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:32:00,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:32:00,170 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-11-18 09:32:00,172 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-11-18 09:32:00,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:00,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-18 09:32:00,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:32:00,353 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2024-11-18 09:32:00,353 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:32:00,423 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2024-11-18 09:32:00,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688630334] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-18 09:32:00,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-18 09:32:00,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [13, 5] total 17 [2024-11-18 09:32:00,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140541447] [2024-11-18 09:32:00,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:32:00,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 09:32:00,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:32:00,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 09:32:00,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2024-11-18 09:32:00,426 INFO L87 Difference]: Start difference. First operand 920 states and 1275 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 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-11-18 09:32:00,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:00,484 INFO L93 Difference]: Finished difference Result 985 states and 1372 transitions. [2024-11-18 09:32:00,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 09:32:00,484 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 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 151 [2024-11-18 09:32:00,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:00,488 INFO L225 Difference]: With dead ends: 985 [2024-11-18 09:32:00,488 INFO L226 Difference]: Without dead ends: 976 [2024-11-18 09:32:00,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 298 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-11-18 09:32:00,490 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 32 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 09:32:00,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 364 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 09:32:00,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-11-18 09:32:00,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 976. [2024-11-18 09:32:00,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 975 states have (on average 1.3958974358974359) internal successors, (1361), 975 states have internal predecessors, (1361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:32:00,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1361 transitions. [2024-11-18 09:32:00,519 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1361 transitions. Word has length 151 [2024-11-18 09:32:00,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:00,519 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1361 transitions. [2024-11-18 09:32:00,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 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-11-18 09:32:00,520 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1361 transitions. [2024-11-18 09:32:00,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-18 09:32:00,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:00,525 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, 1] [2024-11-18 09:32:00,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-18 09:32:00,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:32:00,727 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:00,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:00,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1131494121, now seen corresponding path program 1 times [2024-11-18 09:32:00,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:32:00,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431239837] [2024-11-18 09:32:00,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:00,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:32:00,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:01,238 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:32:01,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:32:01,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431239837] [2024-11-18 09:32:01,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431239837] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:32:01,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725311806] [2024-11-18 09:32:01,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:01,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:32:01,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:32:01,241 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-11-18 09:32:01,243 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-11-18 09:32:01,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:01,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-18 09:32:01,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:32:01,408 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2024-11-18 09:32:01,408 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:32:01,476 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2024-11-18 09:32:01,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725311806] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-18 09:32:01,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-18 09:32:01,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13, 6] total 19 [2024-11-18 09:32:01,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176504799] [2024-11-18 09:32:01,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:32:01,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 09:32:01,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:32:01,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 09:32:01,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2024-11-18 09:32:01,478 INFO L87 Difference]: Start difference. First operand 976 states and 1361 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-11-18 09:32:01,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:01,592 INFO L93 Difference]: Finished difference Result 1017 states and 1419 transitions. [2024-11-18 09:32:01,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 09:32:01,593 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 151 [2024-11-18 09:32:01,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:01,596 INFO L225 Difference]: With dead ends: 1017 [2024-11-18 09:32:01,597 INFO L226 Difference]: Without dead ends: 991 [2024-11-18 09:32:01,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2024-11-18 09:32:01,598 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 478 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.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:32:01,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 478 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:32:01,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2024-11-18 09:32:01,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 991. [2024-11-18 09:32:01,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 990 states have (on average 1.391919191919192) internal successors, (1378), 990 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:32:01,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1378 transitions. [2024-11-18 09:32:01,622 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1378 transitions. Word has length 151 [2024-11-18 09:32:01,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:01,623 INFO L471 AbstractCegarLoop]: Abstraction has 991 states and 1378 transitions. [2024-11-18 09:32:01,623 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-11-18 09:32:01,623 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1378 transitions. [2024-11-18 09:32:01,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-18 09:32:01,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:01,626 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, 1] [2024-11-18 09:32:01,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-18 09:32:01,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:32:01,830 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:01,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:01,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1609635789, now seen corresponding path program 1 times [2024-11-18 09:32:01,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:32:01,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671711132] [2024-11-18 09:32:01,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:01,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:32:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:02,088 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-11-18 09:32:02,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:32:02,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671711132] [2024-11-18 09:32:02,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671711132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:32:02,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:32:02,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 09:32:02,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549212041] [2024-11-18 09:32:02,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:32:02,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 09:32:02,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:32:02,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 09:32:02,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 09:32:02,092 INFO L87 Difference]: Start difference. First operand 991 states and 1378 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 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-11-18 09:32:02,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:02,135 INFO L93 Difference]: Finished difference Result 2261 states and 3168 transitions. [2024-11-18 09:32:02,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 09:32:02,135 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 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 151 [2024-11-18 09:32:02,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:02,140 INFO L225 Difference]: With dead ends: 2261 [2024-11-18 09:32:02,140 INFO L226 Difference]: Without dead ends: 1296 [2024-11-18 09:32:02,142 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-11-18 09:32:02,144 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 7 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 09:32:02,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 384 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 09:32:02,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2024-11-18 09:32:02,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 1296. [2024-11-18 09:32:02,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1296 states, 1295 states have (on average 1.3413127413127413) internal successors, (1737), 1295 states have internal predecessors, (1737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:32:02,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1296 states and 1737 transitions. [2024-11-18 09:32:02,171 INFO L78 Accepts]: Start accepts. Automaton has 1296 states and 1737 transitions. Word has length 151 [2024-11-18 09:32:02,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:02,172 INFO L471 AbstractCegarLoop]: Abstraction has 1296 states and 1737 transitions. [2024-11-18 09:32:02,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 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-11-18 09:32:02,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1296 states and 1737 transitions. [2024-11-18 09:32:02,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-18 09:32:02,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:02,175 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, 1] [2024-11-18 09:32:02,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-18 09:32:02,175 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:02,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:02,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1386917422, now seen corresponding path program 2 times [2024-11-18 09:32:02,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:32:02,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720427375] [2024-11-18 09:32:02,177 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 09:32:02,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:32:02,213 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 09:32:02,213 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 09:32:02,654 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 0 proven. 533 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:32:02,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:32:02,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720427375] [2024-11-18 09:32:02,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720427375] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:32:02,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846670396] [2024-11-18 09:32:02,655 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 09:32:02,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:32:02,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:32:02,657 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-11-18 09:32:02,659 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-11-18 09:32:02,779 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 09:32:02,779 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 09:32:02,784 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-18 09:32:02,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:32:03,371 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 44 proven. 65 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2024-11-18 09:32:03,371 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:32:04,039 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 8 proven. 101 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2024-11-18 09:32:04,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846670396] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:32:04,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 09:32:04,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 15] total 37 [2024-11-18 09:32:04,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397387361] [2024-11-18 09:32:04,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 09:32:04,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-18 09:32:04,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:32:04,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-18 09:32:04,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1192, Unknown=0, NotChecked=0, Total=1332 [2024-11-18 09:32:04,044 INFO L87 Difference]: Start difference. First operand 1296 states and 1737 transitions. Second operand has 37 states, 37 states have (on average 6.621621621621622) internal successors, (245), 37 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:32:14,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:14,433 INFO L93 Difference]: Finished difference Result 4124 states and 5777 transitions. [2024-11-18 09:32:14,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 342 states. [2024-11-18 09:32:14,433 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 6.621621621621622) internal successors, (245), 37 states have internal predecessors, (245), 0 states have call successors, (0), 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 152 [2024-11-18 09:32:14,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:14,444 INFO L225 Difference]: With dead ends: 4124 [2024-11-18 09:32:14,445 INFO L226 Difference]: Without dead ends: 3299 [2024-11-18 09:32:14,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 636 GetRequests, 279 SyntacticMatches, 1 SemanticMatches, 356 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55039 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=7332, Invalid=120474, Unknown=0, NotChecked=0, Total=127806 [2024-11-18 09:32:14,476 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 2966 mSDsluCounter, 6124 mSDsCounter, 0 mSdLazyCounter, 5512 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2966 SdHoareTripleChecker+Valid, 6387 SdHoareTripleChecker+Invalid, 5773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 5512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:32:14,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2966 Valid, 6387 Invalid, 5773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 5512 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-18 09:32:14,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3299 states. [2024-11-18 09:32:14,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3299 to 1573. [2024-11-18 09:32:14,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1573 states, 1572 states have (on average 1.3645038167938932) internal successors, (2145), 1572 states have internal predecessors, (2145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:32:14,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2145 transitions. [2024-11-18 09:32:14,521 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2145 transitions. Word has length 152 [2024-11-18 09:32:14,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:14,522 INFO L471 AbstractCegarLoop]: Abstraction has 1573 states and 2145 transitions. [2024-11-18 09:32:14,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 6.621621621621622) internal successors, (245), 37 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:32:14,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2145 transitions. [2024-11-18 09:32:14,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-18 09:32:14,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:14,526 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-11-18 09:32:14,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-18 09:32:14,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:32:14,731 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:14,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:14,731 INFO L85 PathProgramCache]: Analyzing trace with hash -399701351, now seen corresponding path program 1 times [2024-11-18 09:32:14,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:32:14,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525701068] [2024-11-18 09:32:14,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:14,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:32:14,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:15,219 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:32:15,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:32:15,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525701068] [2024-11-18 09:32:15,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525701068] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:32:15,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962041405] [2024-11-18 09:32:15,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:15,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:32:15,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:32:15,222 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-11-18 09:32:15,223 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-11-18 09:32:15,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:15,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-18 09:32:15,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:32:15,410 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2024-11-18 09:32:15,411 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:32:15,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962041405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:32:15,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 09:32:15,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2024-11-18 09:32:15,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828632644] [2024-11-18 09:32:15,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:32:15,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 09:32:15,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:32:15,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 09:32:15,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2024-11-18 09:32:15,413 INFO L87 Difference]: Start difference. First operand 1573 states and 2145 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-11-18 09:32:15,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:15,523 INFO L93 Difference]: Finished difference Result 1594 states and 2172 transitions. [2024-11-18 09:32:15,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 09:32:15,524 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-11-18 09:32:15,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:15,529 INFO L225 Difference]: With dead ends: 1594 [2024-11-18 09:32:15,529 INFO L226 Difference]: Without dead ends: 1567 [2024-11-18 09:32:15,530 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-11-18 09:32:15,530 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:32:15,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 483 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:32:15,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2024-11-18 09:32:15,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1567. [2024-11-18 09:32:15,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1566 states have (on average 1.3633461047254152) internal successors, (2135), 1566 states have internal predecessors, (2135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:32:15,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2135 transitions. [2024-11-18 09:32:15,625 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2135 transitions. Word has length 164 [2024-11-18 09:32:15,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:15,626 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2135 transitions. [2024-11-18 09:32:15,626 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-11-18 09:32:15,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2135 transitions. [2024-11-18 09:32:15,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-18 09:32:15,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:15,630 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-11-18 09:32:15,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-18 09:32:15,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,SelfDestructingSolverStorable10 [2024-11-18 09:32:15,832 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:15,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:15,832 INFO L85 PathProgramCache]: Analyzing trace with hash -297477524, now seen corresponding path program 1 times [2024-11-18 09:32:15,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:32:15,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226482337] [2024-11-18 09:32:15,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:15,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:32:15,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:16,305 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:32:16,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:32:16,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226482337] [2024-11-18 09:32:16,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226482337] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:32:16,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584496353] [2024-11-18 09:32:16,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:16,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:32:16,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:32:16,309 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-11-18 09:32:16,310 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-11-18 09:32:16,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:16,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-18 09:32:16,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:32:16,474 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-18 09:32:16,474 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:32:16,549 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2024-11-18 09:32:16,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584496353] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-18 09:32:16,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-18 09:32:16,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [14, 6] total 18 [2024-11-18 09:32:16,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890942804] [2024-11-18 09:32:16,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:32:16,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 09:32:16,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:32:16,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 09:32:16,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2024-11-18 09:32:16,551 INFO L87 Difference]: Start difference. First operand 1567 states and 2135 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 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-11-18 09:32:16,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:16,581 INFO L93 Difference]: Finished difference Result 1651 states and 2260 transitions. [2024-11-18 09:32:16,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 09:32:16,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 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-11-18 09:32:16,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:16,586 INFO L225 Difference]: With dead ends: 1651 [2024-11-18 09:32:16,586 INFO L226 Difference]: Without dead ends: 1575 [2024-11-18 09:32:16,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2024-11-18 09:32:16,590 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 1 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 09:32:16,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 254 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 09:32:16,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2024-11-18 09:32:16,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1575. [2024-11-18 09:32:16,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1574 states have (on average 1.364040660736976) internal successors, (2147), 1574 states have internal predecessors, (2147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:32:16,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2147 transitions. [2024-11-18 09:32:16,621 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2147 transitions. Word has length 164 [2024-11-18 09:32:16,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:16,621 INFO L471 AbstractCegarLoop]: Abstraction has 1575 states and 2147 transitions. [2024-11-18 09:32:16,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 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-11-18 09:32:16,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2147 transitions. [2024-11-18 09:32:16,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-18 09:32:16,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:16,625 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, 1] [2024-11-18 09:32:16,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-18 09:32:16,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:32:16,826 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:16,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:16,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1823327912, now seen corresponding path program 1 times [2024-11-18 09:32:16,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:32:16,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125676124] [2024-11-18 09:32:16,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:16,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:32:16,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:17,021 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 110 proven. 10 refuted. 0 times theorem prover too weak. 531 trivial. 0 not checked. [2024-11-18 09:32:17,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:32:17,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125676124] [2024-11-18 09:32:17,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125676124] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:32:17,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914271030] [2024-11-18 09:32:17,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:17,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:32:17,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:32:17,024 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-11-18 09:32:17,029 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-11-18 09:32:17,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:17,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-18 09:32:17,156 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:32:17,410 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 90 proven. 111 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-11-18 09:32:17,410 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:32:17,690 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 191 proven. 10 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-11-18 09:32:17,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914271030] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:32:17,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 09:32:17,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 6] total 11 [2024-11-18 09:32:17,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410393484] [2024-11-18 09:32:17,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 09:32:17,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-18 09:32:17,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:32:17,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-18 09:32:17,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-18 09:32:17,692 INFO L87 Difference]: Start difference. First operand 1575 states and 2147 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:32:17,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:17,829 INFO L93 Difference]: Finished difference Result 3718 states and 4999 transitions. [2024-11-18 09:32:17,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-18 09:32:17,830 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 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-11-18 09:32:17,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:17,837 INFO L225 Difference]: With dead ends: 3718 [2024-11-18 09:32:17,838 INFO L226 Difference]: Without dead ends: 2246 [2024-11-18 09:32:17,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-18 09:32:17,840 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 84 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:32:17,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 858 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:32:17,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2246 states. [2024-11-18 09:32:17,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2246 to 2242. [2024-11-18 09:32:17,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2242 states, 2241 states have (on average 1.3119143239625168) internal successors, (2940), 2241 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:32:17,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 2242 states and 2940 transitions. [2024-11-18 09:32:17,928 INFO L78 Accepts]: Start accepts. Automaton has 2242 states and 2940 transitions. Word has length 164 [2024-11-18 09:32:17,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:17,928 INFO L471 AbstractCegarLoop]: Abstraction has 2242 states and 2940 transitions. [2024-11-18 09:32:17,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:32:17,929 INFO L276 IsEmpty]: Start isEmpty. Operand 2242 states and 2940 transitions. [2024-11-18 09:32:17,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-18 09:32:17,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:17,935 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-11-18 09:32:17,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-18 09:32:18,136 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,SelfDestructingSolverStorable12 [2024-11-18 09:32:18,136 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:18,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:18,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1942959529, now seen corresponding path program 1 times [2024-11-18 09:32:18,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:32:18,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060791901] [2024-11-18 09:32:18,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:18,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:32:18,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:18,561 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:32:18,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:32:18,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060791901] [2024-11-18 09:32:18,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060791901] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:32:18,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441208707] [2024-11-18 09:32:18,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:18,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:32:18,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:32:18,564 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-11-18 09:32:18,565 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-11-18 09:32:18,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:18,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-18 09:32:18,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:32:18,741 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-18 09:32:18,741 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:32:18,808 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2024-11-18 09:32:18,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441208707] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-18 09:32:18,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-18 09:32:18,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14, 6] total 20 [2024-11-18 09:32:18,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098275389] [2024-11-18 09:32:18,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:32:18,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 09:32:18,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:32:18,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 09:32:18,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2024-11-18 09:32:18,810 INFO L87 Difference]: Start difference. First operand 2242 states and 2940 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-11-18 09:32:18,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:18,937 INFO L93 Difference]: Finished difference Result 2320 states and 3049 transitions. [2024-11-18 09:32:18,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 09:32:18,937 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-11-18 09:32:18,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:18,944 INFO L225 Difference]: With dead ends: 2320 [2024-11-18 09:32:18,944 INFO L226 Difference]: Without dead ends: 2257 [2024-11-18 09:32:18,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2024-11-18 09:32:18,946 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 478 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.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:32:18,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 478 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:32:18,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2257 states. [2024-11-18 09:32:18,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2257 to 2257. [2024-11-18 09:32:18,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2257 states, 2256 states have (on average 1.31072695035461) internal successors, (2957), 2256 states have internal predecessors, (2957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:32:18,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 2957 transitions. [2024-11-18 09:32:18,998 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 2957 transitions. Word has length 165 [2024-11-18 09:32:18,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:18,998 INFO L471 AbstractCegarLoop]: Abstraction has 2257 states and 2957 transitions. [2024-11-18 09:32:18,998 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-11-18 09:32:18,998 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 2957 transitions. [2024-11-18 09:32:19,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-18 09:32:19,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:19,003 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-11-18 09:32:19,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-18 09:32:19,203 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,SelfDestructingSolverStorable13 [2024-11-18 09:32:19,204 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:19,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:19,205 INFO L85 PathProgramCache]: Analyzing trace with hash -501847604, now seen corresponding path program 1 times [2024-11-18 09:32:19,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:32:19,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357896781] [2024-11-18 09:32:19,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:19,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:32:19,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:19,669 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:32:19,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:32:19,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357896781] [2024-11-18 09:32:19,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357896781] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:32:19,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335946883] [2024-11-18 09:32:19,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:19,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:32:19,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:32:19,673 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-11-18 09:32:19,674 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-11-18 09:32:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:19,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-18 09:32:19,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:32:19,847 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-18 09:32:19,848 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:32:19,920 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2024-11-18 09:32:19,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335946883] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-18 09:32:19,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-18 09:32:19,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14, 6] total 20 [2024-11-18 09:32:19,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361197260] [2024-11-18 09:32:19,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:32:19,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 09:32:19,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:32:19,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 09:32:19,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2024-11-18 09:32:19,922 INFO L87 Difference]: Start difference. First operand 2257 states and 2957 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-11-18 09:32:20,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:20,341 INFO L93 Difference]: Finished difference Result 2448 states and 3232 transitions. [2024-11-18 09:32:20,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 09:32:20,342 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-11-18 09:32:20,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:20,348 INFO L225 Difference]: With dead ends: 2448 [2024-11-18 09:32:20,348 INFO L226 Difference]: Without dead ends: 2273 [2024-11-18 09:32:20,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2024-11-18 09:32:20,350 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 09:32:20,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 479 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 09:32:20,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2273 states. [2024-11-18 09:32:20,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2273 to 2273. [2024-11-18 09:32:20,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2273 states, 2272 states have (on average 1.310299295774648) internal successors, (2977), 2272 states have internal predecessors, (2977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:32:20,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2273 states to 2273 states and 2977 transitions. [2024-11-18 09:32:20,402 INFO L78 Accepts]: Start accepts. Automaton has 2273 states and 2977 transitions. Word has length 165 [2024-11-18 09:32:20,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:20,403 INFO L471 AbstractCegarLoop]: Abstraction has 2273 states and 2977 transitions. [2024-11-18 09:32:20,403 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-11-18 09:32:20,403 INFO L276 IsEmpty]: Start isEmpty. Operand 2273 states and 2977 transitions. [2024-11-18 09:32:20,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-18 09:32:20,407 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:20,407 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, 1] [2024-11-18 09:32:20,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-18 09:32:20,608 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,SelfDestructingSolverStorable14 [2024-11-18 09:32:20,608 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:20,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:20,609 INFO L85 PathProgramCache]: Analyzing trace with hash 824441022, now seen corresponding path program 2 times [2024-11-18 09:32:20,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:32:20,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524721952] [2024-11-18 09:32:20,609 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 09:32:20,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:32:20,654 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 09:32:20,654 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 09:32:21,069 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 0 proven. 652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:32:21,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:32:21,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524721952] [2024-11-18 09:32:21,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524721952] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:32:21,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179596312] [2024-11-18 09:32:21,069 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 09:32:21,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:32:21,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:32:21,071 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-11-18 09:32:21,071 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-11-18 09:32:21,168 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 09:32:21,168 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 09:32:21,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-18 09:32:21,171 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:32:21,246 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2024-11-18 09:32:21,247 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:32:21,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179596312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:32:21,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 09:32:21,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2024-11-18 09:32:21,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782376180] [2024-11-18 09:32:21,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:32:21,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 09:32:21,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:32:21,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 09:32:21,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2024-11-18 09:32:21,248 INFO L87 Difference]: Start difference. First operand 2273 states and 2977 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-11-18 09:32:21,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:21,334 INFO L93 Difference]: Finished difference Result 4038 states and 5435 transitions. [2024-11-18 09:32:21,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 09:32:21,335 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 165 [2024-11-18 09:32:21,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:21,342 INFO L225 Difference]: With dead ends: 4038 [2024-11-18 09:32:21,342 INFO L226 Difference]: Without dead ends: 2635 [2024-11-18 09:32:21,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2024-11-18 09:32:21,345 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 44 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 09:32:21,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 532 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 09:32:21,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2635 states. [2024-11-18 09:32:21,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2635 to 2313. [2024-11-18 09:32:21,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2313 states, 2312 states have (on average 1.3222318339100345) internal successors, (3057), 2312 states have internal predecessors, (3057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:32:21,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 3057 transitions. [2024-11-18 09:32:21,396 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 3057 transitions. Word has length 165 [2024-11-18 09:32:21,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:21,397 INFO L471 AbstractCegarLoop]: Abstraction has 2313 states and 3057 transitions. [2024-11-18 09:32:21,397 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-11-18 09:32:21,397 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 3057 transitions. [2024-11-18 09:32:21,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-18 09:32:21,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:21,401 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-11-18 09:32:21,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-18 09:32:21,602 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,SelfDestructingSolverStorable15 [2024-11-18 09:32:21,602 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:21,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:21,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1453570973, now seen corresponding path program 1 times [2024-11-18 09:32:21,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:32:21,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227540124] [2024-11-18 09:32:21,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:21,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:32:21,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:22,030 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 0 proven. 653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:32:22,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:32:22,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227540124] [2024-11-18 09:32:22,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227540124] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:32:22,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576307016] [2024-11-18 09:32:22,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:22,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:32:22,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:32:22,033 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-11-18 09:32:22,035 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-11-18 09:32:22,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:22,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-18 09:32:22,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:32:22,416 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 51 proven. 21 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2024-11-18 09:32:22,416 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:32:22,678 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2024-11-18 09:32:22,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576307016] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-18 09:32:22,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-18 09:32:22,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14, 6] total 21 [2024-11-18 09:32:22,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899395906] [2024-11-18 09:32:22,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:32:22,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 09:32:22,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:32:22,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 09:32:22,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2024-11-18 09:32:22,680 INFO L87 Difference]: Start difference. First operand 2313 states and 3057 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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-11-18 09:32:26,736 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-11-18 09:32:30,746 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-11-18 09:32:34,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-11-18 09:32:37,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 09:32:41,147 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-11-18 09:32:44,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.53s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 09:32:49,287 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-11-18 09:32:49,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:49,291 INFO L93 Difference]: Finished difference Result 3160 states and 4130 transitions. [2024-11-18 09:32:49,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 09:32:49,292 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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-11-18 09:32:49,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:49,301 INFO L225 Difference]: With dead ends: 3160 [2024-11-18 09:32:49,302 INFO L226 Difference]: Without dead ends: 2869 [2024-11-18 09:32:49,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 325 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-11-18 09:32:49,304 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 50 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 5 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.6s IncrementalHoareTripleChecker+Time [2024-11-18 09:32:49,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 626 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 63 Invalid, 5 Unknown, 0 Unchecked, 26.6s Time] [2024-11-18 09:32:49,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2869 states. [2024-11-18 09:32:49,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2869 to 2860. [2024-11-18 09:32:49,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2860 states, 2859 states have (on average 1.304302203567681) internal successors, (3729), 2859 states have internal predecessors, (3729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:32:49,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 3729 transitions. [2024-11-18 09:32:49,359 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 3729 transitions. Word has length 166 [2024-11-18 09:32:49,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:49,360 INFO L471 AbstractCegarLoop]: Abstraction has 2860 states and 3729 transitions. [2024-11-18 09:32:49,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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-11-18 09:32:49,360 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 3729 transitions. [2024-11-18 09:32:49,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-18 09:32:49,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:49,366 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-11-18 09:32:49,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-18 09:32:49,570 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-11-18 09:32:49,571 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:49,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:49,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1759868301, now seen corresponding path program 1 times [2024-11-18 09:32:49,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:32:49,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085556407] [2024-11-18 09:32:49,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:49,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:32:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:50,019 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:32:50,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:32:50,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085556407] [2024-11-18 09:32:50,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085556407] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:32:50,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760939520] [2024-11-18 09:32:50,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:50,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:32:50,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:32:50,022 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-11-18 09:32:50,025 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-11-18 09:32:50,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:50,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-18 09:32:50,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:32:50,172 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2024-11-18 09:32:50,172 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:32:50,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760939520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:32:50,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 09:32:50,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2024-11-18 09:32:50,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35289487] [2024-11-18 09:32:50,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:32:50,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 09:32:50,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:32:50,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 09:32:50,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2024-11-18 09:32:50,174 INFO L87 Difference]: Start difference. First operand 2860 states and 3729 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-11-18 09:32:50,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:50,297 INFO L93 Difference]: Finished difference Result 2918 states and 3807 transitions. [2024-11-18 09:32:50,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 09:32:50,298 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-11-18 09:32:50,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:50,306 INFO L225 Difference]: With dead ends: 2918 [2024-11-18 09:32:50,306 INFO L226 Difference]: Without dead ends: 2854 [2024-11-18 09:32:50,307 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-11-18 09:32:50,308 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:32:50,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 483 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:32:50,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2854 states. [2024-11-18 09:32:50,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2854 to 2854. [2024-11-18 09:32:50,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2854 states, 2853 states have (on average 1.30354013319313) internal successors, (3719), 2853 states have internal predecessors, (3719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:32:50,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2854 states to 2854 states and 3719 transitions. [2024-11-18 09:32:50,361 INFO L78 Accepts]: Start accepts. Automaton has 2854 states and 3719 transitions. Word has length 166 [2024-11-18 09:32:50,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:50,362 INFO L471 AbstractCegarLoop]: Abstraction has 2854 states and 3719 transitions. [2024-11-18 09:32:50,362 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-11-18 09:32:50,362 INFO L276 IsEmpty]: Start isEmpty. Operand 2854 states and 3719 transitions. [2024-11-18 09:32:50,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-18 09:32:50,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:50,367 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-11-18 09:32:50,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-18 09:32:50,568 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-11-18 09:32:50,568 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:50,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:50,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1279531701, now seen corresponding path program 1 times [2024-11-18 09:32:50,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:32:50,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706770744] [2024-11-18 09:32:50,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:50,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:32:50,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:50,988 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:32:50,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:32:50,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706770744] [2024-11-18 09:32:50,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706770744] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:32:50,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42636553] [2024-11-18 09:32:50,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:50,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:32:50,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:32:50,991 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-11-18 09:32:50,992 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-11-18 09:32:51,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:51,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-18 09:32:51,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:32:51,261 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:32:51,261 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:32:51,637 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:32:51,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42636553] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:32:51,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 09:32:51,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2024-11-18 09:32:51,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832525445] [2024-11-18 09:32:51,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 09:32:51,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-18 09:32:51,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:32:51,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-18 09:32:51,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=518, Unknown=0, NotChecked=0, Total=702 [2024-11-18 09:32:51,639 INFO L87 Difference]: Start difference. First operand 2854 states and 3719 transitions. Second operand has 27 states, 27 states have (on average 11.11111111111111) internal successors, (300), 27 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:32:52,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:52,315 INFO L93 Difference]: Finished difference Result 4491 states and 5922 transitions. [2024-11-18 09:32:52,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-18 09:32:52,315 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 11.11111111111111) internal successors, (300), 27 states have internal predecessors, (300), 0 states have call successors, (0), 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-11-18 09:32:52,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:52,330 INFO L225 Difference]: With dead ends: 4491 [2024-11-18 09:32:52,330 INFO L226 Difference]: Without dead ends: 4148 [2024-11-18 09:32:52,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=241, Invalid=629, Unknown=0, NotChecked=0, Total=870 [2024-11-18 09:32:52,335 INFO L432 NwaCegarLoop]: 381 mSDtfsCounter, 1957 mSDsluCounter, 4147 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1957 SdHoareTripleChecker+Valid, 4528 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 09:32:52,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1957 Valid, 4528 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1120 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 09:32:52,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4148 states. [2024-11-18 09:32:52,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4148 to 4089. [2024-11-18 09:32:52,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4089 states, 4088 states have (on average 1.2962328767123288) internal successors, (5299), 4088 states have internal predecessors, (5299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:32:52,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4089 states to 4089 states and 5299 transitions. [2024-11-18 09:32:52,461 INFO L78 Accepts]: Start accepts. Automaton has 4089 states and 5299 transitions. Word has length 166 [2024-11-18 09:32:52,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:52,462 INFO L471 AbstractCegarLoop]: Abstraction has 4089 states and 5299 transitions. [2024-11-18 09:32:52,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 11.11111111111111) internal successors, (300), 27 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:32:52,462 INFO L276 IsEmpty]: Start isEmpty. Operand 4089 states and 5299 transitions. [2024-11-18 09:32:52,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-18 09:32:52,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:52,470 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:32:52,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-18 09:32:52,670 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-11-18 09:32:52,671 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:52,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:52,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1614740328, now seen corresponding path program 2 times [2024-11-18 09:32:52,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:32:52,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241109125] [2024-11-18 09:32:52,671 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 09:32:52,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:32:52,686 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-18 09:32:52,686 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 09:32:52,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2024-11-18 09:32:52,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:32:52,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241109125] [2024-11-18 09:32:52,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241109125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:32:52,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:32:52,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 09:32:52,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073270174] [2024-11-18 09:32:52,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:32:52,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 09:32:52,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:32:52,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 09:32:52,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 09:32:52,729 INFO L87 Difference]: Start difference. First operand 4089 states and 5299 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 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-11-18 09:32:52,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:52,991 INFO L93 Difference]: Finished difference Result 4257 states and 5528 transitions. [2024-11-18 09:32:52,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 09:32:52,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 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 226 [2024-11-18 09:32:52,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:52,999 INFO L225 Difference]: With dead ends: 4257 [2024-11-18 09:32:52,999 INFO L226 Difference]: Without dead ends: 4084 [2024-11-18 09:32:53,001 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-11-18 09:32:53,001 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 09:32:53,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 364 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 09:32:53,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4084 states. [2024-11-18 09:32:53,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4084 to 4084. [2024-11-18 09:32:53,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4084 states, 4083 states have (on average 1.295371050698016) internal successors, (5289), 4083 states have internal predecessors, (5289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:32:53,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4084 states to 4084 states and 5289 transitions. [2024-11-18 09:32:53,087 INFO L78 Accepts]: Start accepts. Automaton has 4084 states and 5289 transitions. Word has length 226 [2024-11-18 09:32:53,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:53,088 INFO L471 AbstractCegarLoop]: Abstraction has 4084 states and 5289 transitions. [2024-11-18 09:32:53,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 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-11-18 09:32:53,088 INFO L276 IsEmpty]: Start isEmpty. Operand 4084 states and 5289 transitions. [2024-11-18 09:32:53,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-18 09:32:53,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:53,097 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 14, 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-11-18 09:32:53,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-18 09:32:53,098 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:53,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:53,098 INFO L85 PathProgramCache]: Analyzing trace with hash 464408699, now seen corresponding path program 1 times [2024-11-18 09:32:53,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:32:53,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692112888] [2024-11-18 09:32:53,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:53,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:32:53,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:53,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1427 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 1305 trivial. 0 not checked. [2024-11-18 09:32:53,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:32:53,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692112888] [2024-11-18 09:32:53,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692112888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:32:53,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:32:53,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-18 09:32:53,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092545719] [2024-11-18 09:32:53,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:32:53,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 09:32:53,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:32:53,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 09:32:53,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-18 09:32:53,770 INFO L87 Difference]: Start difference. First operand 4084 states and 5289 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 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-11-18 09:32:53,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:53,902 INFO L93 Difference]: Finished difference Result 7687 states and 10005 transitions. [2024-11-18 09:32:53,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 09:32:53,903 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 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 226 [2024-11-18 09:32:53,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:53,912 INFO L225 Difference]: With dead ends: 7687 [2024-11-18 09:32:53,912 INFO L226 Difference]: Without dead ends: 4436 [2024-11-18 09:32:53,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-18 09:32:53,917 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 51 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:32:53,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 575 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:32:53,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4436 states. [2024-11-18 09:32:53,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4436 to 4179. [2024-11-18 09:32:53,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4179 states, 4178 states have (on average 1.2745332695069411) internal successors, (5325), 4178 states have internal predecessors, (5325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:32:53,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4179 states to 4179 states and 5325 transitions. [2024-11-18 09:32:53,996 INFO L78 Accepts]: Start accepts. Automaton has 4179 states and 5325 transitions. Word has length 226 [2024-11-18 09:32:53,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:53,997 INFO L471 AbstractCegarLoop]: Abstraction has 4179 states and 5325 transitions. [2024-11-18 09:32:53,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 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-11-18 09:32:53,997 INFO L276 IsEmpty]: Start isEmpty. Operand 4179 states and 5325 transitions. [2024-11-18 09:32:54,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-18 09:32:54,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:54,004 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] [2024-11-18 09:32:54,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-18 09:32:54,005 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:54,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:54,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1937369430, now seen corresponding path program 1 times [2024-11-18 09:32:54,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:32:54,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347511387] [2024-11-18 09:32:54,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:54,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:32:54,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:54,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 1337 trivial. 0 not checked. [2024-11-18 09:32:54,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:32:54,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347511387] [2024-11-18 09:32:54,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347511387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:32:54,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:32:54,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 09:32:54,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694225905] [2024-11-18 09:32:54,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:32:54,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 09:32:54,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:32:54,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 09:32:54,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 09:32:54,336 INFO L87 Difference]: Start difference. First operand 4179 states and 5325 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-11-18 09:32:54,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:54,480 INFO L93 Difference]: Finished difference Result 4306 states and 5504 transitions. [2024-11-18 09:32:54,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 09:32:54,481 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 227 [2024-11-18 09:32:54,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:54,488 INFO L225 Difference]: With dead ends: 4306 [2024-11-18 09:32:54,488 INFO L226 Difference]: Without dead ends: 4140 [2024-11-18 09:32:54,489 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-11-18 09:32:54,490 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 49 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:32:54,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 472 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:32:54,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4140 states. [2024-11-18 09:32:54,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4140 to 4128. [2024-11-18 09:32:54,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4128 states, 4127 states have (on average 1.271868185122365) internal successors, (5249), 4127 states have internal predecessors, (5249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:32:54,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4128 states to 4128 states and 5249 transitions. [2024-11-18 09:32:54,569 INFO L78 Accepts]: Start accepts. Automaton has 4128 states and 5249 transitions. Word has length 227 [2024-11-18 09:32:54,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:54,570 INFO L471 AbstractCegarLoop]: Abstraction has 4128 states and 5249 transitions. [2024-11-18 09:32:54,570 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-11-18 09:32:54,570 INFO L276 IsEmpty]: Start isEmpty. Operand 4128 states and 5249 transitions. [2024-11-18 09:32:54,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-18 09:32:54,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:54,577 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:32:54,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-18 09:32:54,577 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:54,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:54,578 INFO L85 PathProgramCache]: Analyzing trace with hash 137790637, now seen corresponding path program 1 times [2024-11-18 09:32:54,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:32:54,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475022336] [2024-11-18 09:32:54,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:54,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:32:54,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:55,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2024-11-18 09:32:55,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:32:55,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475022336] [2024-11-18 09:32:55,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475022336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:32:55,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:32:55,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 09:32:55,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863219026] [2024-11-18 09:32:55,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:32:55,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 09:32:55,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:32:55,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 09:32:55,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 09:32:55,034 INFO L87 Difference]: Start difference. First operand 4128 states and 5249 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-11-18 09:32:55,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:55,144 INFO L93 Difference]: Finished difference Result 4243 states and 5409 transitions. [2024-11-18 09:32:55,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 09:32:55,144 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 227 [2024-11-18 09:32:55,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:55,152 INFO L225 Difference]: With dead ends: 4243 [2024-11-18 09:32:55,152 INFO L226 Difference]: Without dead ends: 4137 [2024-11-18 09:32:55,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 09:32:55,154 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:32:55,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 483 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:32:55,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4137 states. [2024-11-18 09:32:55,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4137 to 4137. [2024-11-18 09:32:55,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4137 states, 4136 states have (on average 1.2707930367504836) internal successors, (5256), 4136 states have internal predecessors, (5256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:32:55,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4137 states to 4137 states and 5256 transitions. [2024-11-18 09:32:55,228 INFO L78 Accepts]: Start accepts. Automaton has 4137 states and 5256 transitions. Word has length 227 [2024-11-18 09:32:55,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:55,228 INFO L471 AbstractCegarLoop]: Abstraction has 4137 states and 5256 transitions. [2024-11-18 09:32:55,228 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-11-18 09:32:55,228 INFO L276 IsEmpty]: Start isEmpty. Operand 4137 states and 5256 transitions. [2024-11-18 09:32:55,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-18 09:32:55,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:55,235 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:32:55,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-18 09:32:55,235 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:55,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:55,236 INFO L85 PathProgramCache]: Analyzing trace with hash 637244700, now seen corresponding path program 1 times [2024-11-18 09:32:55,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:32:55,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546275770] [2024-11-18 09:32:55,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:55,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:32:55,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:55,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2024-11-18 09:32:55,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:32:55,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546275770] [2024-11-18 09:32:55,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546275770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:32:55,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:32:55,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 09:32:55,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831211737] [2024-11-18 09:32:55,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:32:55,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 09:32:55,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:32:55,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 09:32:55,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 09:32:55,651 INFO L87 Difference]: Start difference. First operand 4137 states and 5256 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-11-18 09:32:55,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:56,000 INFO L93 Difference]: Finished difference Result 4375 states and 5586 transitions. [2024-11-18 09:32:56,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 09:32:56,000 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 227 [2024-11-18 09:32:56,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:56,007 INFO L225 Difference]: With dead ends: 4375 [2024-11-18 09:32:56,007 INFO L226 Difference]: Without dead ends: 4149 [2024-11-18 09:32:56,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 09:32:56,010 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 09:32:56,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 484 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 09:32:56,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4149 states. [2024-11-18 09:32:56,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4149 to 4149. [2024-11-18 09:32:56,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4149 states, 4148 states have (on average 1.2700096432015429) internal successors, (5268), 4148 states have internal predecessors, (5268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:32:56,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4149 states to 4149 states and 5268 transitions. [2024-11-18 09:32:56,081 INFO L78 Accepts]: Start accepts. Automaton has 4149 states and 5268 transitions. Word has length 227 [2024-11-18 09:32:56,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:56,082 INFO L471 AbstractCegarLoop]: Abstraction has 4149 states and 5268 transitions. [2024-11-18 09:32:56,085 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-11-18 09:32:56,085 INFO L276 IsEmpty]: Start isEmpty. Operand 4149 states and 5268 transitions. [2024-11-18 09:32:56,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-18 09:32:56,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:56,093 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 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] [2024-11-18 09:32:56,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-18 09:32:56,093 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:56,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:56,093 INFO L85 PathProgramCache]: Analyzing trace with hash -382214302, now seen corresponding path program 2 times [2024-11-18 09:32:56,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:32:56,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194575809] [2024-11-18 09:32:56,094 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 09:32:56,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:32:56,160 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 09:32:56,161 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 09:32:56,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 1382 trivial. 0 not checked. [2024-11-18 09:32:56,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:32:56,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194575809] [2024-11-18 09:32:56,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194575809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:32:56,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:32:56,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 09:32:56,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815192040] [2024-11-18 09:32:56,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:32:56,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 09:32:56,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:32:56,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 09:32:56,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 09:32:56,536 INFO L87 Difference]: Start difference. First operand 4149 states and 5268 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:32:57,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 09:32:58,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:58,004 INFO L93 Difference]: Finished difference Result 4447 states and 5684 transitions. [2024-11-18 09:32:58,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 09:32:58,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 227 [2024-11-18 09:32:58,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:58,010 INFO L225 Difference]: With dead ends: 4447 [2024-11-18 09:32:58,010 INFO L226 Difference]: Without dead ends: 4161 [2024-11-18 09:32:58,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-11-18 09:32:58,012 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 16 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-18 09:32:58,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 399 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-18 09:32:58,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4161 states. [2024-11-18 09:32:58,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4161 to 4158. [2024-11-18 09:32:58,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4158 states, 4157 states have (on average 1.2689439499639164) internal successors, (5275), 4157 states have internal predecessors, (5275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:32:58,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4158 states to 4158 states and 5275 transitions. [2024-11-18 09:32:58,085 INFO L78 Accepts]: Start accepts. Automaton has 4158 states and 5275 transitions. Word has length 227 [2024-11-18 09:32:58,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:58,085 INFO L471 AbstractCegarLoop]: Abstraction has 4158 states and 5275 transitions. [2024-11-18 09:32:58,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:32:58,086 INFO L276 IsEmpty]: Start isEmpty. Operand 4158 states and 5275 transitions. [2024-11-18 09:32:58,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-18 09:32:58,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:58,091 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] [2024-11-18 09:32:58,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-18 09:32:58,092 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:58,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:58,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1290411357, now seen corresponding path program 1 times [2024-11-18 09:32:58,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:32:58,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707165182] [2024-11-18 09:32:58,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:58,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:32:58,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:58,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2024-11-18 09:32:58,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:32:58,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707165182] [2024-11-18 09:32:58,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707165182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:32:58,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:32:58,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 09:32:58,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506122997] [2024-11-18 09:32:58,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:32:58,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 09:32:58,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:32:58,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 09:32:58,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 09:32:58,312 INFO L87 Difference]: Start difference. First operand 4158 states and 5275 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-11-18 09:32:58,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:58,461 INFO L93 Difference]: Finished difference Result 4202 states and 5323 transitions. [2024-11-18 09:32:58,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 09:32:58,462 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 228 [2024-11-18 09:32:58,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:58,468 INFO L225 Difference]: With dead ends: 4202 [2024-11-18 09:32:58,469 INFO L226 Difference]: Without dead ends: 4162 [2024-11-18 09:32:58,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-11-18 09:32:58,471 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 4 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:32:58,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 331 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:32:58,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4162 states. [2024-11-18 09:32:58,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4162 to 4161. [2024-11-18 09:32:58,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4161 states, 4160 states have (on average 1.26875) internal successors, (5278), 4160 states have internal predecessors, (5278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:32:58,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4161 states to 4161 states and 5278 transitions. [2024-11-18 09:32:58,567 INFO L78 Accepts]: Start accepts. Automaton has 4161 states and 5278 transitions. Word has length 228 [2024-11-18 09:32:58,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:58,567 INFO L471 AbstractCegarLoop]: Abstraction has 4161 states and 5278 transitions. [2024-11-18 09:32:58,568 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-11-18 09:32:58,568 INFO L276 IsEmpty]: Start isEmpty. Operand 4161 states and 5278 transitions. [2024-11-18 09:32:58,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-11-18 09:32:58,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:58,574 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-11-18 09:32:58,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-18 09:32:58,575 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:58,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:58,575 INFO L85 PathProgramCache]: Analyzing trace with hash -799433357, now seen corresponding path program 1 times [2024-11-18 09:32:58,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:32:58,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748332392] [2024-11-18 09:32:58,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:58,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:32:58,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:59,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 76 proven. 16 refuted. 0 times theorem prover too weak. 1336 trivial. 0 not checked. [2024-11-18 09:32:59,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:32:59,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748332392] [2024-11-18 09:32:59,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748332392] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:32:59,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448822462] [2024-11-18 09:32:59,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:59,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:32:59,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:32:59,102 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-11-18 09:32:59,103 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-11-18 09:32:59,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:59,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-18 09:32:59,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:32:59,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2024-11-18 09:32:59,291 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:32:59,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448822462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:32:59,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 09:32:59,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2024-11-18 09:32:59,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9045178] [2024-11-18 09:32:59,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:32:59,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 09:32:59,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:32:59,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 09:32:59,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-18 09:32:59,294 INFO L87 Difference]: Start difference. First operand 4161 states and 5278 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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-11-18 09:32:59,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:59,466 INFO L93 Difference]: Finished difference Result 4275 states and 5433 transitions. [2024-11-18 09:32:59,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 09:32:59,467 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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 229 [2024-11-18 09:32:59,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:59,471 INFO L225 Difference]: With dead ends: 4275 [2024-11-18 09:32:59,471 INFO L226 Difference]: Without dead ends: 4177 [2024-11-18 09:32:59,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-18 09:32:59,472 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 3 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:32:59,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 473 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:32:59,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4177 states. [2024-11-18 09:32:59,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4177 to 4173. [2024-11-18 09:32:59,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4173 states, 4172 states have (on average 1.2679769894534996) internal successors, (5290), 4172 states have internal predecessors, (5290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:32:59,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4173 states to 4173 states and 5290 transitions. [2024-11-18 09:32:59,544 INFO L78 Accepts]: Start accepts. Automaton has 4173 states and 5290 transitions. Word has length 229 [2024-11-18 09:32:59,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:59,544 INFO L471 AbstractCegarLoop]: Abstraction has 4173 states and 5290 transitions. [2024-11-18 09:32:59,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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-11-18 09:32:59,544 INFO L276 IsEmpty]: Start isEmpty. Operand 4173 states and 5290 transitions. [2024-11-18 09:32:59,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-11-18 09:32:59,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:59,553 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:32:59,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-18 09:32:59,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-18 09:32:59,754 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:59,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:59,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1843153373, now seen corresponding path program 1 times [2024-11-18 09:32:59,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:32:59,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070157181] [2024-11-18 09:32:59,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:59,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:32:59,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:00,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2024-11-18 09:33:00,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:33:00,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070157181] [2024-11-18 09:33:00,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070157181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:33:00,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:33:00,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 09:33:00,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511093354] [2024-11-18 09:33:00,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:33:00,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 09:33:00,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:33:00,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 09:33:00,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 09:33:00,062 INFO L87 Difference]: Start difference. First operand 4173 states and 5290 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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-11-18 09:33:01,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 09:33:01,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:33:01,690 INFO L93 Difference]: Finished difference Result 4466 states and 5691 transitions. [2024-11-18 09:33:01,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 09:33:01,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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 229 [2024-11-18 09:33:01,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:33:01,697 INFO L225 Difference]: With dead ends: 4466 [2024-11-18 09:33:01,698 INFO L226 Difference]: Without dead ends: 4185 [2024-11-18 09:33:01,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 09:33:01,700 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-18 09:33:01,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 484 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-18 09:33:01,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4185 states. [2024-11-18 09:33:01,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4185 to 4185. [2024-11-18 09:33:01,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4185 states, 4184 states have (on average 1.2672084130019121) internal successors, (5302), 4184 states have internal predecessors, (5302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:33:01,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4185 states to 4185 states and 5302 transitions. [2024-11-18 09:33:01,771 INFO L78 Accepts]: Start accepts. Automaton has 4185 states and 5302 transitions. Word has length 229 [2024-11-18 09:33:01,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:33:01,771 INFO L471 AbstractCegarLoop]: Abstraction has 4185 states and 5302 transitions. [2024-11-18 09:33:01,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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-11-18 09:33:01,771 INFO L276 IsEmpty]: Start isEmpty. Operand 4185 states and 5302 transitions. [2024-11-18 09:33:01,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-11-18 09:33:01,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:33:01,777 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 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, 1] [2024-11-18 09:33:01,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-18 09:33:01,777 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:33:01,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:33:01,778 INFO L85 PathProgramCache]: Analyzing trace with hash -900550529, now seen corresponding path program 1 times [2024-11-18 09:33:01,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:33:01,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238851001] [2024-11-18 09:33:01,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:01,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:33:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:01,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2024-11-18 09:33:01,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:33:01,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238851001] [2024-11-18 09:33:01,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238851001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:33:01,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:33:01,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 09:33:01,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817967353] [2024-11-18 09:33:01,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:33:01,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 09:33:01,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:33:01,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 09:33:01,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 09:33:01,984 INFO L87 Difference]: Start difference. First operand 4185 states and 5302 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:33:05,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.98s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 09:33:06,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:33:06,127 INFO L93 Difference]: Finished difference Result 4303 states and 5444 transitions. [2024-11-18 09:33:06,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 09:33:06,127 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 229 [2024-11-18 09:33:06,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:33:06,132 INFO L225 Difference]: With dead ends: 4303 [2024-11-18 09:33:06,132 INFO L226 Difference]: Without dead ends: 4186 [2024-11-18 09:33:06,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-11-18 09:33:06,133 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 5 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:33:06,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 329 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-18 09:33:06,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4186 states. [2024-11-18 09:33:06,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4186 to 4186. [2024-11-18 09:33:06,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4186 states, 4185 states have (on average 1.266905615292712) internal successors, (5302), 4185 states have internal predecessors, (5302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:33:06,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4186 states to 4186 states and 5302 transitions. [2024-11-18 09:33:06,206 INFO L78 Accepts]: Start accepts. Automaton has 4186 states and 5302 transitions. Word has length 229 [2024-11-18 09:33:06,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:33:06,207 INFO L471 AbstractCegarLoop]: Abstraction has 4186 states and 5302 transitions. [2024-11-18 09:33:06,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:33:06,207 INFO L276 IsEmpty]: Start isEmpty. Operand 4186 states and 5302 transitions. [2024-11-18 09:33:06,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-11-18 09:33:06,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:33:06,213 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, 1] [2024-11-18 09:33:06,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-18 09:33:06,213 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:33:06,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:33:06,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1763670886, now seen corresponding path program 1 times [2024-11-18 09:33:06,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:33:06,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71012249] [2024-11-18 09:33:06,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:06,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:33:06,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 09:33:06,318 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 09:33:06,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 09:33:06,492 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 09:33:06,497 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 09:33:06,500 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 09:33:06,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-18 09:33:06,509 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:06,596 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 09:33:06,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 09:33:06 BoogieIcfgContainer [2024-11-18 09:33:06,600 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 09:33:06,600 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 09:33:06,600 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 09:33:06,601 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 09:33:06,601 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:31:53" (3/4) ... [2024-11-18 09:33:06,603 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 09:33:06,604 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 09:33:06,605 INFO L158 Benchmark]: Toolchain (without parser) took 75215.25ms. Allocated memory was 165.7MB in the beginning and 625.0MB in the end (delta: 459.3MB). Free memory was 107.2MB in the beginning and 273.6MB in the end (delta: -166.3MB). Peak memory consumption was 293.7MB. Max. memory is 16.1GB. [2024-11-18 09:33:06,605 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory is still 51.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 09:33:06,606 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.72ms. Allocated memory is still 165.7MB. Free memory was 107.2MB in the beginning and 136.3MB in the end (delta: -29.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-18 09:33:06,606 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.78ms. Allocated memory is still 165.7MB. Free memory was 136.3MB in the beginning and 133.5MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-18 09:33:06,606 INFO L158 Benchmark]: Boogie Preprocessor took 56.17ms. Allocated memory is still 165.7MB. Free memory was 133.5MB in the beginning and 131.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 09:33:06,606 INFO L158 Benchmark]: RCFGBuilder took 1705.52ms. Allocated memory is still 165.7MB. Free memory was 131.4MB in the beginning and 104.1MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-18 09:33:06,608 INFO L158 Benchmark]: TraceAbstraction took 73043.65ms. Allocated memory was 165.7MB in the beginning and 625.0MB in the end (delta: 459.3MB). Free memory was 103.4MB in the beginning and 273.6MB in the end (delta: -170.2MB). Peak memory consumption was 291.6MB. Max. memory is 16.1GB. [2024-11-18 09:33:06,608 INFO L158 Benchmark]: Witness Printer took 4.15ms. Allocated memory is still 625.0MB. Free memory is still 273.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 09:33:06,609 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory is still 51.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 348.72ms. Allocated memory is still 165.7MB. Free memory was 107.2MB in the beginning and 136.3MB in the end (delta: -29.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.78ms. Allocated memory is still 165.7MB. Free memory was 136.3MB in the beginning and 133.5MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.17ms. Allocated memory is still 165.7MB. Free memory was 133.5MB in the beginning and 131.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1705.52ms. Allocated memory is still 165.7MB. Free memory was 131.4MB in the beginning and 104.1MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 73043.65ms. Allocated memory was 165.7MB in the beginning and 625.0MB in the end (delta: 459.3MB). Free memory was 103.4MB in the beginning and 273.6MB in the end (delta: -170.2MB). Peak memory consumption was 291.6MB. Max. memory is 16.1GB. * Witness Printer took 4.15ms. Allocated memory is still 625.0MB. Free memory is still 273.6MB. 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, 92 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 72.9s, OverallIterations: 30, TraceHistogramMax: 16, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.2s, AutomataDifference: 49.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 6631 SdHoareTripleChecker+Valid, 40.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6631 mSDsluCounter, 25771 SdHoareTripleChecker+Invalid, 39.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21326 mSDsCounter, 334 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8541 IncrementalHoareTripleChecker+Invalid, 8880 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 334 mSolverCounterUnsat, 4445 mSDtfsCounter, 8541 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4862 GetRequests, 4233 SyntacticMatches, 1 SemanticMatches, 628 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55275 ImplicationChecksByTransitivity, 10.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4186occurred in iteration=29, InterpolantAutomatonStates: 511, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 29 MinimizatonAttempts, 2418 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 14.5s InterpolantComputationTime, 7639 NumberOfCodeBlocks, 7343 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 9141 ConstructedInterpolants, 0 QuantifiedInterpolants, 22630 SizeOfPredicates, 24 NumberOfNonLiveVariables, 6444 ConjunctsInSsa, 205 ConjunctsInUnsatCore, 59 InterpolantComputations, 22 PerfectInterpolantSequences, 30273/39193 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-11-18 09:33:06,648 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/11.0.12-open/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 ../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-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 09:33:08,801 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 09:33:08,888 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-18 09:33:08,894 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 09:33:08,894 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 09:33:08,925 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 09:33:08,925 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 09:33:08,926 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 09:33:08,926 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 09:33:08,927 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 09:33:08,927 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 09:33:08,927 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 09:33:08,928 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 09:33:08,928 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 09:33:08,929 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 09:33:08,929 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 09:33:08,930 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 09:33:08,930 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 09:33:08,930 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 09:33:08,931 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 09:33:08,931 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 09:33:08,935 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 09:33:08,936 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 09:33:08,936 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 09:33:08,936 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 09:33:08,936 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 09:33:08,936 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 09:33:08,937 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 09:33:08,937 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 09:33:08,937 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 09:33:08,937 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 09:33:08,938 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 09:33:08,938 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 09:33:08,938 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 09:33:08,938 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 09:33:08,939 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 09:33:08,939 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 09:33:08,939 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 09:33:08,941 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 09:33:08,942 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 09:33:08,942 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 09:33:08,942 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 09:33:08,943 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 09:33:08,943 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 09:33:08,943 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-11-18 09:33:09,265 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 09:33:09,289 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 09:33:09,292 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 09:33:09,293 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 09:33:09,293 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 09:33:09,295 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/interleave_bits.i