./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount32.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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/hardware-verification-bv/btor2c-lazyMod.twocount32.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 1f88bd3867028d60c5c1c8fa67c55aaa517a9782eae2d2c8498cbbc5893e8cf0 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 00:50:54,120 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 00:50:54,214 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-12 00:50:54,220 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 00:50:54,222 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 00:50:54,259 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 00:50:54,261 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 00:50:54,262 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 00:50:54,263 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 00:50:54,263 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 00:50:54,264 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 00:50:54,264 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 00:50:54,265 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 00:50:54,267 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 00:50:54,268 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 00:50:54,268 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 00:50:54,269 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 00:50:54,269 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 00:50:54,269 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 00:50:54,269 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 00:50:54,270 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 00:50:54,270 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 00:50:54,271 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 00:50:54,271 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 00:50:54,271 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 00:50:54,272 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 00:50:54,272 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 00:50:54,272 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 00:50:54,276 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 00:50:54,277 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 00:50:54,277 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 00:50:54,277 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 00:50:54,277 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 00:50:54,278 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 00:50:54,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 00:50:54,278 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 00:50:54,278 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 00:50:54,278 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 00:50:54,279 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 00:50:54,279 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1f88bd3867028d60c5c1c8fa67c55aaa517a9782eae2d2c8498cbbc5893e8cf0 [2024-11-12 00:50:54,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 00:50:54,581 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 00:50:54,586 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 00:50:54,588 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 00:50:54,588 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 00:50:54,590 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount32.c [2024-11-12 00:50:56,102 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 00:50:56,304 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 00:50:56,305 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount32.c [2024-11-12 00:50:56,313 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db470a55c/d6105f67a881444ebda0c7d965547d6f/FLAG01cf06584 [2024-11-12 00:50:56,682 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db470a55c/d6105f67a881444ebda0c7d965547d6f [2024-11-12 00:50:56,685 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 00:50:56,686 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 00:50:56,688 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 00:50:56,688 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 00:50:56,693 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 00:50:56,693 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:50:56" (1/1) ... [2024-11-12 00:50:56,694 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d7ee9ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:56, skipping insertion in model container [2024-11-12 00:50:56,694 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:50:56" (1/1) ... [2024-11-12 00:50:56,729 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 00:50:56,905 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/hardware-verification-bv/btor2c-lazyMod.twocount32.c[1260,1273] [2024-11-12 00:50:56,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 00:50:56,947 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 00:50:56,959 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/hardware-verification-bv/btor2c-lazyMod.twocount32.c[1260,1273] [2024-11-12 00:50:56,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 00:50:56,990 INFO L204 MainTranslator]: Completed translation [2024-11-12 00:50:56,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:56 WrapperNode [2024-11-12 00:50:56,991 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 00:50:56,992 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 00:50:56,992 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 00:50:56,992 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 00:50:56,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:56" (1/1) ... [2024-11-12 00:50:57,006 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:56" (1/1) ... [2024-11-12 00:50:57,043 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 138 [2024-11-12 00:50:57,044 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 00:50:57,045 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 00:50:57,045 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 00:50:57,045 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 00:50:57,054 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:56" (1/1) ... [2024-11-12 00:50:57,054 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:56" (1/1) ... [2024-11-12 00:50:57,057 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:56" (1/1) ... [2024-11-12 00:50:57,071 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-12 00:50:57,072 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:56" (1/1) ... [2024-11-12 00:50:57,072 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:56" (1/1) ... [2024-11-12 00:50:57,082 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:56" (1/1) ... [2024-11-12 00:50:57,087 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:56" (1/1) ... [2024-11-12 00:50:57,092 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:56" (1/1) ... [2024-11-12 00:50:57,094 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:56" (1/1) ... [2024-11-12 00:50:57,102 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 00:50:57,103 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 00:50:57,103 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 00:50:57,103 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 00:50:57,104 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:56" (1/1) ... [2024-11-12 00:50:57,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 00:50:57,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 00:50:57,150 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-12 00:50:57,157 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-12 00:50:57,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 00:50:57,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 00:50:57,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 00:50:57,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 00:50:57,301 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 00:50:57,303 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 00:50:57,636 INFO L? ?]: Removed 65 outVars from TransFormulas that were not future-live. [2024-11-12 00:50:57,636 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 00:50:57,649 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 00:50:57,650 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 00:50:57,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:50:57 BoogieIcfgContainer [2024-11-12 00:50:57,650 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 00:50:57,654 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 00:50:57,654 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 00:50:57,658 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 00:50:57,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:50:56" (1/3) ... [2024-11-12 00:50:57,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11cd05b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:50:57, skipping insertion in model container [2024-11-12 00:50:57,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:56" (2/3) ... [2024-11-12 00:50:57,660 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11cd05b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:50:57, skipping insertion in model container [2024-11-12 00:50:57,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:50:57" (3/3) ... [2024-11-12 00:50:57,662 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.twocount32.c [2024-11-12 00:50:57,678 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 00:50:57,678 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 00:50:57,734 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 00:50:57,741 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;@7a1a4b2e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 00:50:57,741 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 00:50:57,745 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 40 states have (on average 1.475) internal successors, (59), 41 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-12 00:50:57,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-12 00:50:57,752 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:50:57,753 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:50:57,753 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:50:57,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:50:57,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1332240297, now seen corresponding path program 1 times [2024-11-12 00:50:57,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:50:57,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554170619] [2024-11-12 00:50:57,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:50:57,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:50:57,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:50:58,326 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-12 00:50:58,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:50:58,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554170619] [2024-11-12 00:50:58,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554170619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:50:58,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:50:58,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 00:50:58,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880899139] [2024-11-12 00:50:58,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:50:58,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 00:50:58,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:50:58,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 00:50:58,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:50:58,368 INFO L87 Difference]: Start difference. First operand has 42 states, 40 states have (on average 1.475) internal successors, (59), 41 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) Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 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-12 00:50:58,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:50:58,420 INFO L93 Difference]: Finished difference Result 73 states and 105 transitions. [2024-11-12 00:50:58,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:50:58,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2024-11-12 00:50:58,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:50:58,433 INFO L225 Difference]: With dead ends: 73 [2024-11-12 00:50:58,434 INFO L226 Difference]: Without dead ends: 41 [2024-11-12 00:50:58,437 INFO L434 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-12 00:50:58,443 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:50:58,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:50:58,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-12 00:50:58,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-12 00:50:58,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.425) internal successors, (57), 40 states have internal predecessors, (57), 0 states have call successors, (0), 0 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-12 00:50:58,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 57 transitions. [2024-11-12 00:50:58,484 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 57 transitions. Word has length 15 [2024-11-12 00:50:58,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:50:58,485 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 57 transitions. [2024-11-12 00:50:58,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 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-12 00:50:58,486 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 57 transitions. [2024-11-12 00:50:58,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-12 00:50:58,488 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:50:58,488 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:50:58,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 00:50:58,489 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:50:58,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:50:58,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1648528535, now seen corresponding path program 1 times [2024-11-12 00:50:58,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:50:58,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951801694] [2024-11-12 00:50:58,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:50:58,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:50:58,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:50:58,635 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-12 00:50:58,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:50:58,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951801694] [2024-11-12 00:50:58,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951801694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:50:58,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:50:58,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 00:50:58,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309935164] [2024-11-12 00:50:58,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:50:58,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 00:50:58,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:50:58,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 00:50:58,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:50:58,640 INFO L87 Difference]: Start difference. First operand 41 states and 57 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 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-12 00:50:58,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:50:58,677 INFO L93 Difference]: Finished difference Result 74 states and 103 transitions. [2024-11-12 00:50:58,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:50:58,679 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2024-11-12 00:50:58,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:50:58,679 INFO L225 Difference]: With dead ends: 74 [2024-11-12 00:50:58,680 INFO L226 Difference]: Without dead ends: 43 [2024-11-12 00:50:58,680 INFO L434 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-12 00:50:58,681 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:50:58,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:50:58,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-12 00:50:58,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-12 00:50:58,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 42 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-12 00:50:58,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 59 transitions. [2024-11-12 00:50:58,691 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 59 transitions. Word has length 16 [2024-11-12 00:50:58,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:50:58,691 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 59 transitions. [2024-11-12 00:50:58,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 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-12 00:50:58,692 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 59 transitions. [2024-11-12 00:50:58,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-12 00:50:58,693 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:50:58,693 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:50:58,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 00:50:58,694 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:50:58,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:50:58,696 INFO L85 PathProgramCache]: Analyzing trace with hash -662742910, now seen corresponding path program 1 times [2024-11-12 00:50:58,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:50:58,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535517496] [2024-11-12 00:50:58,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:50:58,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:50:58,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:50:59,060 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-12 00:50:59,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:50:59,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535517496] [2024-11-12 00:50:59,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535517496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:50:59,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:50:59,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 00:50:59,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861666398] [2024-11-12 00:50:59,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:50:59,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 00:50:59,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:50:59,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 00:50:59,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 00:50:59,065 INFO L87 Difference]: Start difference. First operand 43 states and 59 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 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-12 00:50:59,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:50:59,180 INFO L93 Difference]: Finished difference Result 95 states and 130 transitions. [2024-11-12 00:50:59,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:50:59,182 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2024-11-12 00:50:59,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:50:59,183 INFO L225 Difference]: With dead ends: 95 [2024-11-12 00:50:59,183 INFO L226 Difference]: Without dead ends: 62 [2024-11-12 00:50:59,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:50:59,185 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 30 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:50:59,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 225 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:50:59,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-12 00:50:59,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 49. [2024-11-12 00:50:59,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 48 states have internal predecessors, (67), 0 states have call successors, (0), 0 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-12 00:50:59,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 67 transitions. [2024-11-12 00:50:59,197 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 67 transitions. Word has length 17 [2024-11-12 00:50:59,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:50:59,198 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 67 transitions. [2024-11-12 00:50:59,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 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-12 00:50:59,199 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 67 transitions. [2024-11-12 00:50:59,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-12 00:50:59,200 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:50:59,200 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-12 00:50:59,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 00:50:59,201 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:50:59,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:50:59,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1114665294, now seen corresponding path program 1 times [2024-11-12 00:50:59,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:50:59,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854325252] [2024-11-12 00:50:59,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:50:59,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:50:59,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:50:59,774 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:50:59,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:50:59,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854325252] [2024-11-12 00:50:59,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854325252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:50:59,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:50:59,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 00:50:59,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054994047] [2024-11-12 00:50:59,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:50:59,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 00:50:59,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:50:59,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 00:50:59,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:50:59,779 INFO L87 Difference]: Start difference. First operand 49 states and 67 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 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-12 00:50:59,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:50:59,989 INFO L93 Difference]: Finished difference Result 99 states and 135 transitions. [2024-11-12 00:50:59,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 00:50:59,989 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 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-12 00:50:59,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:50:59,993 INFO L225 Difference]: With dead ends: 99 [2024-11-12 00:50:59,993 INFO L226 Difference]: Without dead ends: 66 [2024-11-12 00:50:59,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-12 00:50:59,996 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 28 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 00:50:59,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 168 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 00:50:59,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-12 00:51:00,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 61. [2024-11-12 00:51:00,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.3666666666666667) internal successors, (82), 60 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:51:00,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 82 transitions. [2024-11-12 00:51:00,007 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 82 transitions. Word has length 32 [2024-11-12 00:51:00,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:51:00,008 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 82 transitions. [2024-11-12 00:51:00,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 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-12 00:51:00,009 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 82 transitions. [2024-11-12 00:51:00,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-12 00:51:00,010 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:51:00,010 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:51:00,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 00:51:00,010 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:51:00,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:51:00,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1021666017, now seen corresponding path program 1 times [2024-11-12 00:51:00,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:51:00,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512501172] [2024-11-12 00:51:00,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:51:00,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:51:00,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:51:00,372 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:51:00,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:51:00,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512501172] [2024-11-12 00:51:00,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512501172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:51:00,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:51:00,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 00:51:00,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347571365] [2024-11-12 00:51:00,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:51:00,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 00:51:00,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:51:00,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 00:51:00,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:51:00,375 INFO L87 Difference]: Start difference. First operand 61 states and 82 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 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-12 00:51:00,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:51:00,510 INFO L93 Difference]: Finished difference Result 137 states and 183 transitions. [2024-11-12 00:51:00,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 00:51:00,511 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2024-11-12 00:51:00,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:51:00,512 INFO L225 Difference]: With dead ends: 137 [2024-11-12 00:51:00,513 INFO L226 Difference]: Without dead ends: 102 [2024-11-12 00:51:00,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:51:00,514 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 50 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:51:00,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 324 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:51:00,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-12 00:51:00,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2024-11-12 00:51:00,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.3298969072164948) internal successors, (129), 97 states have internal predecessors, (129), 0 states have call successors, (0), 0 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-12 00:51:00,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 129 transitions. [2024-11-12 00:51:00,523 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 129 transitions. Word has length 33 [2024-11-12 00:51:00,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:51:00,524 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 129 transitions. [2024-11-12 00:51:00,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 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-12 00:51:00,524 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 129 transitions. [2024-11-12 00:51:00,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-12 00:51:00,525 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:51:00,526 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:51:00,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 00:51:00,526 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:51:00,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:51:00,527 INFO L85 PathProgramCache]: Analyzing trace with hash 752614074, now seen corresponding path program 1 times [2024-11-12 00:51:00,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:51:00,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618827514] [2024-11-12 00:51:00,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:51:00,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:51:00,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:51:00,944 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:51:00,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:51:00,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618827514] [2024-11-12 00:51:00,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618827514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:51:00,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:51:00,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 00:51:00,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201642775] [2024-11-12 00:51:00,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:51:00,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 00:51:00,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:51:00,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 00:51:00,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:51:00,947 INFO L87 Difference]: Start difference. First operand 98 states and 129 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 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-12 00:51:01,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:51:01,059 INFO L93 Difference]: Finished difference Result 102 states and 133 transitions. [2024-11-12 00:51:01,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 00:51:01,060 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2024-11-12 00:51:01,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:51:01,061 INFO L225 Difference]: With dead ends: 102 [2024-11-12 00:51:01,061 INFO L226 Difference]: Without dead ends: 71 [2024-11-12 00:51:01,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:51:01,063 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 20 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:51:01,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 157 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:51:01,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-12 00:51:01,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2024-11-12 00:51:01,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.3235294117647058) internal successors, (90), 68 states have internal predecessors, (90), 0 states have call successors, (0), 0 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-12 00:51:01,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 90 transitions. [2024-11-12 00:51:01,073 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 90 transitions. Word has length 33 [2024-11-12 00:51:01,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:51:01,074 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 90 transitions. [2024-11-12 00:51:01,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 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-12 00:51:01,074 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 90 transitions. [2024-11-12 00:51:01,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-12 00:51:01,077 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:51:01,077 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-12 00:51:01,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 00:51:01,078 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:51:01,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:51:01,079 INFO L85 PathProgramCache]: Analyzing trace with hash -2139675296, now seen corresponding path program 1 times [2024-11-12 00:51:01,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:51:01,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882302799] [2024-11-12 00:51:01,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:51:01,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:51:01,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:51:01,487 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:51:01,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:51:01,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882302799] [2024-11-12 00:51:01,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882302799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:51:01,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:51:01,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 00:51:01,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001095681] [2024-11-12 00:51:01,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:51:01,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 00:51:01,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:51:01,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 00:51:01,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 00:51:01,492 INFO L87 Difference]: Start difference. First operand 69 states and 90 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-12 00:51:01,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:51:01,590 INFO L93 Difference]: Finished difference Result 106 states and 140 transitions. [2024-11-12 00:51:01,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:51:01,591 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-11-12 00:51:01,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:51:01,592 INFO L225 Difference]: With dead ends: 106 [2024-11-12 00:51:01,592 INFO L226 Difference]: Without dead ends: 69 [2024-11-12 00:51:01,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 00:51:01,594 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 13 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:51:01,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 156 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:51:01,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-12 00:51:01,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-12 00:51:01,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 68 states have internal predecessors, (89), 0 states have call successors, (0), 0 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-12 00:51:01,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 89 transitions. [2024-11-12 00:51:01,600 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 89 transitions. Word has length 34 [2024-11-12 00:51:01,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:51:01,600 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 89 transitions. [2024-11-12 00:51:01,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-12 00:51:01,600 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 89 transitions. [2024-11-12 00:51:01,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-12 00:51:01,601 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:51:01,601 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:51:01,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 00:51:01,602 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:51:01,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:51:01,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1446209903, now seen corresponding path program 1 times [2024-11-12 00:51:01,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:51:01,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106022913] [2024-11-12 00:51:01,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:51:01,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:51:01,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:51:02,055 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:51:02,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:51:02,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106022913] [2024-11-12 00:51:02,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106022913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:51:02,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:51:02,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 00:51:02,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163665776] [2024-11-12 00:51:02,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:51:02,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 00:51:02,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:51:02,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 00:51:02,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:51:02,059 INFO L87 Difference]: Start difference. First operand 69 states and 89 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-12 00:51:02,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:51:02,179 INFO L93 Difference]: Finished difference Result 108 states and 143 transitions. [2024-11-12 00:51:02,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 00:51:02,180 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-11-12 00:51:02,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:51:02,180 INFO L225 Difference]: With dead ends: 108 [2024-11-12 00:51:02,180 INFO L226 Difference]: Without dead ends: 75 [2024-11-12 00:51:02,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:51:02,182 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 26 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:51:02,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 144 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:51:02,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-12 00:51:02,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2024-11-12 00:51:02,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.3150684931506849) internal successors, (96), 73 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:51:02,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 96 transitions. [2024-11-12 00:51:02,193 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 96 transitions. Word has length 34 [2024-11-12 00:51:02,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:51:02,193 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 96 transitions. [2024-11-12 00:51:02,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-12 00:51:02,194 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 96 transitions. [2024-11-12 00:51:02,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-12 00:51:02,194 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:51:02,194 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:51:02,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 00:51:02,194 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:51:02,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:51:02,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1177157960, now seen corresponding path program 1 times [2024-11-12 00:51:02,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:51:02,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851140989] [2024-11-12 00:51:02,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:51:02,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:51:02,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:51:02,460 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:51:02,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:51:02,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851140989] [2024-11-12 00:51:02,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851140989] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 00:51:02,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727992091] [2024-11-12 00:51:02,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:51:02,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 00:51:02,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 00:51:02,464 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-12 00:51:02,465 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-12 00:51:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:51:02,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-12 00:51:02,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 00:51:02,777 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:51:02,779 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 00:51:02,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727992091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:51:02,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 00:51:02,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2024-11-12 00:51:02,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402861588] [2024-11-12 00:51:02,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:51:02,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 00:51:02,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:51:02,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 00:51:02,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-12 00:51:02,784 INFO L87 Difference]: Start difference. First operand 74 states and 96 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-12 00:51:02,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:51:02,888 INFO L93 Difference]: Finished difference Result 150 states and 196 transitions. [2024-11-12 00:51:02,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 00:51:02,888 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-11-12 00:51:02,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:51:02,889 INFO L225 Difference]: With dead ends: 150 [2024-11-12 00:51:02,891 INFO L226 Difference]: Without dead ends: 112 [2024-11-12 00:51:02,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-12 00:51:02,893 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 65 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:51:02,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 239 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:51:02,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-12 00:51:02,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2024-11-12 00:51:02,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.2897196261682242) internal successors, (138), 107 states have internal predecessors, (138), 0 states have call successors, (0), 0 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-12 00:51:02,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 138 transitions. [2024-11-12 00:51:02,904 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 138 transitions. Word has length 34 [2024-11-12 00:51:02,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:51:02,904 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 138 transitions. [2024-11-12 00:51:02,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-12 00:51:02,905 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 138 transitions. [2024-11-12 00:51:02,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-12 00:51:02,906 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:51:02,906 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:51:02,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 00:51:03,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 00:51:03,108 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:51:03,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:51:03,109 INFO L85 PathProgramCache]: Analyzing trace with hash -322309897, now seen corresponding path program 1 times [2024-11-12 00:51:03,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:51:03,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171159001] [2024-11-12 00:51:03,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:51:03,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:51:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:51:03,370 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:51:03,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:51:03,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171159001] [2024-11-12 00:51:03,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171159001] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 00:51:03,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503332741] [2024-11-12 00:51:03,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:51:03,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 00:51:03,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 00:51:03,374 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-12 00:51:03,375 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-12 00:51:03,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:51:03,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-12 00:51:03,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 00:51:03,680 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:51:03,681 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 00:51:03,983 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:51:03,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503332741] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 00:51:03,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 00:51:03,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 8] total 18 [2024-11-12 00:51:03,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850501115] [2024-11-12 00:51:03,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 00:51:03,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-12 00:51:03,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:51:03,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-12 00:51:03,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2024-11-12 00:51:03,988 INFO L87 Difference]: Start difference. First operand 108 states and 138 transitions. Second operand has 18 states, 18 states have (on average 4.722222222222222) internal successors, (85), 18 states have internal predecessors, (85), 0 states have call successors, (0), 0 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-12 00:51:04,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:51:04,214 INFO L93 Difference]: Finished difference Result 195 states and 254 transitions. [2024-11-12 00:51:04,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 00:51:04,214 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.722222222222222) internal successors, (85), 18 states have internal predecessors, (85), 0 states have call successors, (0), 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 35 [2024-11-12 00:51:04,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:51:04,215 INFO L225 Difference]: With dead ends: 195 [2024-11-12 00:51:04,215 INFO L226 Difference]: Without dead ends: 141 [2024-11-12 00:51:04,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2024-11-12 00:51:04,216 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 97 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:51:04,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 237 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:51:04,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-12 00:51:04,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 117. [2024-11-12 00:51:04,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.2844827586206897) internal successors, (149), 116 states have internal predecessors, (149), 0 states have call successors, (0), 0 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-12 00:51:04,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 149 transitions. [2024-11-12 00:51:04,223 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 149 transitions. Word has length 35 [2024-11-12 00:51:04,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:51:04,223 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 149 transitions. [2024-11-12 00:51:04,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.722222222222222) internal successors, (85), 18 states have internal predecessors, (85), 0 states have call successors, (0), 0 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-12 00:51:04,223 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 149 transitions. [2024-11-12 00:51:04,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-12 00:51:04,224 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:51:04,224 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:51:04,243 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-12 00:51:04,428 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,SelfDestructingSolverStorable9 [2024-11-12 00:51:04,429 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:51:04,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:51:04,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1314653832, now seen corresponding path program 1 times [2024-11-12 00:51:04,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:51:04,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932603325] [2024-11-12 00:51:04,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:51:04,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:51:04,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:51:04,546 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:51:04,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:51:04,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932603325] [2024-11-12 00:51:04,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932603325] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 00:51:04,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354958047] [2024-11-12 00:51:04,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:51:04,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 00:51:04,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 00:51:04,549 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-12 00:51:04,552 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-12 00:51:04,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:51:04,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 00:51:04,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 00:51:04,705 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:51:04,706 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 00:51:04,785 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:51:04,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354958047] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 00:51:04,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 00:51:04,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-12 00:51:04,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031996880] [2024-11-12 00:51:04,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 00:51:04,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 00:51:04,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:51:04,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 00:51:04,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-12 00:51:04,787 INFO L87 Difference]: Start difference. First operand 117 states and 149 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 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-12 00:51:04,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:51:04,913 INFO L93 Difference]: Finished difference Result 243 states and 316 transitions. [2024-11-12 00:51:04,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 00:51:04,914 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 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 36 [2024-11-12 00:51:04,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:51:04,915 INFO L225 Difference]: With dead ends: 243 [2024-11-12 00:51:04,915 INFO L226 Difference]: Without dead ends: 149 [2024-11-12 00:51:04,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-12 00:51:04,916 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 36 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:51:04,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 416 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:51:04,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-12 00:51:04,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 143. [2024-11-12 00:51:04,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.2816901408450705) internal successors, (182), 142 states have internal predecessors, (182), 0 states have call successors, (0), 0 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-12 00:51:04,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 182 transitions. [2024-11-12 00:51:04,923 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 182 transitions. Word has length 36 [2024-11-12 00:51:04,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:51:04,923 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 182 transitions. [2024-11-12 00:51:04,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 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-12 00:51:04,923 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 182 transitions. [2024-11-12 00:51:04,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-12 00:51:04,924 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:51:04,924 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:51:04,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-12 00:51:05,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 00:51:05,129 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:51:05,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:51:05,129 INFO L85 PathProgramCache]: Analyzing trace with hash 773832856, now seen corresponding path program 1 times [2024-11-12 00:51:05,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:51:05,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203319101] [2024-11-12 00:51:05,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:51:05,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:51:05,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:51:05,385 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:51:05,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:51:05,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203319101] [2024-11-12 00:51:05,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203319101] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 00:51:05,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694733199] [2024-11-12 00:51:05,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:51:05,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 00:51:05,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 00:51:05,388 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-12 00:51:05,390 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-12 00:51:05,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:51:05,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-12 00:51:05,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 00:51:05,646 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:51:05,646 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 00:51:05,868 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:51:05,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694733199] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 00:51:05,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 00:51:05,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 17 [2024-11-12 00:51:05,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585273142] [2024-11-12 00:51:05,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 00:51:05,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-12 00:51:05,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:51:05,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-12 00:51:05,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2024-11-12 00:51:05,872 INFO L87 Difference]: Start difference. First operand 143 states and 182 transitions. Second operand has 17 states, 17 states have (on average 4.411764705882353) internal successors, (75), 17 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-12 00:51:06,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:51:06,125 INFO L93 Difference]: Finished difference Result 290 states and 371 transitions. [2024-11-12 00:51:06,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 00:51:06,126 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.411764705882353) internal successors, (75), 17 states have internal predecessors, (75), 0 states have call successors, (0), 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 36 [2024-11-12 00:51:06,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:51:06,127 INFO L225 Difference]: With dead ends: 290 [2024-11-12 00:51:06,127 INFO L226 Difference]: Without dead ends: 205 [2024-11-12 00:51:06,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2024-11-12 00:51:06,128 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 121 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 00:51:06,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 276 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 00:51:06,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-12 00:51:06,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 168. [2024-11-12 00:51:06,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.281437125748503) internal successors, (214), 167 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:51:06,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 214 transitions. [2024-11-12 00:51:06,141 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 214 transitions. Word has length 36 [2024-11-12 00:51:06,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:51:06,142 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 214 transitions. [2024-11-12 00:51:06,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.411764705882353) internal successors, (75), 17 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-12 00:51:06,142 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 214 transitions. [2024-11-12 00:51:06,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-12 00:51:06,147 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:51:06,147 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-12 00:51:06,169 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-12 00:51:06,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 00:51:06,348 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:51:06,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:51:06,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1107423974, now seen corresponding path program 1 times [2024-11-12 00:51:06,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:51:06,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966206280] [2024-11-12 00:51:06,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:51:06,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:51:06,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:51:06,562 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:51:06,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:51:06,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966206280] [2024-11-12 00:51:06,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966206280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:51:06,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:51:06,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 00:51:06,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373773442] [2024-11-12 00:51:06,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:51:06,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 00:51:06,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:51:06,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 00:51:06,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:51:06,565 INFO L87 Difference]: Start difference. First operand 168 states and 214 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 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-12 00:51:06,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:51:06,639 INFO L93 Difference]: Finished difference Result 272 states and 352 transitions. [2024-11-12 00:51:06,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 00:51:06,639 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2024-11-12 00:51:06,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:51:06,641 INFO L225 Difference]: With dead ends: 272 [2024-11-12 00:51:06,641 INFO L226 Difference]: Without dead ends: 172 [2024-11-12 00:51:06,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:51:06,642 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 34 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:51:06,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 230 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:51:06,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-12 00:51:06,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2024-11-12 00:51:06,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.2781065088757397) internal successors, (216), 169 states have internal predecessors, (216), 0 states have call successors, (0), 0 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-12 00:51:06,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 216 transitions. [2024-11-12 00:51:06,651 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 216 transitions. Word has length 37 [2024-11-12 00:51:06,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:51:06,651 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 216 transitions. [2024-11-12 00:51:06,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 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-12 00:51:06,652 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 216 transitions. [2024-11-12 00:51:06,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-12 00:51:06,653 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:51:06,653 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:51:06,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 00:51:06,654 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:51:06,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:51:06,654 INFO L85 PathProgramCache]: Analyzing trace with hash 786696123, now seen corresponding path program 1 times [2024-11-12 00:51:06,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:51:06,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497981348] [2024-11-12 00:51:06,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:51:06,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:51:06,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:51:07,092 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:51:07,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:51:07,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497981348] [2024-11-12 00:51:07,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497981348] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 00:51:07,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843697253] [2024-11-12 00:51:07,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:51:07,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 00:51:07,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 00:51:07,096 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-12 00:51:07,097 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-12 00:51:07,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:51:07,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-12 00:51:07,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 00:51:07,717 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:51:07,718 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 00:51:08,428 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:51:08,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843697253] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 00:51:08,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 00:51:08,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 30 [2024-11-12 00:51:08,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924860798] [2024-11-12 00:51:08,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 00:51:08,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-12 00:51:08,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:51:08,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-12 00:51:08,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=760, Unknown=0, NotChecked=0, Total=870 [2024-11-12 00:51:08,431 INFO L87 Difference]: Start difference. First operand 170 states and 216 transitions. Second operand has 30 states, 30 states have (on average 2.966666666666667) internal successors, (89), 30 states have internal predecessors, (89), 0 states have call successors, (0), 0 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-12 00:51:08,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:51:08,890 INFO L93 Difference]: Finished difference Result 317 states and 404 transitions. [2024-11-12 00:51:08,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-12 00:51:08,891 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.966666666666667) internal successors, (89), 30 states have internal predecessors, (89), 0 states have call successors, (0), 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 38 [2024-11-12 00:51:08,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:51:08,892 INFO L225 Difference]: With dead ends: 317 [2024-11-12 00:51:08,892 INFO L226 Difference]: Without dead ends: 219 [2024-11-12 00:51:08,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=156, Invalid=966, Unknown=0, NotChecked=0, Total=1122 [2024-11-12 00:51:08,893 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 77 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 00:51:08,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 543 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 00:51:08,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-12 00:51:08,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 158. [2024-11-12 00:51:08,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.2802547770700636) internal successors, (201), 157 states have internal predecessors, (201), 0 states have call successors, (0), 0 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-12 00:51:08,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 201 transitions. [2024-11-12 00:51:08,899 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 201 transitions. Word has length 38 [2024-11-12 00:51:08,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:51:08,900 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 201 transitions. [2024-11-12 00:51:08,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.966666666666667) internal successors, (89), 30 states have internal predecessors, (89), 0 states have call successors, (0), 0 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-12 00:51:08,900 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 201 transitions. [2024-11-12 00:51:08,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-12 00:51:08,901 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:51:08,901 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:51:08,918 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-12 00:51:09,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-12 00:51:09,105 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:51:09,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:51:09,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1686129263, now seen corresponding path program 1 times [2024-11-12 00:51:09,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:51:09,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193526806] [2024-11-12 00:51:09,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:51:09,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:51:09,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:51:09,403 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:51:09,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:51:09,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193526806] [2024-11-12 00:51:09,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193526806] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 00:51:09,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295156638] [2024-11-12 00:51:09,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:51:09,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 00:51:09,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 00:51:09,407 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-12 00:51:09,409 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-12 00:51:09,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:51:09,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-12 00:51:09,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 00:51:09,790 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-12 00:51:09,790 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 00:51:10,036 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 31 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:51:10,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295156638] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 00:51:10,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 00:51:10,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 9] total 24 [2024-11-12 00:51:10,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900404178] [2024-11-12 00:51:10,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 00:51:10,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-12 00:51:10,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:51:10,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-12 00:51:10,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2024-11-12 00:51:10,039 INFO L87 Difference]: Start difference. First operand 158 states and 201 transitions. Second operand has 24 states, 24 states have (on average 4.958333333333333) internal successors, (119), 24 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:51:10,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:51:10,530 INFO L93 Difference]: Finished difference Result 326 states and 417 transitions. [2024-11-12 00:51:10,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 00:51:10,530 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.958333333333333) internal successors, (119), 24 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-12 00:51:10,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:51:10,531 INFO L225 Difference]: With dead ends: 326 [2024-11-12 00:51:10,531 INFO L226 Difference]: Without dead ends: 228 [2024-11-12 00:51:10,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=966, Unknown=0, NotChecked=0, Total=1122 [2024-11-12 00:51:10,535 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 80 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 00:51:10,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 360 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 00:51:10,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-12 00:51:10,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 193. [2024-11-12 00:51:10,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 1.28125) internal successors, (246), 192 states have internal predecessors, (246), 0 states have call successors, (0), 0 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-12 00:51:10,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 246 transitions. [2024-11-12 00:51:10,541 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 246 transitions. Word has length 53 [2024-11-12 00:51:10,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:51:10,541 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 246 transitions. [2024-11-12 00:51:10,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.958333333333333) internal successors, (119), 24 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:51:10,541 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 246 transitions. [2024-11-12 00:51:10,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-12 00:51:10,542 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:51:10,542 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:51:10,561 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-12 00:51:10,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-12 00:51:10,743 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:51:10,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:51:10,743 INFO L85 PathProgramCache]: Analyzing trace with hash 664673192, now seen corresponding path program 1 times [2024-11-12 00:51:10,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:51:10,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048135215] [2024-11-12 00:51:10,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:51:10,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:51:10,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:51:11,141 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 29 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:51:11,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:51:11,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048135215] [2024-11-12 00:51:11,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048135215] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 00:51:11,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444183323] [2024-11-12 00:51:11,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:51:11,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 00:51:11,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 00:51:11,144 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-12 00:51:11,146 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-12 00:51:11,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:51:11,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-12 00:51:11,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 00:51:11,574 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 00:51:11,574 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 00:51:11,910 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 00:51:11,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444183323] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 00:51:11,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 00:51:11,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2024-11-12 00:51:11,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461395323] [2024-11-12 00:51:11,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 00:51:11,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-12 00:51:11,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:51:11,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-12 00:51:11,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2024-11-12 00:51:11,912 INFO L87 Difference]: Start difference. First operand 193 states and 246 transitions. Second operand has 20 states, 20 states have (on average 7.2) internal successors, (144), 20 states have internal predecessors, (144), 0 states have call successors, (0), 0 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-12 00:51:12,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:51:12,635 INFO L93 Difference]: Finished difference Result 488 states and 623 transitions. [2024-11-12 00:51:12,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 00:51:12,636 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 7.2) internal successors, (144), 20 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-12 00:51:12,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:51:12,637 INFO L225 Difference]: With dead ends: 488 [2024-11-12 00:51:12,638 INFO L226 Difference]: Without dead ends: 353 [2024-11-12 00:51:12,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=218, Invalid=838, Unknown=0, NotChecked=0, Total=1056 [2024-11-12 00:51:12,639 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 204 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 00:51:12,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 150 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 00:51:12,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-11-12 00:51:12,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 193. [2024-11-12 00:51:12,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 1.2760416666666667) internal successors, (245), 192 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-12 00:51:12,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 245 transitions. [2024-11-12 00:51:12,646 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 245 transitions. Word has length 54 [2024-11-12 00:51:12,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:51:12,646 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 245 transitions. [2024-11-12 00:51:12,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 7.2) internal successors, (144), 20 states have internal predecessors, (144), 0 states have call successors, (0), 0 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-12 00:51:12,647 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 245 transitions. [2024-11-12 00:51:12,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-12 00:51:12,647 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:51:12,648 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:51:12,665 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-12 00:51:12,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 00:51:12,848 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:51:12,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:51:12,849 INFO L85 PathProgramCache]: Analyzing trace with hash 356439302, now seen corresponding path program 1 times [2024-11-12 00:51:12,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:51:12,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98622211] [2024-11-12 00:51:12,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:51:12,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:51:12,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:51:13,299 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:51:13,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:51:13,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98622211] [2024-11-12 00:51:13,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98622211] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 00:51:13,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765310530] [2024-11-12 00:51:13,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:51:13,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 00:51:13,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 00:51:13,302 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-12 00:51:13,304 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-12 00:51:13,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:51:13,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-12 00:51:13,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 00:51:13,753 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-12 00:51:13,753 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 00:51:14,089 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-12 00:51:14,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765310530] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 00:51:14,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 00:51:14,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2024-11-12 00:51:14,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678840034] [2024-11-12 00:51:14,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 00:51:14,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-12 00:51:14,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:51:14,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-12 00:51:14,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2024-11-12 00:51:14,092 INFO L87 Difference]: Start difference. First operand 193 states and 245 transitions. Second operand has 23 states, 23 states have (on average 6.043478260869565) internal successors, (139), 23 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:51:15,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:51:15,096 INFO L93 Difference]: Finished difference Result 611 states and 758 transitions. [2024-11-12 00:51:15,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-12 00:51:15,097 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 6.043478260869565) internal successors, (139), 23 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-12 00:51:15,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:51:15,098 INFO L225 Difference]: With dead ends: 611 [2024-11-12 00:51:15,098 INFO L226 Difference]: Without dead ends: 464 [2024-11-12 00:51:15,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=297, Invalid=1343, Unknown=0, NotChecked=0, Total=1640 [2024-11-12 00:51:15,100 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 235 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 1077 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 1085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 00:51:15,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 250 Invalid, 1085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1077 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 00:51:15,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2024-11-12 00:51:15,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 281. [2024-11-12 00:51:15,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 1.25) internal successors, (350), 280 states have internal predecessors, (350), 0 states have call successors, (0), 0 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-12 00:51:15,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 350 transitions. [2024-11-12 00:51:15,107 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 350 transitions. Word has length 55 [2024-11-12 00:51:15,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:51:15,108 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 350 transitions. [2024-11-12 00:51:15,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.043478260869565) internal successors, (139), 23 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:51:15,108 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 350 transitions. [2024-11-12 00:51:15,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-12 00:51:15,109 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:51:15,109 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:51:15,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-12 00:51:15,313 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,SelfDestructingSolverStorable16 [2024-11-12 00:51:15,314 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:51:15,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:51:15,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1480844755, now seen corresponding path program 1 times [2024-11-12 00:51:15,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:51:15,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993166298] [2024-11-12 00:51:15,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:51:15,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:51:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:51:15,483 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 00:51:15,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:51:15,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993166298] [2024-11-12 00:51:15,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993166298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:51:15,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:51:15,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 00:51:15,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527069099] [2024-11-12 00:51:15,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:51:15,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 00:51:15,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:51:15,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 00:51:15,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-12 00:51:15,485 INFO L87 Difference]: Start difference. First operand 281 states and 350 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 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-12 00:51:15,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:51:15,548 INFO L93 Difference]: Finished difference Result 534 states and 667 transitions. [2024-11-12 00:51:15,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 00:51:15,549 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 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 58 [2024-11-12 00:51:15,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:51:15,550 INFO L225 Difference]: With dead ends: 534 [2024-11-12 00:51:15,550 INFO L226 Difference]: Without dead ends: 293 [2024-11-12 00:51:15,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-12 00:51:15,552 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 41 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:51:15,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 148 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:51:15,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-12 00:51:15,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 222. [2024-11-12 00:51:15,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 221 states have (on average 1.2669683257918551) internal successors, (280), 221 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:51:15,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 280 transitions. [2024-11-12 00:51:15,559 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 280 transitions. Word has length 58 [2024-11-12 00:51:15,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:51:15,559 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 280 transitions. [2024-11-12 00:51:15,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 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-12 00:51:15,559 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 280 transitions. [2024-11-12 00:51:15,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-12 00:51:15,560 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:51:15,560 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:51:15,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-12 00:51:15,561 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:51:15,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:51:15,561 INFO L85 PathProgramCache]: Analyzing trace with hash -581351902, now seen corresponding path program 2 times [2024-11-12 00:51:15,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:51:15,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706207071] [2024-11-12 00:51:15,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:51:15,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:51:15,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:51:16,772 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:51:16,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:51:16,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706207071] [2024-11-12 00:51:16,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706207071] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 00:51:16,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975391440] [2024-11-12 00:51:16,774 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 00:51:16,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 00:51:16,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 00:51:16,776 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-12 00:51:16,777 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-12 00:51:16,972 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 00:51:16,972 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 00:51:16,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 92 conjuncts are in the unsatisfiable core [2024-11-12 00:51:16,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 00:51:34,156 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:51:34,156 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 00:51:53,146 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-12 00:52:07,700 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-12 00:52:13,598 WARN L286 SmtUtils]: Spent 5.54s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)