./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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.diagonal.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 16f8726a4add15d0bf2494bd44888be53eb7bc01110882b6fc03ef148c6d9055 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 18:13:41,559 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:13:41,640 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-08 18:13:41,645 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:13:41,645 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:13:41,675 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:13:41,676 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:13:41,676 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:13:41,677 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:13:41,677 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:13:41,678 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:13:41,678 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:13:41,679 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:13:41,679 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:13:41,680 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:13:41,680 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:13:41,680 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:13:41,681 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 18:13:41,681 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:13:41,681 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:13:41,682 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:13:41,682 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:13:41,683 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:13:41,683 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:13:41,683 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:13:41,684 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:13:41,684 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:13:41,685 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:13:41,685 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:13:41,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:13:41,686 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:13:41,686 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:13:41,686 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:13:41,687 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 18:13:41,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 18:13:41,687 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:13:41,688 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:13:41,688 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:13:41,688 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:13:41,688 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 -> 16f8726a4add15d0bf2494bd44888be53eb7bc01110882b6fc03ef148c6d9055 [2024-11-08 18:13:41,950 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:13:41,982 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:13:41,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:13:41,989 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:13:41,990 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:13:41,991 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal.c [2024-11-08 18:13:43,512 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:13:43,697 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:13:43,697 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal.c [2024-11-08 18:13:43,709 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/390111fe6/fbbc5fece528475ebe7eec907e8b8878/FLAG22113e5ad [2024-11-08 18:13:43,730 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/390111fe6/fbbc5fece528475ebe7eec907e8b8878 [2024-11-08 18:13:43,732 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:13:43,734 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:13:43,738 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:13:43,738 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:13:43,744 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:13:43,745 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:13:43" (1/1) ... [2024-11-08 18:13:43,746 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ef0e26f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:13:43, skipping insertion in model container [2024-11-08 18:13:43,748 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:13:43" (1/1) ... [2024-11-08 18:13:43,777 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:13:43,965 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.diagonal.c[1248,1261] [2024-11-08 18:13:44,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:13:44,071 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:13:44,082 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.diagonal.c[1248,1261] [2024-11-08 18:13:44,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:13:44,158 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:13:44,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:13:44 WrapperNode [2024-11-08 18:13:44,159 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:13:44,161 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:13:44,161 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:13:44,161 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:13:44,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:13:44" (1/1) ... [2024-11-08 18:13:44,182 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:13:44" (1/1) ... [2024-11-08 18:13:44,246 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 266 [2024-11-08 18:13:44,247 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:13:44,248 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:13:44,248 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:13:44,248 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:13:44,262 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:13:44" (1/1) ... [2024-11-08 18:13:44,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:13:44" (1/1) ... [2024-11-08 18:13:44,273 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:13:44" (1/1) ... [2024-11-08 18:13:44,311 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-08 18:13:44,311 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:13:44" (1/1) ... [2024-11-08 18:13:44,312 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:13:44" (1/1) ... [2024-11-08 18:13:44,332 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:13:44" (1/1) ... [2024-11-08 18:13:44,342 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:13:44" (1/1) ... [2024-11-08 18:13:44,349 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:13:44" (1/1) ... [2024-11-08 18:13:44,354 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:13:44" (1/1) ... [2024-11-08 18:13:44,360 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:13:44,361 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:13:44,361 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:13:44,362 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:13:44,365 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:13:44" (1/1) ... [2024-11-08 18:13:44,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:13:44,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 18:13:44,403 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-08 18:13:44,410 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-08 18:13:44,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:13:44,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 18:13:44,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:13:44,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:13:44,595 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:13:44,598 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:13:45,197 INFO L? ?]: Removed 152 outVars from TransFormulas that were not future-live. [2024-11-08 18:13:45,198 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:13:45,221 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:13:45,222 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 18:13:45,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:13:45 BoogieIcfgContainer [2024-11-08 18:13:45,222 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:13:45,226 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:13:45,227 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:13:45,230 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:13:45,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:13:43" (1/3) ... [2024-11-08 18:13:45,231 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59d352fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:13:45, skipping insertion in model container [2024-11-08 18:13:45,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:13:44" (2/3) ... [2024-11-08 18:13:45,231 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59d352fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:13:45, skipping insertion in model container [2024-11-08 18:13:45,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:13:45" (3/3) ... [2024-11-08 18:13:45,233 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.diagonal.c [2024-11-08 18:13:45,249 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:13:45,249 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 18:13:45,301 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:13:45,307 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;@7e405d68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:13:45,307 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 18:13:45,311 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 70 states have (on average 1.4714285714285715) internal successors, (103), 71 states have internal predecessors, (103), 0 states have call successors, (0), 0 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-08 18:13:45,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 18:13:45,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:13:45,318 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:13:45,318 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:13:45,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:13:45,323 INFO L85 PathProgramCache]: Analyzing trace with hash -829897697, now seen corresponding path program 1 times [2024-11-08 18:13:45,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:13:45,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71272526] [2024-11-08 18:13:45,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:13:45,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:13:45,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:13:45,799 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-08 18:13:45,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:13:45,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71272526] [2024-11-08 18:13:45,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71272526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:13:45,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:13:45,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:13:45,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551438636] [2024-11-08 18:13:45,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:13:45,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:13:45,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:13:45,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:13:45,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:13:45,837 INFO L87 Difference]: Start difference. First operand has 72 states, 70 states have (on average 1.4714285714285715) internal successors, (103), 71 states have internal predecessors, (103), 0 states have call successors, (0), 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.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 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-08 18:13:45,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:13:45,890 INFO L93 Difference]: Finished difference Result 133 states and 193 transitions. [2024-11-08 18:13:45,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:13:45,894 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2024-11-08 18:13:45,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:13:45,901 INFO L225 Difference]: With dead ends: 133 [2024-11-08 18:13:45,902 INFO L226 Difference]: Without dead ends: 71 [2024-11-08 18:13:45,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:13:45,909 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 285 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-08 18:13:45,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 285 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:13:45,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-08 18:13:45,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-08 18:13:45,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.4428571428571428) internal successors, (101), 70 states have internal predecessors, (101), 0 states have call successors, (0), 0 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-08 18:13:45,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 101 transitions. [2024-11-08 18:13:45,951 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 101 transitions. Word has length 13 [2024-11-08 18:13:45,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:13:45,952 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 101 transitions. [2024-11-08 18:13:45,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 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-08 18:13:45,952 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 101 transitions. [2024-11-08 18:13:45,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 18:13:45,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:13:45,954 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:13:45,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 18:13:45,955 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:13:45,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:13:45,955 INFO L85 PathProgramCache]: Analyzing trace with hash 44670374, now seen corresponding path program 1 times [2024-11-08 18:13:45,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:13:45,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022258779] [2024-11-08 18:13:45,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:13:45,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:13:45,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:13:46,104 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-08 18:13:46,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:13:46,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022258779] [2024-11-08 18:13:46,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022258779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:13:46,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:13:46,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:13:46,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310592655] [2024-11-08 18:13:46,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:13:46,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:13:46,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:13:46,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:13:46,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:13:46,109 INFO L87 Difference]: Start difference. First operand 71 states and 101 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 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-08 18:13:46,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:13:46,151 INFO L93 Difference]: Finished difference Result 134 states and 191 transitions. [2024-11-08 18:13:46,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:13:46,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2024-11-08 18:13:46,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:13:46,153 INFO L225 Difference]: With dead ends: 134 [2024-11-08 18:13:46,153 INFO L226 Difference]: Without dead ends: 73 [2024-11-08 18:13:46,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:13:46,155 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 281 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-08 18:13:46,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 281 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:13:46,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-08 18:13:46,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-08 18:13:46,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 72 states have internal predecessors, (103), 0 states have call successors, (0), 0 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-08 18:13:46,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 103 transitions. [2024-11-08 18:13:46,171 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 103 transitions. Word has length 14 [2024-11-08 18:13:46,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:13:46,171 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 103 transitions. [2024-11-08 18:13:46,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 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-08 18:13:46,172 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 103 transitions. [2024-11-08 18:13:46,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 18:13:46,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:13:46,172 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:13:46,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 18:13:46,173 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:13:46,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:13:46,175 INFO L85 PathProgramCache]: Analyzing trace with hash 286815704, now seen corresponding path program 1 times [2024-11-08 18:13:46,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:13:46,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116865068] [2024-11-08 18:13:46,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:13:46,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:13:46,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:13:46,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:13:46,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:13:46,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116865068] [2024-11-08 18:13:46,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116865068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:13:46,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:13:46,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 18:13:46,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576028909] [2024-11-08 18:13:46,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:13:46,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:13:46,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:13:46,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:13:46,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:13:46,577 INFO L87 Difference]: Start difference. First operand 73 states and 103 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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-08 18:13:46,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:13:46,688 INFO L93 Difference]: Finished difference Result 185 states and 262 transitions. [2024-11-08 18:13:46,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:13:46,688 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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-08 18:13:46,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:13:46,690 INFO L225 Difference]: With dead ends: 185 [2024-11-08 18:13:46,690 INFO L226 Difference]: Without dead ends: 122 [2024-11-08 18:13:46,690 INFO L431 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-08 18:13:46,691 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 76 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:13:46,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 420 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:13:46,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-08 18:13:46,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 75. [2024-11-08 18:13:46,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.4189189189189189) internal successors, (105), 74 states have internal predecessors, (105), 0 states have call successors, (0), 0 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-08 18:13:46,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 105 transitions. [2024-11-08 18:13:46,699 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 105 transitions. Word has length 15 [2024-11-08 18:13:46,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:13:46,700 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 105 transitions. [2024-11-08 18:13:46,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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-08 18:13:46,700 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 105 transitions. [2024-11-08 18:13:46,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-08 18:13:46,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:13:46,702 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:13:46,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 18:13:46,702 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:13:46,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:13:46,703 INFO L85 PathProgramCache]: Analyzing trace with hash 668881346, now seen corresponding path program 1 times [2024-11-08 18:13:46,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:13:46,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758700229] [2024-11-08 18:13:46,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:13:46,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:13:46,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:13:47,328 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:13:47,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:13:47,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758700229] [2024-11-08 18:13:47,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758700229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:13:47,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:13:47,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:13:47,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968600313] [2024-11-08 18:13:47,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:13:47,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:13:47,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:13:47,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:13:47,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:13:47,333 INFO L87 Difference]: Start difference. First operand 75 states and 105 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:13:47,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:13:47,353 INFO L93 Difference]: Finished difference Result 138 states and 194 transitions. [2024-11-08 18:13:47,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:13:47,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-11-08 18:13:47,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:13:47,354 INFO L225 Difference]: With dead ends: 138 [2024-11-08 18:13:47,355 INFO L226 Difference]: Without dead ends: 75 [2024-11-08 18:13:47,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:13:47,356 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 2 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:13:47,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 185 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:13:47,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-08 18:13:47,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-08 18:13:47,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.4054054054054055) internal successors, (104), 74 states have internal predecessors, (104), 0 states have call successors, (0), 0 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-08 18:13:47,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 104 transitions. [2024-11-08 18:13:47,363 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 104 transitions. Word has length 46 [2024-11-08 18:13:47,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:13:47,363 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 104 transitions. [2024-11-08 18:13:47,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:13:47,364 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 104 transitions. [2024-11-08 18:13:47,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-08 18:13:47,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:13:47,365 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:13:47,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 18:13:47,366 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:13:47,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:13:47,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1964229841, now seen corresponding path program 1 times [2024-11-08 18:13:47,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:13:47,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524378301] [2024-11-08 18:13:47,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:13:47,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:13:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:13:47,664 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:13:47,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:13:47,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524378301] [2024-11-08 18:13:47,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524378301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:13:47,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:13:47,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 18:13:47,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806895770] [2024-11-08 18:13:47,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:13:47,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:13:47,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:13:47,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:13:47,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:13:47,671 INFO L87 Difference]: Start difference. First operand 75 states and 104 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:13:47,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:13:47,822 INFO L93 Difference]: Finished difference Result 193 states and 270 transitions. [2024-11-08 18:13:47,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 18:13:47,823 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-08 18:13:47,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:13:47,825 INFO L225 Difference]: With dead ends: 193 [2024-11-08 18:13:47,828 INFO L226 Difference]: Without dead ends: 79 [2024-11-08 18:13:47,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:13:47,830 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 59 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:13:47,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 583 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:13:47,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-08 18:13:47,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2024-11-08 18:13:47,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.394736842105263) internal successors, (106), 76 states have internal predecessors, (106), 0 states have call successors, (0), 0 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-08 18:13:47,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 106 transitions. [2024-11-08 18:13:47,843 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 106 transitions. Word has length 47 [2024-11-08 18:13:47,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:13:47,846 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 106 transitions. [2024-11-08 18:13:47,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:13:47,847 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 106 transitions. [2024-11-08 18:13:47,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-08 18:13:47,848 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:13:47,848 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:13:47,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 18:13:47,849 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:13:47,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:13:47,849 INFO L85 PathProgramCache]: Analyzing trace with hash -560587831, now seen corresponding path program 1 times [2024-11-08 18:13:47,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:13:47,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121719659] [2024-11-08 18:13:47,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:13:47,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:13:47,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:13:48,308 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:13:48,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:13:48,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121719659] [2024-11-08 18:13:48,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121719659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:13:48,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:13:48,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:13:48,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522961618] [2024-11-08 18:13:48,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:13:48,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:13:48,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:13:48,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:13:48,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:13:48,312 INFO L87 Difference]: Start difference. First operand 77 states and 106 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:13:48,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:13:48,385 INFO L93 Difference]: Finished difference Result 189 states and 262 transitions. [2024-11-08 18:13:48,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:13:48,386 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-11-08 18:13:48,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:13:48,387 INFO L225 Difference]: With dead ends: 189 [2024-11-08 18:13:48,387 INFO L226 Difference]: Without dead ends: 124 [2024-11-08 18:13:48,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:13:48,389 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 51 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:13:48,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 326 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:13:48,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-08 18:13:48,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 118. [2024-11-08 18:13:48,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.393162393162393) internal successors, (163), 117 states have internal predecessors, (163), 0 states have call successors, (0), 0 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-08 18:13:48,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 163 transitions. [2024-11-08 18:13:48,397 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 163 transitions. Word has length 48 [2024-11-08 18:13:48,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:13:48,398 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 163 transitions. [2024-11-08 18:13:48,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:13:48,398 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 163 transitions. [2024-11-08 18:13:48,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-08 18:13:48,399 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:13:48,399 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:13:48,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 18:13:48,400 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:13:48,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:13:48,400 INFO L85 PathProgramCache]: Analyzing trace with hash -601951643, now seen corresponding path program 1 times [2024-11-08 18:13:48,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:13:48,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016857585] [2024-11-08 18:13:48,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:13:48,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:13:48,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:13:49,069 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:13:49,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:13:49,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016857585] [2024-11-08 18:13:49,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016857585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:13:49,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:13:49,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 18:13:49,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817161807] [2024-11-08 18:13:49,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:13:49,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:13:49,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:13:49,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:13:49,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:13:49,073 INFO L87 Difference]: Start difference. First operand 118 states and 163 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:13:49,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:13:49,197 INFO L93 Difference]: Finished difference Result 288 states and 398 transitions. [2024-11-08 18:13:49,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 18:13:49,198 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-11-08 18:13:49,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:13:49,199 INFO L225 Difference]: With dead ends: 288 [2024-11-08 18:13:49,199 INFO L226 Difference]: Without dead ends: 223 [2024-11-08 18:13:49,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-08 18:13:49,201 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 108 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:13:49,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 733 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:13:49,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-08 18:13:49,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 152. [2024-11-08 18:13:49,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 1.3841059602649006) internal successors, (209), 151 states have internal predecessors, (209), 0 states have call successors, (0), 0 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-08 18:13:49,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 209 transitions. [2024-11-08 18:13:49,210 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 209 transitions. Word has length 48 [2024-11-08 18:13:49,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:13:49,210 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 209 transitions. [2024-11-08 18:13:49,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:13:49,210 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 209 transitions. [2024-11-08 18:13:49,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-08 18:13:49,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:13:49,212 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:13:49,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 18:13:49,213 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:13:49,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:13:49,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1286858396, now seen corresponding path program 1 times [2024-11-08 18:13:49,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:13:49,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787088837] [2024-11-08 18:13:49,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:13:49,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:13:49,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:13:49,481 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:13:49,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:13:49,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787088837] [2024-11-08 18:13:49,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787088837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:13:49,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:13:49,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:13:49,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837124505] [2024-11-08 18:13:49,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:13:49,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:13:49,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:13:49,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:13:49,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:13:49,486 INFO L87 Difference]: Start difference. First operand 152 states and 209 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:13:49,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:13:49,524 INFO L93 Difference]: Finished difference Result 277 states and 382 transitions. [2024-11-08 18:13:49,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:13:49,526 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-11-08 18:13:49,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:13:49,527 INFO L225 Difference]: With dead ends: 277 [2024-11-08 18:13:49,527 INFO L226 Difference]: Without dead ends: 152 [2024-11-08 18:13:49,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:13:49,528 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 81 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:13:49,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 178 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:13:49,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-08 18:13:49,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2024-11-08 18:13:49,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 1.3708609271523178) internal successors, (207), 151 states have internal predecessors, (207), 0 states have call successors, (0), 0 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-08 18:13:49,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 207 transitions. [2024-11-08 18:13:49,544 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 207 transitions. Word has length 49 [2024-11-08 18:13:49,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:13:49,544 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 207 transitions. [2024-11-08 18:13:49,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:13:49,545 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 207 transitions. [2024-11-08 18:13:49,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-08 18:13:49,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:13:49,546 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:13:49,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 18:13:49,547 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:13:49,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:13:49,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1600250730, now seen corresponding path program 1 times [2024-11-08 18:13:49,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:13:49,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990231144] [2024-11-08 18:13:49,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:13:49,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:13:49,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:13:49,998 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:13:49,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:13:49,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990231144] [2024-11-08 18:13:49,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990231144] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:13:49,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988389459] [2024-11-08 18:13:50,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:13:50,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:13:50,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 18:13:50,003 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-08 18:13:50,005 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-08 18:13:50,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:13:50,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-08 18:13:50,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:13:50,628 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:13:50,629 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:13:50,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988389459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:13:50,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 18:13:50,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2024-11-08 18:13:50,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269313741] [2024-11-08 18:13:50,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:13:50,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:13:50,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:13:50,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:13:50,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-08 18:13:50,635 INFO L87 Difference]: Start difference. First operand 152 states and 207 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:13:50,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:13:50,895 INFO L93 Difference]: Finished difference Result 285 states and 390 transitions. [2024-11-08 18:13:50,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:13:50,895 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-08 18:13:50,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:13:50,897 INFO L225 Difference]: With dead ends: 285 [2024-11-08 18:13:50,897 INFO L226 Difference]: Without dead ends: 167 [2024-11-08 18:13:50,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-08 18:13:50,898 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 60 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:13:50,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 205 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:13:50,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-08 18:13:50,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 155. [2024-11-08 18:13:50,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 1.3571428571428572) internal successors, (209), 154 states have internal predecessors, (209), 0 states have call successors, (0), 0 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-08 18:13:50,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 209 transitions. [2024-11-08 18:13:50,904 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 209 transitions. Word has length 50 [2024-11-08 18:13:50,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:13:50,905 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 209 transitions. [2024-11-08 18:13:50,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:13:50,905 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 209 transitions. [2024-11-08 18:13:50,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-08 18:13:50,906 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:13:50,906 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:13:50,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 18:13:51,110 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-08 18:13:51,111 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:13:51,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:13:51,112 INFO L85 PathProgramCache]: Analyzing trace with hash 749947663, now seen corresponding path program 1 times [2024-11-08 18:13:51,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:13:51,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579439544] [2024-11-08 18:13:51,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:13:51,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:13:51,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:13:51,673 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:13:51,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:13:51,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579439544] [2024-11-08 18:13:51,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579439544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:13:51,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:13:51,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 18:13:51,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200463786] [2024-11-08 18:13:51,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:13:51,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 18:13:51,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:13:51,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 18:13:51,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:13:51,675 INFO L87 Difference]: Start difference. First operand 155 states and 209 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 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-08 18:13:51,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:13:51,821 INFO L93 Difference]: Finished difference Result 279 states and 376 transitions. [2024-11-08 18:13:51,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 18:13:51,822 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 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 51 [2024-11-08 18:13:51,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:13:51,823 INFO L225 Difference]: With dead ends: 279 [2024-11-08 18:13:51,823 INFO L226 Difference]: Without dead ends: 191 [2024-11-08 18:13:51,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:13:51,824 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 55 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:13:51,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 419 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:13:51,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-08 18:13:51,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 172. [2024-11-08 18:13:51,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 1.345029239766082) internal successors, (230), 171 states have internal predecessors, (230), 0 states have call successors, (0), 0 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-08 18:13:51,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 230 transitions. [2024-11-08 18:13:51,831 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 230 transitions. Word has length 51 [2024-11-08 18:13:51,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:13:51,837 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 230 transitions. [2024-11-08 18:13:51,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 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-08 18:13:51,837 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 230 transitions. [2024-11-08 18:13:51,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-08 18:13:51,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:13:51,839 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:13:51,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 18:13:51,839 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:13:51,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:13:51,840 INFO L85 PathProgramCache]: Analyzing trace with hash -611613326, now seen corresponding path program 1 times [2024-11-08 18:13:51,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:13:51,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991580828] [2024-11-08 18:13:51,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:13:51,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:13:51,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:13:53,027 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:13:53,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:13:53,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991580828] [2024-11-08 18:13:53,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991580828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:13:53,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:13:53,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 18:13:53,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190603280] [2024-11-08 18:13:53,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:13:53,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 18:13:53,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:13:53,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 18:13:53,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-08 18:13:53,031 INFO L87 Difference]: Start difference. First operand 172 states and 230 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-08 18:13:53,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:13:53,280 INFO L93 Difference]: Finished difference Result 315 states and 421 transitions. [2024-11-08 18:13:53,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 18:13:53,280 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 51 [2024-11-08 18:13:53,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:13:53,281 INFO L225 Difference]: With dead ends: 315 [2024-11-08 18:13:53,281 INFO L226 Difference]: Without dead ends: 207 [2024-11-08 18:13:53,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-08 18:13:53,282 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 103 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:13:53,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 426 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:13:53,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-08 18:13:53,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 192. [2024-11-08 18:13:53,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 1.3350785340314135) internal successors, (255), 191 states have internal predecessors, (255), 0 states have call successors, (0), 0 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-08 18:13:53,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 255 transitions. [2024-11-08 18:13:53,288 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 255 transitions. Word has length 51 [2024-11-08 18:13:53,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:13:53,288 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 255 transitions. [2024-11-08 18:13:53,288 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-08 18:13:53,288 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 255 transitions. [2024-11-08 18:13:53,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-08 18:13:53,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:13:53,289 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:13:53,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 18:13:53,290 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:13:53,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:13:53,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1979372487, now seen corresponding path program 1 times [2024-11-08 18:13:53,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:13:53,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773155095] [2024-11-08 18:13:53,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:13:53,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:13:53,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:13:53,925 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:13:53,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:13:53,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773155095] [2024-11-08 18:13:53,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773155095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:13:53,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:13:53,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 18:13:53,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362432361] [2024-11-08 18:13:53,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:13:53,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:13:53,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:13:53,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:13:53,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:13:53,928 INFO L87 Difference]: Start difference. First operand 192 states and 255 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:13:54,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:13:54,070 INFO L93 Difference]: Finished difference Result 302 states and 406 transitions. [2024-11-08 18:13:54,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:13:54,070 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-08 18:13:54,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:13:54,071 INFO L225 Difference]: With dead ends: 302 [2024-11-08 18:13:54,072 INFO L226 Difference]: Without dead ends: 214 [2024-11-08 18:13:54,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:13:54,073 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 53 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:13:54,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 370 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:13:54,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-08 18:13:54,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 190. [2024-11-08 18:13:54,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 189 states have (on average 1.3492063492063493) internal successors, (255), 189 states have internal predecessors, (255), 0 states have call successors, (0), 0 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-08 18:13:54,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 255 transitions. [2024-11-08 18:13:54,077 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 255 transitions. Word has length 52 [2024-11-08 18:13:54,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:13:54,078 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 255 transitions. [2024-11-08 18:13:54,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:13:54,078 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 255 transitions. [2024-11-08 18:13:54,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-08 18:13:54,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:13:54,079 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:13:54,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 18:13:54,079 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:13:54,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:13:54,080 INFO L85 PathProgramCache]: Analyzing trace with hash -849822859, now seen corresponding path program 1 times [2024-11-08 18:13:54,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:13:54,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911033809] [2024-11-08 18:13:54,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:13:54,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:13:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:13:54,583 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:13:54,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:13:54,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911033809] [2024-11-08 18:13:54,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911033809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:13:54,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:13:54,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 18:13:54,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094715128] [2024-11-08 18:13:54,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:13:54,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 18:13:54,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:13:54,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 18:13:54,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:13:54,586 INFO L87 Difference]: Start difference. First operand 190 states and 255 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:13:54,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:13:54,658 INFO L93 Difference]: Finished difference Result 301 states and 404 transitions. [2024-11-08 18:13:54,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 18:13:54,659 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-08 18:13:54,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:13:54,660 INFO L225 Difference]: With dead ends: 301 [2024-11-08 18:13:54,661 INFO L226 Difference]: Without dead ends: 212 [2024-11-08 18:13:54,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:13:54,662 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 50 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:13:54,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 495 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:13:54,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-08 18:13:54,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 206. [2024-11-08 18:13:54,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.3317073170731708) internal successors, (273), 205 states have internal predecessors, (273), 0 states have call successors, (0), 0 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-08 18:13:54,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 273 transitions. [2024-11-08 18:13:54,668 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 273 transitions. Word has length 52 [2024-11-08 18:13:54,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:13:54,668 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 273 transitions. [2024-11-08 18:13:54,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:13:54,669 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 273 transitions. [2024-11-08 18:13:54,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-08 18:13:54,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:13:54,670 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:13:54,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 18:13:54,670 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:13:54,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:13:54,671 INFO L85 PathProgramCache]: Analyzing trace with hash -934888619, now seen corresponding path program 1 times [2024-11-08 18:13:54,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:13:54,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621288716] [2024-11-08 18:13:54,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:13:54,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:13:54,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:13:55,281 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:13:55,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:13:55,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621288716] [2024-11-08 18:13:55,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621288716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:13:55,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:13:55,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 18:13:55,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621449639] [2024-11-08 18:13:55,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:13:55,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:13:55,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:13:55,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:13:55,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:13:55,285 INFO L87 Difference]: Start difference. First operand 206 states and 273 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:13:55,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:13:55,393 INFO L93 Difference]: Finished difference Result 365 states and 490 transitions. [2024-11-08 18:13:55,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 18:13:55,394 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-08 18:13:55,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:13:55,396 INFO L225 Difference]: With dead ends: 365 [2024-11-08 18:13:55,396 INFO L226 Difference]: Without dead ends: 277 [2024-11-08 18:13:55,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-08 18:13:55,397 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 84 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:13:55,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 774 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:13:55,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-11-08 18:13:55,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 160. [2024-11-08 18:13:55,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 1.3270440251572326) internal successors, (211), 159 states have internal predecessors, (211), 0 states have call successors, (0), 0 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-08 18:13:55,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 211 transitions. [2024-11-08 18:13:55,402 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 211 transitions. Word has length 52 [2024-11-08 18:13:55,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:13:55,403 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 211 transitions. [2024-11-08 18:13:55,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:13:55,403 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 211 transitions. [2024-11-08 18:13:55,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-08 18:13:55,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:13:55,404 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:13:55,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 18:13:55,404 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:13:55,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:13:55,404 INFO L85 PathProgramCache]: Analyzing trace with hash 440598411, now seen corresponding path program 1 times [2024-11-08 18:13:55,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:13:55,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612655850] [2024-11-08 18:13:55,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:13:55,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:13:55,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:13:56,029 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:13:56,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:13:56,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612655850] [2024-11-08 18:13:56,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612655850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:13:56,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:13:56,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 18:13:56,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036505437] [2024-11-08 18:13:56,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:13:56,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:13:56,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:13:56,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:13:56,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:13:56,031 INFO L87 Difference]: Start difference. First operand 160 states and 211 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:13:56,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:13:56,260 INFO L93 Difference]: Finished difference Result 231 states and 307 transitions. [2024-11-08 18:13:56,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:13:56,261 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-08 18:13:56,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:13:56,261 INFO L225 Difference]: With dead ends: 231 [2024-11-08 18:13:56,262 INFO L226 Difference]: Without dead ends: 160 [2024-11-08 18:13:56,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-08 18:13:56,264 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 46 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:13:56,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 342 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:13:56,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-08 18:13:56,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2024-11-08 18:13:56,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 1.320754716981132) internal successors, (210), 159 states have internal predecessors, (210), 0 states have call successors, (0), 0 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-08 18:13:56,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 210 transitions. [2024-11-08 18:13:56,269 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 210 transitions. Word has length 53 [2024-11-08 18:13:56,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:13:56,269 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 210 transitions. [2024-11-08 18:13:56,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:13:56,270 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 210 transitions. [2024-11-08 18:13:56,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-08 18:13:56,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:13:56,272 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:13:56,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 18:13:56,272 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:13:56,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:13:56,273 INFO L85 PathProgramCache]: Analyzing trace with hash -825456157, now seen corresponding path program 1 times [2024-11-08 18:13:56,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:13:56,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731290978] [2024-11-08 18:13:56,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:13:56,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:13:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:13:56,465 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:13:56,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:13:56,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731290978] [2024-11-08 18:13:56,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731290978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:13:56,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:13:56,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:13:56,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873217165] [2024-11-08 18:13:56,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:13:56,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:13:56,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:13:56,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:13:56,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:13:56,467 INFO L87 Difference]: Start difference. First operand 160 states and 210 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:13:56,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:13:56,533 INFO L93 Difference]: Finished difference Result 245 states and 324 transitions. [2024-11-08 18:13:56,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:13:56,534 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-08 18:13:56,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:13:56,535 INFO L225 Difference]: With dead ends: 245 [2024-11-08 18:13:56,535 INFO L226 Difference]: Without dead ends: 164 [2024-11-08 18:13:56,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:13:56,536 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 90 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:13:56,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 206 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:13:56,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-08 18:13:56,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2024-11-08 18:13:56,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 1.312883435582822) internal successors, (214), 163 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-08 18:13:56,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 214 transitions. [2024-11-08 18:13:56,542 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 214 transitions. Word has length 53 [2024-11-08 18:13:56,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:13:56,543 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 214 transitions. [2024-11-08 18:13:56,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:13:56,543 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 214 transitions. [2024-11-08 18:13:56,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-08 18:13:56,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:13:56,545 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:13:56,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 18:13:56,545 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:13:56,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:13:56,546 INFO L85 PathProgramCache]: Analyzing trace with hash 2016640248, now seen corresponding path program 1 times [2024-11-08 18:13:56,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:13:56,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639820126] [2024-11-08 18:13:56,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:13:56,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:13:56,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:13:57,517 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:13:57,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:13:57,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639820126] [2024-11-08 18:13:57,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639820126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:13:57,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:13:57,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 18:13:57,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101921319] [2024-11-08 18:13:57,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:13:57,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 18:13:57,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:13:57,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 18:13:57,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-08 18:13:57,520 INFO L87 Difference]: Start difference. First operand 164 states and 214 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:13:57,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:13:57,815 INFO L93 Difference]: Finished difference Result 319 states and 419 transitions. [2024-11-08 18:13:57,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 18:13:57,815 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-08 18:13:57,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:13:57,816 INFO L225 Difference]: With dead ends: 319 [2024-11-08 18:13:57,816 INFO L226 Difference]: Without dead ends: 167 [2024-11-08 18:13:57,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2024-11-08 18:13:57,817 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 182 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:13:57,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 728 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:13:57,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-08 18:13:57,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2024-11-08 18:13:57,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 1.309090909090909) internal successors, (216), 165 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-08 18:13:57,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 216 transitions. [2024-11-08 18:13:57,822 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 216 transitions. Word has length 54 [2024-11-08 18:13:57,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:13:57,822 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 216 transitions. [2024-11-08 18:13:57,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:13:57,823 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 216 transitions. [2024-11-08 18:13:57,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-08 18:13:57,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:13:57,823 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:13:57,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 18:13:57,824 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:13:57,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:13:57,824 INFO L85 PathProgramCache]: Analyzing trace with hash 2082331348, now seen corresponding path program 1 times [2024-11-08 18:13:57,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:13:57,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303771369] [2024-11-08 18:13:57,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:13:57,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:13:57,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:13:58,304 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:13:58,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:13:58,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303771369] [2024-11-08 18:13:58,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303771369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:13:58,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:13:58,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 18:13:58,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209712437] [2024-11-08 18:13:58,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:13:58,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 18:13:58,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:13:58,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 18:13:58,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:13:58,307 INFO L87 Difference]: Start difference. First operand 166 states and 216 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:13:58,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:13:58,469 INFO L93 Difference]: Finished difference Result 272 states and 355 transitions. [2024-11-08 18:13:58,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 18:13:58,470 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-08 18:13:58,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:13:58,471 INFO L225 Difference]: With dead ends: 272 [2024-11-08 18:13:58,471 INFO L226 Difference]: Without dead ends: 152 [2024-11-08 18:13:58,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-08 18:13:58,472 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 52 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:13:58,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 522 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:13:58,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-08 18:13:58,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2024-11-08 18:13:58,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 1.2913907284768211) internal successors, (195), 151 states have internal predecessors, (195), 0 states have call successors, (0), 0 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-08 18:13:58,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 195 transitions. [2024-11-08 18:13:58,477 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 195 transitions. Word has length 55 [2024-11-08 18:13:58,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:13:58,477 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 195 transitions. [2024-11-08 18:13:58,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:13:58,477 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 195 transitions. [2024-11-08 18:13:58,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-08 18:13:58,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:13:58,478 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:13:58,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 18:13:58,479 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:13:58,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:13:58,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1046448359, now seen corresponding path program 1 times [2024-11-08 18:13:58,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:13:58,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129110854] [2024-11-08 18:13:58,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:13:58,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:13:58,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:13:58,652 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:13:58,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:13:58,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129110854] [2024-11-08 18:13:58,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129110854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:13:58,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:13:58,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:13:58,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912415187] [2024-11-08 18:13:58,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:13:58,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:13:58,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:13:58,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:13:58,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:13:58,655 INFO L87 Difference]: Start difference. First operand 152 states and 195 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:13:58,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:13:58,709 INFO L93 Difference]: Finished difference Result 272 states and 352 transitions. [2024-11-08 18:13:58,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:13:58,709 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-08 18:13:58,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:13:58,710 INFO L225 Difference]: With dead ends: 272 [2024-11-08 18:13:58,710 INFO L226 Difference]: Without dead ends: 156 [2024-11-08 18:13:58,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:13:58,712 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:13:58,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 340 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:13:58,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-08 18:13:58,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2024-11-08 18:13:58,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.2838709677419355) internal successors, (199), 155 states have internal predecessors, (199), 0 states have call successors, (0), 0 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-08 18:13:58,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 199 transitions. [2024-11-08 18:13:58,716 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 199 transitions. Word has length 55 [2024-11-08 18:13:58,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:13:58,716 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 199 transitions. [2024-11-08 18:13:58,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:13:58,716 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 199 transitions. [2024-11-08 18:13:58,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-08 18:13:58,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:13:58,717 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:13:58,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 18:13:58,717 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:13:58,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:13:58,718 INFO L85 PathProgramCache]: Analyzing trace with hash 790817595, now seen corresponding path program 1 times [2024-11-08 18:13:58,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:13:58,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543553622] [2024-11-08 18:13:58,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:13:58,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:13:58,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:13:58,830 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 18:13:58,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:13:58,969 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 18:13:58,969 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 18:13:58,970 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 18:13:58,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 18:13:58,975 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:13:59,035 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 18:13:59,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 06:13:59 BoogieIcfgContainer [2024-11-08 18:13:59,040 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 18:13:59,041 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 18:13:59,041 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 18:13:59,041 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 18:13:59,042 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:13:45" (3/4) ... [2024-11-08 18:13:59,044 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 18:13:59,045 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 18:13:59,046 INFO L158 Benchmark]: Toolchain (without parser) took 15312.31ms. Allocated memory was 146.8MB in the beginning and 488.6MB in the end (delta: 341.8MB). Free memory was 92.6MB in the beginning and 199.8MB in the end (delta: -107.2MB). Peak memory consumption was 237.3MB. Max. memory is 16.1GB. [2024-11-08 18:13:59,046 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 146.8MB. Free memory was 107.0MB in the beginning and 106.9MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:13:59,047 INFO L158 Benchmark]: CACSL2BoogieTranslator took 421.48ms. Allocated memory is still 146.8MB. Free memory was 92.2MB in the beginning and 75.8MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 18:13:59,047 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.78ms. Allocated memory is still 146.8MB. Free memory was 75.8MB in the beginning and 69.2MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 18:13:59,048 INFO L158 Benchmark]: Boogie Preprocessor took 112.48ms. Allocated memory is still 146.8MB. Free memory was 69.2MB in the beginning and 64.4MB in the end (delta: 4.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 18:13:59,048 INFO L158 Benchmark]: RCFGBuilder took 861.45ms. Allocated memory was 146.8MB in the beginning and 192.9MB in the end (delta: 46.1MB). Free memory was 64.4MB in the beginning and 130.5MB in the end (delta: -66.1MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2024-11-08 18:13:59,049 INFO L158 Benchmark]: TraceAbstraction took 13815.04ms. Allocated memory was 192.9MB in the beginning and 488.6MB in the end (delta: 295.7MB). Free memory was 130.5MB in the beginning and 200.8MB in the end (delta: -70.3MB). Peak memory consumption was 224.4MB. Max. memory is 16.1GB. [2024-11-08 18:13:59,049 INFO L158 Benchmark]: Witness Printer took 4.35ms. Allocated memory is still 488.6MB. Free memory was 200.8MB in the beginning and 199.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 18:13:59,053 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 146.8MB. Free memory was 107.0MB in the beginning and 106.9MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 421.48ms. Allocated memory is still 146.8MB. Free memory was 92.2MB in the beginning and 75.8MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.78ms. Allocated memory is still 146.8MB. Free memory was 75.8MB in the beginning and 69.2MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 112.48ms. Allocated memory is still 146.8MB. Free memory was 69.2MB in the beginning and 64.4MB in the end (delta: 4.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 861.45ms. Allocated memory was 146.8MB in the beginning and 192.9MB in the end (delta: 46.1MB). Free memory was 64.4MB in the beginning and 130.5MB in the end (delta: -66.1MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * TraceAbstraction took 13815.04ms. Allocated memory was 192.9MB in the beginning and 488.6MB in the end (delta: 295.7MB). Free memory was 130.5MB in the beginning and 200.8MB in the end (delta: -70.3MB). Peak memory consumption was 224.4MB. Max. memory is 16.1GB. * Witness Printer took 4.35ms. Allocated memory is still 488.6MB. Free memory was 200.8MB in the beginning and 199.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftRight at line 78, overapproximation of bitwiseOr at line 134, overapproximation of bitwiseAnd at line 147. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 4); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (4 - 1); [L32] const SORT_4 var_5 = 0; [L33] const SORT_1 var_14 = 1; [L34] const SORT_4 var_19 = 1; [L35] const SORT_4 var_22 = 15; [L37] SORT_1 input_2; [L38] SORT_1 input_3; [L40] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=15, var_14=1, var_19=1, var_22=15, var_5=0] [L40] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L41] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=15, var_14=1, var_19=1, var_22=15, var_5=0] [L41] SORT_4 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L43] SORT_4 init_7_arg_1 = var_5; [L44] state_6 = init_7_arg_1 [L45] SORT_4 init_9_arg_1 = var_5; [L46] state_8 = init_9_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15] [L49] input_2 = __VERIFIER_nondet_uchar() [L50] input_3 = __VERIFIER_nondet_uchar() [L53] SORT_4 var_10_arg_0 = state_6; [L54] SORT_4 var_10_arg_1 = state_8; [L55] SORT_1 var_10 = var_10_arg_0 < var_10_arg_1; [L56] SORT_1 var_11_arg_0 = var_10; [L57] SORT_1 var_11 = ~var_11_arg_0; [L58] SORT_1 var_15_arg_0 = var_11; [L59] SORT_1 var_15 = ~var_15_arg_0; [L60] SORT_1 var_16_arg_0 = var_14; [L61] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_16_arg_0=1, var_16_arg_1=-256, var_19=1, var_22=15] [L62] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15] [L62] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L63] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15] [L63] var_16 = var_16 & mask_SORT_1 [L64] SORT_1 bad_17_arg_0 = var_16; [L65] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L65] RET __VERIFIER_assert(!(bad_17_arg_0)) [L67] SORT_1 var_31_arg_0 = input_3; [L68] SORT_1 var_31 = ~var_31_arg_0; [L69] SORT_4 var_32_arg_0 = state_6; [L70] SORT_4 var_32_arg_1 = state_8; [L71] SORT_1 var_32 = var_32_arg_0 > var_32_arg_1; [L72] SORT_1 var_33_arg_0 = var_31; [L73] SORT_1 var_33_arg_1 = var_32; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_33_arg_0=-256, var_33_arg_1=0] [L74] EXPR var_33_arg_0 & var_33_arg_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15] [L74] SORT_1 var_33 = var_33_arg_0 & var_33_arg_1; [L75] EXPR var_33 & mask_SORT_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15] [L75] var_33 = var_33 & mask_SORT_1 [L76] SORT_4 var_28_arg_0 = var_22; [L77] SORT_4 var_28_arg_1 = var_19; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_28_arg_0=15, var_28_arg_1=1, var_33=0] [L78] EXPR var_28_arg_0 >> var_28_arg_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_33=0] [L78] SORT_4 var_28 = var_28_arg_0 >> var_28_arg_1; [L79] SORT_4 var_29_arg_0 = state_6; [L80] SORT_4 var_29_arg_1 = var_19; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_28=-255, var_29_arg_0=0, var_29_arg_1=1, var_33=0] [L81] EXPR var_29_arg_0 >> var_29_arg_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_28=-255, var_33=0] [L81] SORT_4 var_29 = var_29_arg_0 >> var_29_arg_1; [L82] SORT_4 var_30_arg_0 = var_28; [L83] SORT_4 var_30_arg_1 = var_29; [L84] SORT_4 var_30 = var_30_arg_0 + var_30_arg_1; [L85] SORT_4 var_26_arg_0 = state_6; [L86] SORT_4 var_26_arg_1 = state_8; [L87] SORT_1 var_26 = var_26_arg_0 < var_26_arg_1; [L88] SORT_4 var_21_arg_0 = state_8; [L89] SORT_4 var_21_arg_1 = state_6; [L90] SORT_1 var_21 = var_21_arg_0 == var_21_arg_1; [L91] SORT_4 var_23_arg_0 = state_6; [L92] SORT_4 var_23_arg_1 = var_22; [L93] SORT_1 var_23 = var_23_arg_0 != var_23_arg_1; [L94] SORT_1 var_24_arg_0 = var_21; [L95] SORT_1 var_24_arg_1 = var_23; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_24_arg_0=1, var_24_arg_1=1, var_26=0, var_30=1, var_33=0] [L96] EXPR var_24_arg_0 | var_24_arg_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_26=0, var_30=1, var_33=0] [L96] SORT_1 var_24 = var_24_arg_0 | var_24_arg_1; [L97] EXPR var_24 & mask_SORT_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_26=0, var_30=1, var_33=0] [L97] var_24 = var_24 & mask_SORT_1 [L98] SORT_4 var_20_arg_0 = state_6; [L99] SORT_4 var_20_arg_1 = var_19; [L100] SORT_4 var_20 = var_20_arg_0 + var_20_arg_1; [L101] SORT_1 var_25_arg_0 = var_24; [L102] SORT_4 var_25_arg_1 = var_20; [L103] SORT_4 var_25_arg_2 = state_8; [L104] SORT_4 var_25 = var_25_arg_0 ? var_25_arg_1 : var_25_arg_2; [L105] SORT_1 var_27_arg_0 = var_26; [L106] SORT_4 var_27_arg_1 = state_6; [L107] SORT_4 var_27_arg_2 = var_25; [L108] SORT_4 var_27 = var_27_arg_0 ? var_27_arg_1 : var_27_arg_2; [L109] SORT_1 var_34_arg_0 = var_33; [L110] SORT_4 var_34_arg_1 = var_30; [L111] SORT_4 var_34_arg_2 = var_27; [L112] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_34=1] [L113] EXPR var_34 & mask_SORT_4 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15] [L113] var_34 = var_34 & mask_SORT_4 [L114] SORT_4 next_35_arg_1 = var_34; [L115] SORT_1 var_42_arg_0 = input_3; [L116] SORT_1 var_42 = ~var_42_arg_0; [L117] SORT_4 var_43_arg_0 = state_6; [L118] SORT_4 var_43_arg_1 = state_8; [L119] SORT_1 var_43 = var_43_arg_0 > var_43_arg_1; [L120] SORT_1 var_44_arg_0 = var_42; [L121] SORT_1 var_44_arg_1 = var_43; VAL [mask_SORT_1=1, mask_SORT_4=15, next_35_arg_1=0, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_44_arg_0=-256, var_44_arg_1=0] [L122] EXPR var_44_arg_0 & var_44_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, next_35_arg_1=0, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15] [L122] SORT_1 var_44 = var_44_arg_0 & var_44_arg_1; [L123] EXPR var_44 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, next_35_arg_1=0, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15] [L123] var_44 = var_44 & mask_SORT_1 [L124] SORT_4 var_37_arg_0 = state_6; [L125] SORT_4 var_37_arg_1 = state_8; [L126] SORT_1 var_37 = var_37_arg_0 > var_37_arg_1; [L127] SORT_1 var_38_arg_0 = var_37; [L128] SORT_1 var_38 = ~var_38_arg_0; [L129] SORT_4 var_39_arg_0 = state_6; [L130] SORT_4 var_39_arg_1 = var_22; [L131] SORT_1 var_39 = var_39_arg_0 != var_39_arg_1; [L132] SORT_1 var_40_arg_0 = var_38; [L133] SORT_1 var_40_arg_1 = var_39; VAL [mask_SORT_1=1, mask_SORT_4=15, next_35_arg_1=0, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_40_arg_0=-1, var_40_arg_1=1, var_44=0] [L134] EXPR var_40_arg_0 | var_40_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, next_35_arg_1=0, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_44=0] [L134] SORT_1 var_40 = var_40_arg_0 | var_40_arg_1; [L135] EXPR var_40 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, next_35_arg_1=0, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_44=0] [L135] var_40 = var_40 & mask_SORT_1 [L136] SORT_4 var_36_arg_0 = state_8; [L137] SORT_4 var_36_arg_1 = var_19; [L138] SORT_4 var_36 = var_36_arg_0 + var_36_arg_1; [L139] SORT_1 var_41_arg_0 = var_40; [L140] SORT_4 var_41_arg_1 = var_36; [L141] SORT_4 var_41_arg_2 = state_6; [L142] SORT_4 var_41 = var_41_arg_0 ? var_41_arg_1 : var_41_arg_2; [L143] SORT_1 var_45_arg_0 = var_44; [L144] SORT_4 var_45_arg_1 = state_8; [L145] SORT_4 var_45_arg_2 = var_41; [L146] SORT_4 var_45 = var_45_arg_0 ? var_45_arg_1 : var_45_arg_2; VAL [mask_SORT_1=1, mask_SORT_4=15, next_35_arg_1=0, var_14=1, var_19=1, var_22=15, var_45=1] [L147] EXPR var_45 & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=15, next_35_arg_1=0, var_14=1, var_19=1, var_22=15] [L147] var_45 = var_45 & mask_SORT_4 [L148] SORT_4 next_46_arg_1 = var_45; [L150] state_6 = next_35_arg_1 [L151] state_8 = next_46_arg_1 [L49] input_2 = __VERIFIER_nondet_uchar() [L50] input_3 = __VERIFIER_nondet_uchar() [L53] SORT_4 var_10_arg_0 = state_6; [L54] SORT_4 var_10_arg_1 = state_8; [L55] SORT_1 var_10 = var_10_arg_0 < var_10_arg_1; [L56] SORT_1 var_11_arg_0 = var_10; [L57] SORT_1 var_11 = ~var_11_arg_0; [L58] SORT_1 var_15_arg_0 = var_11; [L59] SORT_1 var_15 = ~var_15_arg_0; [L60] SORT_1 var_16_arg_0 = var_14; [L61] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=1, var_14=1, var_16_arg_0=1, var_16_arg_1=-255, var_19=1, var_22=15] [L62] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=1, var_14=1, var_19=1, var_22=15] [L62] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L63] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=1, var_14=1, var_19=1, var_22=15] [L63] var_16 = var_16 & mask_SORT_1 [L64] SORT_1 bad_17_arg_0 = var_16; [L65] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.7s, OverallIterations: 20, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1152 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1152 mSDsluCounter, 7818 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6065 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2122 IncrementalHoareTripleChecker+Invalid, 2144 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 1753 mSDtfsCounter, 2122 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 217 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=206occurred in iteration=13, InterpolantAutomatonStates: 129, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 320 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 964 NumberOfCodeBlocks, 964 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 888 ConstructedInterpolants, 0 QuantifiedInterpolants, 4181 SizeOfPredicates, 1 NumberOfNonLiveVariables, 338 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 20 InterpolantComputations, 19 PerfectInterpolantSequences, 98/102 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 18:13:59,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 16f8726a4add15d0bf2494bd44888be53eb7bc01110882b6fc03ef148c6d9055 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 18:14:01,392 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:14:01,478 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-08 18:14:01,485 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:14:01,486 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:14:01,520 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:14:01,524 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:14:01,525 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:14:01,525 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:14:01,526 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:14:01,526 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:14:01,527 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:14:01,527 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:14:01,528 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:14:01,528 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:14:01,528 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:14:01,529 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:14:01,529 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:14:01,529 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:14:01,530 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:14:01,536 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:14:01,536 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 18:14:01,536 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 18:14:01,537 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:14:01,537 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 18:14:01,537 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:14:01,537 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:14:01,538 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:14:01,538 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:14:01,538 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:14:01,539 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:14:01,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:14:01,541 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:14:01,542 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:14:01,542 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:14:01,542 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 18:14:01,543 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 18:14:01,543 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:14:01,544 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:14:01,544 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:14:01,544 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:14:01,545 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 -> 16f8726a4add15d0bf2494bd44888be53eb7bc01110882b6fc03ef148c6d9055 [2024-11-08 18:14:01,896 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:14:01,920 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:14:01,923 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:14:01,924 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:14:01,924 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:14:01,926 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal.c [2024-11-08 18:14:03,627 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:14:03,877 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:14:03,877 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal.c [2024-11-08 18:14:03,891 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a39802818/b3bb4eae3e184569b877790d445edce5/FLAG229e2c6fc [2024-11-08 18:14:03,905 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a39802818/b3bb4eae3e184569b877790d445edce5 [2024-11-08 18:14:03,907 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:14:03,908 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:14:03,911 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:14:03,911 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:14:03,916 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:14:03,917 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:14:03" (1/1) ... [2024-11-08 18:14:03,918 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28eb1604 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:14:03, skipping insertion in model container [2024-11-08 18:14:03,918 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:14:03" (1/1) ... [2024-11-08 18:14:03,944 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:14:04,146 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.diagonal.c[1248,1261] [2024-11-08 18:14:04,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:14:04,245 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:14:04,259 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.diagonal.c[1248,1261] [2024-11-08 18:14:04,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:14:04,321 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:14:04,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:14:04 WrapperNode [2024-11-08 18:14:04,322 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:14:04,323 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:14:04,323 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:14:04,323 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:14:04,330 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:14:04" (1/1) ... [2024-11-08 18:14:04,342 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:14:04" (1/1) ... [2024-11-08 18:14:04,371 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 142 [2024-11-08 18:14:04,375 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:14:04,376 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:14:04,377 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:14:04,378 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:14:04,388 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:14:04" (1/1) ... [2024-11-08 18:14:04,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:14:04" (1/1) ... [2024-11-08 18:14:04,398 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:14:04" (1/1) ... [2024-11-08 18:14:04,424 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-08 18:14:04,426 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:14:04" (1/1) ... [2024-11-08 18:14:04,426 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:14:04" (1/1) ... [2024-11-08 18:14:04,433 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:14:04" (1/1) ... [2024-11-08 18:14:04,440 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:14:04" (1/1) ... [2024-11-08 18:14:04,446 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:14:04" (1/1) ... [2024-11-08 18:14:04,447 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:14:04" (1/1) ... [2024-11-08 18:14:04,454 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:14:04,459 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:14:04,459 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:14:04,459 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:14:04,460 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:14:04" (1/1) ... [2024-11-08 18:14:04,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:14:04,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 18:14:04,493 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-08 18:14:04,499 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-08 18:14:04,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:14:04,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 18:14:04,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:14:04,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:14:04,659 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:14:04,661 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:14:04,924 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-08 18:14:04,924 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:14:04,938 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:14:04,938 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 18:14:04,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:14:04 BoogieIcfgContainer [2024-11-08 18:14:04,939 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:14:04,941 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:14:04,941 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:14:04,945 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:14:04,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:14:03" (1/3) ... [2024-11-08 18:14:04,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32968758 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:14:04, skipping insertion in model container [2024-11-08 18:14:04,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:14:04" (2/3) ... [2024-11-08 18:14:04,947 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32968758 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:14:04, skipping insertion in model container [2024-11-08 18:14:04,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:14:04" (3/3) ... [2024-11-08 18:14:04,949 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.diagonal.c [2024-11-08 18:14:04,971 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:14:04,972 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 18:14:05,028 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:14:05,035 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;@631e76e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:14:05,035 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 18:14:05,039 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 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-08 18:14:05,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-08 18:14:05,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:14:05,044 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-08 18:14:05,044 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:14:05,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:14:05,049 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-08 18:14:05,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 18:14:05,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1451173260] [2024-11-08 18:14:05,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:14:05,060 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:14:05,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 18:14:05,063 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 18:14:05,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 18:14:05,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:05,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-08 18:14:05,187 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:14:05,473 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-08 18:14:05,473 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:14:05,475 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 18:14:05,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1451173260] [2024-11-08 18:14:05,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1451173260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:14:05,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:14:05,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:14:05,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621270223] [2024-11-08 18:14:05,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:14:05,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:14:05,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 18:14:05,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:14:05,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:14:05,530 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 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 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 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-08 18:14:05,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:14:05,603 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-08 18:14:05,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:14:05,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2024-11-08 18:14:05,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:14:05,615 INFO L225 Difference]: With dead ends: 18 [2024-11-08 18:14:05,615 INFO L226 Difference]: Without dead ends: 10 [2024-11-08 18:14:05,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:14:05,622 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:14:05,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:14:05,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-08 18:14:05,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-08 18:14:05,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 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-08 18:14:05,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-08 18:14:05,648 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-08 18:14:05,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:14:05,649 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-08 18:14:05,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 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-08 18:14:05,649 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-08 18:14:05,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 18:14:05,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:14:05,650 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-08 18:14:05,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 18:14:05,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:14:05,851 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:14:05,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:14:05,852 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-08 18:14:05,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 18:14:05,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1344552979] [2024-11-08 18:14:05,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:14:05,853 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:14:05,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 18:14:05,855 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 18:14:05,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 18:14:05,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:05,959 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-08 18:14:05,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:14:06,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:14:06,301 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:14:09,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:14:09,403 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 18:14:09,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1344552979] [2024-11-08 18:14:09,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1344552979] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:14:09,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:14:09,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-08 18:14:09,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496283199] [2024-11-08 18:14:09,407 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:14:09,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 18:14:09,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 18:14:09,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 18:14:09,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:14:09,409 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 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-08 18:14:09,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:14:09,815 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2024-11-08 18:14:09,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 18:14:09,816 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 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 8 [2024-11-08 18:14:09,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:14:09,817 INFO L225 Difference]: With dead ends: 21 [2024-11-08 18:14:09,817 INFO L226 Difference]: Without dead ends: 19 [2024-11-08 18:14:09,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2024-11-08 18:14:09,820 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 8 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:14:09,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 14 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:14:09,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-08 18:14:09,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2024-11-08 18:14:09,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 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-08 18:14:09,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2024-11-08 18:14:09,831 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 8 [2024-11-08 18:14:09,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:14:09,831 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2024-11-08 18:14:09,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 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-08 18:14:09,832 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2024-11-08 18:14:09,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 18:14:09,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:14:09,833 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1] [2024-11-08 18:14:09,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 18:14:10,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:14:10,034 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:14:10,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:14:10,035 INFO L85 PathProgramCache]: Analyzing trace with hash -37306491, now seen corresponding path program 2 times [2024-11-08 18:14:10,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 18:14:10,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [24713154] [2024-11-08 18:14:10,036 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 18:14:10,037 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:14:10,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 18:14:10,043 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 18:14:10,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 18:14:10,204 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 18:14:10,205 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:14:10,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-08 18:14:10,221 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:14:10,694 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:14:10,694 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:14:41,399 WARN L286 SmtUtils]: Spent 6.53s on a formula simplification. DAG size of input: 1437 DAG size of output: 1271 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)