./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.toy_lock_4.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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.toy_lock_4.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 dc77f8e7fc201c8766f52fe3e014d6c5c37e220387f85127552a419acc9259b5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 02:55:41,531 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 02:55:41,604 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-10 02:55:41,610 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 02:55:41,612 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 02:55:41,631 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 02:55:41,632 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 02:55:41,632 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 02:55:41,633 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 02:55:41,633 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 02:55:41,633 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 02:55:41,633 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 02:55:41,634 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 02:55:41,634 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 02:55:41,634 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 02:55:41,635 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 02:55:41,635 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 02:55:41,635 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 02:55:41,635 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 02:55:41,636 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 02:55:41,636 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 02:55:41,636 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 02:55:41,637 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 02:55:41,637 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 02:55:41,637 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 02:55:41,637 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 02:55:41,638 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 02:55:41,638 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 02:55:41,638 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 02:55:41,638 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 02:55:41,639 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 02:55:41,639 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 02:55:41,639 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 02:55:41,640 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 02:55:41,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 02:55:41,640 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 02:55:41,640 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 02:55:41,641 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 02:55:41,641 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 02:55:41,641 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 -> dc77f8e7fc201c8766f52fe3e014d6c5c37e220387f85127552a419acc9259b5 [2024-11-10 02:55:41,850 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 02:55:41,886 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 02:55:41,888 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 02:55:41,892 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 02:55:41,892 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 02:55:41,893 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.toy_lock_4.c [2024-11-10 02:55:43,228 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 02:55:43,433 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 02:55:43,434 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.toy_lock_4.c [2024-11-10 02:55:43,444 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eafe52cf3/ebed9c9077084e0db7631c7fe35b2dcf/FLAG033e35ada [2024-11-10 02:55:43,806 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eafe52cf3/ebed9c9077084e0db7631c7fe35b2dcf [2024-11-10 02:55:43,809 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 02:55:43,810 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 02:55:43,811 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 02:55:43,811 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 02:55:43,818 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 02:55:43,819 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:55:43" (1/1) ... [2024-11-10 02:55:43,820 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11958173 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:55:43, skipping insertion in model container [2024-11-10 02:55:43,820 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:55:43" (1/1) ... [2024-11-10 02:55:43,867 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 02:55:44,040 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.toy_lock_4.c[1250,1263] [2024-11-10 02:55:44,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 02:55:44,290 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 02:55:44,298 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.toy_lock_4.c[1250,1263] [2024-11-10 02:55:44,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 02:55:44,382 INFO L204 MainTranslator]: Completed translation [2024-11-10 02:55:44,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:55:44 WrapperNode [2024-11-10 02:55:44,383 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 02:55:44,383 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 02:55:44,384 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 02:55:44,384 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 02:55:44,389 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:55:44" (1/1) ... [2024-11-10 02:55:44,418 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:55:44" (1/1) ... [2024-11-10 02:55:44,502 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1371 [2024-11-10 02:55:44,503 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 02:55:44,504 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 02:55:44,504 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 02:55:44,504 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 02:55:44,512 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:55:44" (1/1) ... [2024-11-10 02:55:44,513 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:55:44" (1/1) ... [2024-11-10 02:55:44,528 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:55:44" (1/1) ... [2024-11-10 02:55:44,585 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-10 02:55:44,585 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:55:44" (1/1) ... [2024-11-10 02:55:44,586 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:55:44" (1/1) ... [2024-11-10 02:55:44,627 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:55:44" (1/1) ... [2024-11-10 02:55:44,637 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:55:44" (1/1) ... [2024-11-10 02:55:44,647 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:55:44" (1/1) ... [2024-11-10 02:55:44,658 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:55:44" (1/1) ... [2024-11-10 02:55:44,672 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 02:55:44,674 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 02:55:44,674 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 02:55:44,674 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 02:55:44,675 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:55:44" (1/1) ... [2024-11-10 02:55:44,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 02:55:44,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 02:55:44,707 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-10 02:55:44,710 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-10 02:55:44,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 02:55:44,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 02:55:44,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 02:55:44,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 02:55:44,957 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 02:55:44,959 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 02:55:46,216 INFO L? ?]: Removed 948 outVars from TransFormulas that were not future-live. [2024-11-10 02:55:46,217 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 02:55:46,272 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 02:55:46,273 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 02:55:46,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:55:46 BoogieIcfgContainer [2024-11-10 02:55:46,275 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 02:55:46,277 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 02:55:46,278 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 02:55:46,281 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 02:55:46,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:55:43" (1/3) ... [2024-11-10 02:55:46,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43c8d381 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:55:46, skipping insertion in model container [2024-11-10 02:55:46,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:55:44" (2/3) ... [2024-11-10 02:55:46,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43c8d381 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:55:46, skipping insertion in model container [2024-11-10 02:55:46,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:55:46" (3/3) ... [2024-11-10 02:55:46,284 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.toy_lock_4.c [2024-11-10 02:55:46,298 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 02:55:46,299 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 02:55:46,360 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 02:55:46,366 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;@2cccfa7c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 02:55:46,368 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 02:55:46,372 INFO L276 IsEmpty]: Start isEmpty. Operand has 249 states, 247 states have (on average 1.4898785425101215) internal successors, (368), 248 states have internal predecessors, (368), 0 states have call successors, (0), 0 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-10 02:55:46,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-10 02:55:46,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:55:46,383 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:55:46,384 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:55:46,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:55:46,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1507523227, now seen corresponding path program 1 times [2024-11-10 02:55:46,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:55:46,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384309477] [2024-11-10 02:55:46,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:55:46,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:55:46,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:55:47,179 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-10 02:55:47,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:55:47,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384309477] [2024-11-10 02:55:47,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384309477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:55:47,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:55:47,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 02:55:47,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834821657] [2024-11-10 02:55:47,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:55:47,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 02:55:47,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:55:47,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 02:55:47,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:55:47,213 INFO L87 Difference]: Start difference. First operand has 249 states, 247 states have (on average 1.4898785425101215) internal successors, (368), 248 states have internal predecessors, (368), 0 states have call successors, (0), 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 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:55:47,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:55:47,426 INFO L93 Difference]: Finished difference Result 429 states and 637 transitions. [2024-11-10 02:55:47,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 02:55:47,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-11-10 02:55:47,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:55:47,435 INFO L225 Difference]: With dead ends: 429 [2024-11-10 02:55:47,435 INFO L226 Difference]: Without dead ends: 246 [2024-11-10 02:55:47,438 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-10 02:55:47,440 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 0 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:55:47,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 898 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 02:55:47,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-11-10 02:55:47,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2024-11-10 02:55:47,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 1.4857142857142858) internal successors, (364), 245 states have internal predecessors, (364), 0 states have call successors, (0), 0 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-10 02:55:47,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 364 transitions. [2024-11-10 02:55:47,483 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 364 transitions. Word has length 76 [2024-11-10 02:55:47,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:55:47,484 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 364 transitions. [2024-11-10 02:55:47,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:55:47,484 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 364 transitions. [2024-11-10 02:55:47,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-10 02:55:47,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:55:47,490 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:55:47,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 02:55:47,494 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:55:47,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:55:47,495 INFO L85 PathProgramCache]: Analyzing trace with hash -366366674, now seen corresponding path program 1 times [2024-11-10 02:55:47,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:55:47,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467236278] [2024-11-10 02:55:47,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:55:47,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:55:47,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:55:47,727 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-10 02:55:47,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:55:47,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467236278] [2024-11-10 02:55:47,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467236278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:55:47,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:55:47,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 02:55:47,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106423262] [2024-11-10 02:55:47,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:55:47,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 02:55:47,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:55:47,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 02:55:47,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:55:47,730 INFO L87 Difference]: Start difference. First operand 246 states and 364 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:55:47,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:55:47,857 INFO L93 Difference]: Finished difference Result 428 states and 633 transitions. [2024-11-10 02:55:47,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 02:55:47,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-10 02:55:47,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:55:47,859 INFO L225 Difference]: With dead ends: 428 [2024-11-10 02:55:47,859 INFO L226 Difference]: Without dead ends: 248 [2024-11-10 02:55:47,860 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-10 02:55:47,860 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 0 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:55:47,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 895 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:55:47,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-11-10 02:55:47,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2024-11-10 02:55:47,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 247 states have (on average 1.4817813765182186) internal successors, (366), 247 states have internal predecessors, (366), 0 states have call successors, (0), 0 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-10 02:55:47,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 366 transitions. [2024-11-10 02:55:47,870 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 366 transitions. Word has length 77 [2024-11-10 02:55:47,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:55:47,870 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 366 transitions. [2024-11-10 02:55:47,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:55:47,870 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 366 transitions. [2024-11-10 02:55:47,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-10 02:55:47,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:55:47,872 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:55:47,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 02:55:47,872 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:55:47,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:55:47,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1274778720, now seen corresponding path program 1 times [2024-11-10 02:55:47,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:55:47,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015529781] [2024-11-10 02:55:47,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:55:47,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:55:47,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:55:48,155 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-10 02:55:48,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:55:48,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015529781] [2024-11-10 02:55:48,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015529781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:55:48,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:55:48,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 02:55:48,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134578536] [2024-11-10 02:55:48,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:55:48,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 02:55:48,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:55:48,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 02:55:48,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:55:48,157 INFO L87 Difference]: Start difference. First operand 248 states and 366 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 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-10 02:55:48,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:55:48,305 INFO L93 Difference]: Finished difference Result 434 states and 640 transitions. [2024-11-10 02:55:48,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:55:48,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-10 02:55:48,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:55:48,307 INFO L225 Difference]: With dead ends: 434 [2024-11-10 02:55:48,307 INFO L226 Difference]: Without dead ends: 252 [2024-11-10 02:55:48,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 02:55:48,309 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 299 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:55:48,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 878 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:55:48,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-11-10 02:55:48,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 251. [2024-11-10 02:55:48,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 1.476) internal successors, (369), 250 states have internal predecessors, (369), 0 states have call successors, (0), 0 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-10 02:55:48,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 369 transitions. [2024-11-10 02:55:48,317 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 369 transitions. Word has length 78 [2024-11-10 02:55:48,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:55:48,317 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 369 transitions. [2024-11-10 02:55:48,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 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-10 02:55:48,317 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 369 transitions. [2024-11-10 02:55:48,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-10 02:55:48,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:55:48,319 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:55:48,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 02:55:48,319 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:55:48,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:55:48,320 INFO L85 PathProgramCache]: Analyzing trace with hash -338298846, now seen corresponding path program 1 times [2024-11-10 02:55:48,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:55:48,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254812633] [2024-11-10 02:55:48,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:55:48,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:55:48,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:55:49,924 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-10 02:55:49,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:55:49,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254812633] [2024-11-10 02:55:49,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254812633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:55:49,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:55:49,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 02:55:49,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537391348] [2024-11-10 02:55:49,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:55:49,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 02:55:49,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:55:49,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 02:55:49,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-10 02:55:49,928 INFO L87 Difference]: Start difference. First operand 251 states and 369 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 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-10 02:55:52,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 02:55:55,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:55:55,360 INFO L93 Difference]: Finished difference Result 535 states and 782 transitions. [2024-11-10 02:55:55,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 02:55:55,360 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2024-11-10 02:55:55,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:55:55,363 INFO L225 Difference]: With dead ends: 535 [2024-11-10 02:55:55,363 INFO L226 Difference]: Without dead ends: 350 [2024-11-10 02:55:55,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-10 02:55:55,364 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 453 mSDsluCounter, 1482 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 1761 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-11-10 02:55:55,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 1761 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-11-10 02:55:55,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-11-10 02:55:55,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 281. [2024-11-10 02:55:55,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 1.475) internal successors, (413), 280 states have internal predecessors, (413), 0 states have call successors, (0), 0 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-10 02:55:55,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 413 transitions. [2024-11-10 02:55:55,373 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 413 transitions. Word has length 79 [2024-11-10 02:55:55,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:55:55,373 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 413 transitions. [2024-11-10 02:55:55,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 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-10 02:55:55,373 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 413 transitions. [2024-11-10 02:55:55,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-10 02:55:55,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:55:55,375 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:55:55,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 02:55:55,375 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:55:55,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:55:55,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1329180385, now seen corresponding path program 1 times [2024-11-10 02:55:55,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:55:55,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259539033] [2024-11-10 02:55:55,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:55:55,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:55:55,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:55:56,030 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-10 02:55:56,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:55:56,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259539033] [2024-11-10 02:55:56,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259539033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:55:56,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:55:56,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 02:55:56,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298786815] [2024-11-10 02:55:56,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:55:56,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 02:55:56,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:55:56,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 02:55:56,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 02:55:56,034 INFO L87 Difference]: Start difference. First operand 281 states and 413 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 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-10 02:55:58,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:55:58,247 INFO L93 Difference]: Finished difference Result 536 states and 783 transitions. [2024-11-10 02:55:58,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 02:55:58,247 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2024-11-10 02:55:58,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:55:58,248 INFO L225 Difference]: With dead ends: 536 [2024-11-10 02:55:58,248 INFO L226 Difference]: Without dead ends: 349 [2024-11-10 02:55:58,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-10 02:55:58,250 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 585 mSDsluCounter, 1422 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 1708 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:55:58,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [585 Valid, 1708 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-10 02:55:58,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-11-10 02:55:58,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 284. [2024-11-10 02:55:58,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 1.469964664310954) internal successors, (416), 283 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:55:58,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 416 transitions. [2024-11-10 02:55:58,266 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 416 transitions. Word has length 80 [2024-11-10 02:55:58,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:55:58,267 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 416 transitions. [2024-11-10 02:55:58,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 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-10 02:55:58,267 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 416 transitions. [2024-11-10 02:55:58,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-10 02:55:58,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:55:58,268 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:55:58,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 02:55:58,269 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:55:58,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:55:58,269 INFO L85 PathProgramCache]: Analyzing trace with hash -241316730, now seen corresponding path program 1 times [2024-11-10 02:55:58,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:55:58,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270354627] [2024-11-10 02:55:58,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:55:58,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:55:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:55:58,991 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-10 02:55:58,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:55:58,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270354627] [2024-11-10 02:55:58,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270354627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:55:58,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:55:58,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 02:55:58,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447612693] [2024-11-10 02:55:58,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:55:58,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 02:55:58,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:55:58,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 02:55:58,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-10 02:55:58,995 INFO L87 Difference]: Start difference. First operand 284 states and 416 transitions. Second operand has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 states have internal predecessors, (80), 0 states have call successors, (0), 0 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-10 02:56:01,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:56:01,591 INFO L93 Difference]: Finished difference Result 536 states and 780 transitions. [2024-11-10 02:56:01,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 02:56:01,592 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2024-11-10 02:56:01,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:56:01,594 INFO L225 Difference]: With dead ends: 536 [2024-11-10 02:56:01,594 INFO L226 Difference]: Without dead ends: 349 [2024-11-10 02:56:01,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-11-10 02:56:01,597 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 450 mSDsluCounter, 1702 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 1987 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-10 02:56:01,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 1987 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-10 02:56:01,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-11-10 02:56:01,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 284. [2024-11-10 02:56:01,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 1.4664310954063604) internal successors, (415), 283 states have internal predecessors, (415), 0 states have call successors, (0), 0 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-10 02:56:01,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 415 transitions. [2024-11-10 02:56:01,604 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 415 transitions. Word has length 80 [2024-11-10 02:56:01,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:56:01,605 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 415 transitions. [2024-11-10 02:56:01,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 states have internal predecessors, (80), 0 states have call successors, (0), 0 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-10 02:56:01,605 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 415 transitions. [2024-11-10 02:56:01,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-10 02:56:01,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:56:01,606 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:56:01,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 02:56:01,606 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:56:01,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:56:01,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1955523349, now seen corresponding path program 1 times [2024-11-10 02:56:01,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:56:01,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825964369] [2024-11-10 02:56:01,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:56:01,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:56:01,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:56:02,231 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-10 02:56:02,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:56:02,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825964369] [2024-11-10 02:56:02,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825964369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:56:02,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:56:02,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 02:56:02,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136739514] [2024-11-10 02:56:02,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:56:02,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 02:56:02,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:56:02,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 02:56:02,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-10 02:56:02,234 INFO L87 Difference]: Start difference. First operand 284 states and 415 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 0 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-10 02:56:03,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 02:56:04,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:56:04,471 INFO L93 Difference]: Finished difference Result 538 states and 783 transitions. [2024-11-10 02:56:04,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 02:56:04,471 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2024-11-10 02:56:04,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:56:04,473 INFO L225 Difference]: With dead ends: 538 [2024-11-10 02:56:04,473 INFO L226 Difference]: Without dead ends: 353 [2024-11-10 02:56:04,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-10 02:56:04,476 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 558 mSDsluCounter, 1677 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 1957 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:56:04,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 1957 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-10 02:56:04,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-11-10 02:56:04,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 288. [2024-11-10 02:56:04,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 287 states have (on average 1.4634146341463414) internal successors, (420), 287 states have internal predecessors, (420), 0 states have call successors, (0), 0 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-10 02:56:04,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 420 transitions. [2024-11-10 02:56:04,483 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 420 transitions. Word has length 80 [2024-11-10 02:56:04,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:56:04,484 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 420 transitions. [2024-11-10 02:56:04,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 0 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-10 02:56:04,484 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 420 transitions. [2024-11-10 02:56:04,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 02:56:04,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:56:04,485 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:56:04,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 02:56:04,486 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:56:04,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:56:04,486 INFO L85 PathProgramCache]: Analyzing trace with hash -273748333, now seen corresponding path program 1 times [2024-11-10 02:56:04,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:56:04,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954737719] [2024-11-10 02:56:04,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:56:04,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:56:04,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:56:04,828 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-10 02:56:04,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:56:04,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954737719] [2024-11-10 02:56:04,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954737719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:56:04,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:56:04,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 02:56:04,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885920440] [2024-11-10 02:56:04,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:56:04,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 02:56:04,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:56:04,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 02:56:04,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:56:04,830 INFO L87 Difference]: Start difference. First operand 288 states and 420 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 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-10 02:56:04,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:56:04,926 INFO L93 Difference]: Finished difference Result 472 states and 690 transitions. [2024-11-10 02:56:04,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 02:56:04,927 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-11-10 02:56:04,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:56:04,928 INFO L225 Difference]: With dead ends: 472 [2024-11-10 02:56:04,928 INFO L226 Difference]: Without dead ends: 281 [2024-11-10 02:56:04,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:56:04,929 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 0 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:56:04,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 595 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:56:04,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-11-10 02:56:04,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2024-11-10 02:56:04,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 1.4678571428571427) internal successors, (411), 280 states have internal predecessors, (411), 0 states have call successors, (0), 0 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-10 02:56:04,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 411 transitions. [2024-11-10 02:56:04,936 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 411 transitions. Word has length 81 [2024-11-10 02:56:04,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:56:04,937 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 411 transitions. [2024-11-10 02:56:04,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 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-10 02:56:04,937 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 411 transitions. [2024-11-10 02:56:04,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 02:56:04,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:56:04,940 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:56:04,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 02:56:04,941 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:56:04,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:56:04,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1560138952, now seen corresponding path program 1 times [2024-11-10 02:56:04,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:56:04,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902573951] [2024-11-10 02:56:04,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:56:04,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:56:05,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:56:05,422 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-10 02:56:05,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:56:05,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902573951] [2024-11-10 02:56:05,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902573951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:56:05,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:56:05,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 02:56:05,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260915492] [2024-11-10 02:56:05,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:56:05,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 02:56:05,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:56:05,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 02:56:05,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 02:56:05,424 INFO L87 Difference]: Start difference. First operand 281 states and 411 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 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-10 02:56:07,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 02:56:08,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 02:56:08,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:56:08,725 INFO L93 Difference]: Finished difference Result 527 states and 766 transitions. [2024-11-10 02:56:08,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 02:56:08,726 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-11-10 02:56:08,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:56:08,727 INFO L225 Difference]: With dead ends: 527 [2024-11-10 02:56:08,727 INFO L226 Difference]: Without dead ends: 341 [2024-11-10 02:56:08,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-10 02:56:08,728 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 556 mSDsluCounter, 1417 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 1703 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:56:08,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 1703 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-10 02:56:08,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-11-10 02:56:08,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 279. [2024-11-10 02:56:08,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 278 states have (on average 1.4676258992805755) internal successors, (408), 278 states have internal predecessors, (408), 0 states have call successors, (0), 0 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-10 02:56:08,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 408 transitions. [2024-11-10 02:56:08,733 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 408 transitions. Word has length 81 [2024-11-10 02:56:08,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:56:08,733 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 408 transitions. [2024-11-10 02:56:08,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 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-10 02:56:08,734 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 408 transitions. [2024-11-10 02:56:08,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 02:56:08,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:56:08,734 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:56:08,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 02:56:08,734 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:56:08,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:56:08,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1164331229, now seen corresponding path program 1 times [2024-11-10 02:56:08,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:56:08,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815164415] [2024-11-10 02:56:08,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:56:08,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:56:08,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:56:08,998 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-10 02:56:09,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:56:09,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815164415] [2024-11-10 02:56:09,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815164415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:56:09,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:56:09,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 02:56:09,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93685788] [2024-11-10 02:56:09,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:56:09,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 02:56:09,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:56:09,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 02:56:09,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 02:56:09,001 INFO L87 Difference]: Start difference. First operand 279 states and 408 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 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-10 02:56:09,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:56:09,196 INFO L93 Difference]: Finished difference Result 471 states and 688 transitions. [2024-11-10 02:56:09,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 02:56:09,196 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-11-10 02:56:09,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:56:09,197 INFO L225 Difference]: With dead ends: 471 [2024-11-10 02:56:09,197 INFO L226 Difference]: Without dead ends: 287 [2024-11-10 02:56:09,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 02:56:09,198 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 4 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1468 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:56:09,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1468 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 02:56:09,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-10 02:56:09,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 284. [2024-11-10 02:56:09,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 1.4628975265017667) internal successors, (414), 283 states have internal predecessors, (414), 0 states have call successors, (0), 0 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-10 02:56:09,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 414 transitions. [2024-11-10 02:56:09,206 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 414 transitions. Word has length 81 [2024-11-10 02:56:09,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:56:09,206 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 414 transitions. [2024-11-10 02:56:09,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 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-10 02:56:09,207 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 414 transitions. [2024-11-10 02:56:09,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-10 02:56:09,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:56:09,207 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:56:09,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 02:56:09,208 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:56:09,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:56:09,208 INFO L85 PathProgramCache]: Analyzing trace with hash 666072454, now seen corresponding path program 1 times [2024-11-10 02:56:09,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:56:09,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610184421] [2024-11-10 02:56:09,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:56:09,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:56:09,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:56:10,020 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-10 02:56:10,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:56:10,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610184421] [2024-11-10 02:56:10,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610184421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:56:10,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:56:10,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 02:56:10,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660871230] [2024-11-10 02:56:10,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:56:10,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 02:56:10,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:56:10,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 02:56:10,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-10 02:56:10,022 INFO L87 Difference]: Start difference. First operand 284 states and 414 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:56:11,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 02:56:14,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 02:56:14,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:56:14,898 INFO L93 Difference]: Finished difference Result 543 states and 786 transitions. [2024-11-10 02:56:14,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 02:56:14,899 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-11-10 02:56:14,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:56:14,900 INFO L225 Difference]: With dead ends: 543 [2024-11-10 02:56:14,900 INFO L226 Difference]: Without dead ends: 354 [2024-11-10 02:56:14,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-10 02:56:14,901 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 548 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 1759 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-10 02:56:14,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 1759 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-11-10 02:56:14,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-11-10 02:56:14,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 293. [2024-11-10 02:56:14,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 292 states have (on average 1.4589041095890412) internal successors, (426), 292 states have internal predecessors, (426), 0 states have call successors, (0), 0 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-10 02:56:14,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 426 transitions. [2024-11-10 02:56:14,906 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 426 transitions. Word has length 82 [2024-11-10 02:56:14,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:56:14,906 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 426 transitions. [2024-11-10 02:56:14,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:56:14,906 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 426 transitions. [2024-11-10 02:56:14,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 02:56:14,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:56:14,907 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:56:14,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 02:56:14,907 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:56:14,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:56:14,908 INFO L85 PathProgramCache]: Analyzing trace with hash -51649805, now seen corresponding path program 1 times [2024-11-10 02:56:14,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:56:14,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369524819] [2024-11-10 02:56:14,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:56:14,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:56:14,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:56:15,298 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-10 02:56:15,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:56:15,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369524819] [2024-11-10 02:56:15,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369524819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:56:15,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:56:15,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 02:56:15,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084646903] [2024-11-10 02:56:15,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:56:15,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 02:56:15,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:56:15,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 02:56:15,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 02:56:15,300 INFO L87 Difference]: Start difference. First operand 293 states and 426 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:56:17,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 02:56:17,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:56:17,637 INFO L93 Difference]: Finished difference Result 543 states and 785 transitions. [2024-11-10 02:56:17,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 02:56:17,637 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-11-10 02:56:17,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:56:17,638 INFO L225 Difference]: With dead ends: 543 [2024-11-10 02:56:17,638 INFO L226 Difference]: Without dead ends: 352 [2024-11-10 02:56:17,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-10 02:56:17,639 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 544 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 1419 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-10 02:56:17,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 1419 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-10 02:56:17,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-11-10 02:56:17,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 299. [2024-11-10 02:56:17,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 1.4463087248322148) internal successors, (431), 298 states have internal predecessors, (431), 0 states have call successors, (0), 0 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-10 02:56:17,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 431 transitions. [2024-11-10 02:56:17,644 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 431 transitions. Word has length 83 [2024-11-10 02:56:17,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:56:17,644 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 431 transitions. [2024-11-10 02:56:17,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:56:17,644 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 431 transitions. [2024-11-10 02:56:17,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 02:56:17,645 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:56:17,645 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:56:17,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 02:56:17,645 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:56:17,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:56:17,645 INFO L85 PathProgramCache]: Analyzing trace with hash -396323620, now seen corresponding path program 1 times [2024-11-10 02:56:17,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:56:17,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319974511] [2024-11-10 02:56:17,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:56:17,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:56:17,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:56:18,140 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-10 02:56:18,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:56:18,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319974511] [2024-11-10 02:56:18,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319974511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:56:18,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:56:18,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 02:56:18,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484544680] [2024-11-10 02:56:18,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:56:18,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 02:56:18,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:56:18,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 02:56:18,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 02:56:18,143 INFO L87 Difference]: Start difference. First operand 299 states and 431 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:56:18,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:56:18,384 INFO L93 Difference]: Finished difference Result 489 states and 708 transitions. [2024-11-10 02:56:18,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 02:56:18,385 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-11-10 02:56:18,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:56:18,387 INFO L225 Difference]: With dead ends: 489 [2024-11-10 02:56:18,387 INFO L226 Difference]: Without dead ends: 294 [2024-11-10 02:56:18,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 02:56:18,388 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 1 mSDsluCounter, 1450 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1743 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:56:18,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1743 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 02:56:18,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-10 02:56:18,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2024-11-10 02:56:18,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 1.447098976109215) internal successors, (424), 293 states have internal predecessors, (424), 0 states have call successors, (0), 0 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-10 02:56:18,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 424 transitions. [2024-11-10 02:56:18,394 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 424 transitions. Word has length 83 [2024-11-10 02:56:18,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:56:18,394 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 424 transitions. [2024-11-10 02:56:18,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:56:18,394 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 424 transitions. [2024-11-10 02:56:18,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-10 02:56:18,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:56:18,395 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:56:18,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 02:56:18,395 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:56:18,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:56:18,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1931571105, now seen corresponding path program 1 times [2024-11-10 02:56:18,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:56:18,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323145842] [2024-11-10 02:56:18,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:56:18,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:56:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:56:19,048 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-10 02:56:19,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:56:19,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323145842] [2024-11-10 02:56:19,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323145842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:56:19,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:56:19,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 02:56:19,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370883156] [2024-11-10 02:56:19,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:56:19,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 02:56:19,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:56:19,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 02:56:19,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-10 02:56:19,050 INFO L87 Difference]: Start difference. First operand 294 states and 424 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 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-10 02:56:21,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 02:56:22,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:56:22,095 INFO L93 Difference]: Finished difference Result 551 states and 794 transitions. [2024-11-10 02:56:22,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 02:56:22,095 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2024-11-10 02:56:22,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:56:22,096 INFO L225 Difference]: With dead ends: 551 [2024-11-10 02:56:22,097 INFO L226 Difference]: Without dead ends: 361 [2024-11-10 02:56:22,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-10 02:56:22,097 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 439 mSDsluCounter, 1679 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 1960 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-10 02:56:22,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 1960 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-10 02:56:22,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-11-10 02:56:22,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 300. [2024-11-10 02:56:22,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 1.4481605351170568) internal successors, (433), 299 states have internal predecessors, (433), 0 states have call successors, (0), 0 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-10 02:56:22,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 433 transitions. [2024-11-10 02:56:22,102 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 433 transitions. Word has length 84 [2024-11-10 02:56:22,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:56:22,102 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 433 transitions. [2024-11-10 02:56:22,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 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-10 02:56:22,103 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 433 transitions. [2024-11-10 02:56:22,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-10 02:56:22,103 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:56:22,103 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 02:56:22,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 02:56:22,104 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:56:22,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:56:22,104 INFO L85 PathProgramCache]: Analyzing trace with hash 698489902, now seen corresponding path program 1 times [2024-11-10 02:56:22,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:56:22,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324447066] [2024-11-10 02:56:22,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:56:22,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:56:22,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:56:22,644 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-10 02:56:22,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:56:22,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324447066] [2024-11-10 02:56:22,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324447066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:56:22,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:56:22,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 02:56:22,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122813389] [2024-11-10 02:56:22,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:56:22,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 02:56:22,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:56:22,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 02:56:22,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 02:56:22,646 INFO L87 Difference]: Start difference. First operand 300 states and 433 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:56:24,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 02:56:26,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 02:56:28,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 02:56:29,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:56:29,648 INFO L93 Difference]: Finished difference Result 551 states and 793 transitions. [2024-11-10 02:56:29,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 02:56:29,649 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-11-10 02:56:29,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:56:29,650 INFO L225 Difference]: With dead ends: 551 [2024-11-10 02:56:29,650 INFO L226 Difference]: Without dead ends: 359 [2024-11-10 02:56:29,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-10 02:56:29,651 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 550 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 1419 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2024-11-10 02:56:29,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 1419 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2024-11-10 02:56:29,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-11-10 02:56:29,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 306. [2024-11-10 02:56:29,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 1.4360655737704917) internal successors, (438), 305 states have internal predecessors, (438), 0 states have call successors, (0), 0 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-10 02:56:29,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 438 transitions. [2024-11-10 02:56:29,656 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 438 transitions. Word has length 85 [2024-11-10 02:56:29,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:56:29,657 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 438 transitions. [2024-11-10 02:56:29,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:56:29,657 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 438 transitions. [2024-11-10 02:56:29,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-10 02:56:29,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:56:29,658 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 02:56:29,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 02:56:29,658 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:56:29,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:56:29,658 INFO L85 PathProgramCache]: Analyzing trace with hash 878741789, now seen corresponding path program 1 times [2024-11-10 02:56:29,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:56:29,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372352166] [2024-11-10 02:56:29,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:56:29,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:56:29,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:56:30,098 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-10 02:56:30,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:56:30,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372352166] [2024-11-10 02:56:30,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372352166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:56:30,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:56:30,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 02:56:30,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187059156] [2024-11-10 02:56:30,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:56:30,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 02:56:30,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:56:30,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 02:56:30,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:56:30,102 INFO L87 Difference]: Start difference. First operand 306 states and 438 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:56:31,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:56:31,691 INFO L93 Difference]: Finished difference Result 549 states and 787 transitions. [2024-11-10 02:56:31,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:56:31,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-11-10 02:56:31,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:56:31,694 INFO L225 Difference]: With dead ends: 549 [2024-11-10 02:56:31,694 INFO L226 Difference]: Without dead ends: 359 [2024-11-10 02:56:31,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 02:56:31,695 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 507 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-10 02:56:31,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 858 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-10 02:56:31,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-11-10 02:56:31,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 312. [2024-11-10 02:56:31,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 311 states have (on average 1.4340836012861737) internal successors, (446), 311 states have internal predecessors, (446), 0 states have call successors, (0), 0 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-10 02:56:31,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 446 transitions. [2024-11-10 02:56:31,701 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 446 transitions. Word has length 85 [2024-11-10 02:56:31,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:56:31,702 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 446 transitions. [2024-11-10 02:56:31,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:56:31,702 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 446 transitions. [2024-11-10 02:56:31,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-10 02:56:31,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:56:31,702 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 02:56:31,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 02:56:31,702 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:56:31,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:56:31,703 INFO L85 PathProgramCache]: Analyzing trace with hash 2028812877, now seen corresponding path program 1 times [2024-11-10 02:56:31,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:56:31,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889190481] [2024-11-10 02:56:31,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:56:31,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:56:31,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:56:32,196 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-10 02:56:32,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:56:32,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889190481] [2024-11-10 02:56:32,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889190481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:56:32,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:56:32,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 02:56:32,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045695093] [2024-11-10 02:56:32,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:56:32,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 02:56:32,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:56:32,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 02:56:32,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:56:32,198 INFO L87 Difference]: Start difference. First operand 312 states and 446 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 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-10 02:56:34,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 02:56:35,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 02:56:35,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:56:35,296 INFO L93 Difference]: Finished difference Result 557 states and 798 transitions. [2024-11-10 02:56:35,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:56:35,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2024-11-10 02:56:35,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:56:35,298 INFO L225 Difference]: With dead ends: 557 [2024-11-10 02:56:35,299 INFO L226 Difference]: Without dead ends: 367 [2024-11-10 02:56:35,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 02:56:35,300 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 424 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:56:35,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 859 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-10 02:56:35,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-11-10 02:56:35,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 320. [2024-11-10 02:56:35,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 319 states have (on average 1.432601880877743) internal successors, (457), 319 states have internal predecessors, (457), 0 states have call successors, (0), 0 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-10 02:56:35,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 457 transitions. [2024-11-10 02:56:35,309 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 457 transitions. Word has length 86 [2024-11-10 02:56:35,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:56:35,309 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 457 transitions. [2024-11-10 02:56:35,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 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-10 02:56:35,309 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 457 transitions. [2024-11-10 02:56:35,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-10 02:56:35,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:56:35,310 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 02:56:35,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 02:56:35,310 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:56:35,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:56:35,310 INFO L85 PathProgramCache]: Analyzing trace with hash -84652141, now seen corresponding path program 1 times [2024-11-10 02:56:35,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:56:35,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383628982] [2024-11-10 02:56:35,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:56:35,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:56:35,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:56:35,837 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-10 02:56:35,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:56:35,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383628982] [2024-11-10 02:56:35,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383628982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:56:35,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:56:35,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 02:56:35,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474699442] [2024-11-10 02:56:35,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:56:35,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 02:56:35,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:56:35,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 02:56:35,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-10 02:56:35,840 INFO L87 Difference]: Start difference. First operand 320 states and 457 transitions. Second operand has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 states have internal predecessors, (87), 0 states have call successors, (0), 0 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-10 02:56:36,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:56:36,176 INFO L93 Difference]: Finished difference Result 533 states and 766 transitions. [2024-11-10 02:56:36,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 02:56:36,177 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2024-11-10 02:56:36,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:56:36,178 INFO L225 Difference]: With dead ends: 533 [2024-11-10 02:56:36,178 INFO L226 Difference]: Without dead ends: 323 [2024-11-10 02:56:36,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-10 02:56:36,179 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 2 mSDsluCounter, 2292 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2581 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 02:56:36,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2581 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 02:56:36,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-11-10 02:56:36,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 322. [2024-11-10 02:56:36,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 321 states have (on average 1.4361370716510904) internal successors, (461), 321 states have internal predecessors, (461), 0 states have call successors, (0), 0 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-10 02:56:36,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 461 transitions. [2024-11-10 02:56:36,183 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 461 transitions. Word has length 87 [2024-11-10 02:56:36,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:56:36,183 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 461 transitions. [2024-11-10 02:56:36,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 states have internal predecessors, (87), 0 states have call successors, (0), 0 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-10 02:56:36,184 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 461 transitions. [2024-11-10 02:56:36,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-10 02:56:36,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:56:36,184 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 02:56:36,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 02:56:36,185 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:56:36,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:56:36,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1903984114, now seen corresponding path program 1 times [2024-11-10 02:56:36,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:56:36,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353596518] [2024-11-10 02:56:36,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:56:36,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:56:36,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:56:36,429 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-10 02:56:36,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:56:36,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353596518] [2024-11-10 02:56:36,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353596518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:56:36,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:56:36,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 02:56:36,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018623219] [2024-11-10 02:56:36,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:56:36,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 02:56:36,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:56:36,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 02:56:36,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 02:56:36,432 INFO L87 Difference]: Start difference. First operand 322 states and 461 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 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-10 02:56:36,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:56:36,654 INFO L93 Difference]: Finished difference Result 542 states and 779 transitions. [2024-11-10 02:56:36,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 02:56:36,655 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2024-11-10 02:56:36,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:56:36,656 INFO L225 Difference]: With dead ends: 542 [2024-11-10 02:56:36,656 INFO L226 Difference]: Without dead ends: 340 [2024-11-10 02:56:36,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 02:56:36,657 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 6 mSDsluCounter, 1749 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2044 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:56:36,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2044 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 02:56:36,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2024-11-10 02:56:36,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 332. [2024-11-10 02:56:36,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 1.43202416918429) internal successors, (474), 331 states have internal predecessors, (474), 0 states have call successors, (0), 0 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-10 02:56:36,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 474 transitions. [2024-11-10 02:56:36,662 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 474 transitions. Word has length 88 [2024-11-10 02:56:36,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:56:36,662 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 474 transitions. [2024-11-10 02:56:36,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 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-10 02:56:36,663 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 474 transitions. [2024-11-10 02:56:36,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-10 02:56:36,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:56:36,663 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 02:56:36,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 02:56:36,663 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:56:36,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:56:36,664 INFO L85 PathProgramCache]: Analyzing trace with hash 196820079, now seen corresponding path program 1 times [2024-11-10 02:56:36,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:56:36,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145482552] [2024-11-10 02:56:36,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:56:36,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:56:36,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:56:37,244 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-10 02:56:37,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:56:37,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145482552] [2024-11-10 02:56:37,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145482552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:56:37,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:56:37,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-10 02:56:37,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362917414] [2024-11-10 02:56:37,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:56:37,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 02:56:37,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:56:37,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 02:56:37,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-10 02:56:37,246 INFO L87 Difference]: Start difference. First operand 332 states and 474 transitions. Second operand has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 15 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:56:37,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:56:37,719 INFO L93 Difference]: Finished difference Result 556 states and 799 transitions. [2024-11-10 02:56:37,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 02:56:37,719 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 15 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2024-11-10 02:56:37,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:56:37,721 INFO L225 Difference]: With dead ends: 556 [2024-11-10 02:56:37,721 INFO L226 Difference]: Without dead ends: 340 [2024-11-10 02:56:37,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-10 02:56:37,721 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 8 mSDsluCounter, 3365 mSDsCounter, 0 mSdLazyCounter, 1076 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3648 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 02:56:37,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3648 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1076 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 02:56:37,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2024-11-10 02:56:37,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 339. [2024-11-10 02:56:37,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 338 states have (on average 1.4319526627218935) internal successors, (484), 338 states have internal predecessors, (484), 0 states have call successors, (0), 0 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-10 02:56:37,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 484 transitions. [2024-11-10 02:56:37,726 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 484 transitions. Word has length 89 [2024-11-10 02:56:37,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:56:37,726 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 484 transitions. [2024-11-10 02:56:37,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 15 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:56:37,727 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 484 transitions. [2024-11-10 02:56:37,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-10 02:56:37,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:56:37,727 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 02:56:37,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 02:56:37,727 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:56:37,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:56:37,728 INFO L85 PathProgramCache]: Analyzing trace with hash 338762441, now seen corresponding path program 1 times [2024-11-10 02:56:37,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:56:37,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066355765] [2024-11-10 02:56:37,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:56:37,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:56:37,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:56:37,947 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-10 02:56:37,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:56:37,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066355765] [2024-11-10 02:56:37,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066355765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:56:37,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:56:37,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 02:56:37,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329410092] [2024-11-10 02:56:37,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:56:37,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 02:56:37,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:56:37,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 02:56:37,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 02:56:37,949 INFO L87 Difference]: Start difference. First operand 339 states and 484 transitions. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:56:38,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:56:38,123 INFO L93 Difference]: Finished difference Result 566 states and 813 transitions. [2024-11-10 02:56:38,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 02:56:38,124 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2024-11-10 02:56:38,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:56:38,125 INFO L225 Difference]: With dead ends: 566 [2024-11-10 02:56:38,125 INFO L226 Difference]: Without dead ends: 350 [2024-11-10 02:56:38,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 02:56:38,126 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 7 mSDsluCounter, 1170 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1465 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:56:38,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1465 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 02:56:38,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-11-10 02:56:38,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 346. [2024-11-10 02:56:38,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 345 states have (on average 1.4289855072463769) internal successors, (493), 345 states have internal predecessors, (493), 0 states have call successors, (0), 0 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-10 02:56:38,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 493 transitions. [2024-11-10 02:56:38,133 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 493 transitions. Word has length 89 [2024-11-10 02:56:38,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:56:38,133 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 493 transitions. [2024-11-10 02:56:38,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:56:38,133 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 493 transitions. [2024-11-10 02:56:38,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-10 02:56:38,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:56:38,133 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 02:56:38,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 02:56:38,134 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:56:38,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:56:38,134 INFO L85 PathProgramCache]: Analyzing trace with hash -49808496, now seen corresponding path program 1 times [2024-11-10 02:56:38,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:56:38,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617379797] [2024-11-10 02:56:38,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:56:38,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:56:38,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:56:38,703 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-10 02:56:38,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:56:38,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617379797] [2024-11-10 02:56:38,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617379797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:56:38,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:56:38,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-10 02:56:38,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580304862] [2024-11-10 02:56:38,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:56:38,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-10 02:56:38,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:56:38,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-10 02:56:38,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2024-11-10 02:56:38,706 INFO L87 Difference]: Start difference. First operand 346 states and 493 transitions. Second operand has 21 states, 21 states have (on average 4.238095238095238) internal successors, (89), 21 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:56:39,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:56:39,575 INFO L93 Difference]: Finished difference Result 634 states and 913 transitions. [2024-11-10 02:56:39,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-10 02:56:39,576 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.238095238095238) internal successors, (89), 21 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2024-11-10 02:56:39,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:56:39,577 INFO L225 Difference]: With dead ends: 634 [2024-11-10 02:56:39,577 INFO L226 Difference]: Without dead ends: 413 [2024-11-10 02:56:39,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2024-11-10 02:56:39,578 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 338 mSDsluCounter, 4712 mSDsCounter, 0 mSdLazyCounter, 1925 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 4976 SdHoareTripleChecker+Invalid, 1940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 02:56:39,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 4976 Invalid, 1940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1925 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 02:56:39,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-10 02:56:39,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 409. [2024-11-10 02:56:39,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 408 states have (on average 1.4362745098039216) internal successors, (586), 408 states have internal predecessors, (586), 0 states have call successors, (0), 0 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-10 02:56:39,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 586 transitions. [2024-11-10 02:56:39,583 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 586 transitions. Word has length 89 [2024-11-10 02:56:39,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:56:39,583 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 586 transitions. [2024-11-10 02:56:39,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.238095238095238) internal successors, (89), 21 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:56:39,583 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 586 transitions. [2024-11-10 02:56:39,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-10 02:56:39,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:56:39,584 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 02:56:39,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 02:56:39,584 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:56:39,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:56:39,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1659678681, now seen corresponding path program 1 times [2024-11-10 02:56:39,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:56:39,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678738952] [2024-11-10 02:56:39,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:56:39,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:56:39,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:56:39,877 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-10 02:56:39,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:56:39,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678738952] [2024-11-10 02:56:39,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678738952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:56:39,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:56:39,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 02:56:39,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312383128] [2024-11-10 02:56:39,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:56:39,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 02:56:39,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:56:39,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 02:56:39,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:56:39,878 INFO L87 Difference]: Start difference. First operand 409 states and 586 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:56:39,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:56:39,961 INFO L93 Difference]: Finished difference Result 697 states and 1005 transitions. [2024-11-10 02:56:39,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 02:56:39,961 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2024-11-10 02:56:39,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:56:39,963 INFO L225 Difference]: With dead ends: 697 [2024-11-10 02:56:39,963 INFO L226 Difference]: Without dead ends: 404 [2024-11-10 02:56:39,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:56:39,964 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:56:39,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 593 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:56:39,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-11-10 02:56:39,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2024-11-10 02:56:39,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 403 states have (on average 1.4267990074441688) internal successors, (575), 403 states have internal predecessors, (575), 0 states have call successors, (0), 0 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-10 02:56:39,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 575 transitions. [2024-11-10 02:56:39,968 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 575 transitions. Word has length 89 [2024-11-10 02:56:39,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:56:39,969 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 575 transitions. [2024-11-10 02:56:39,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:56:39,969 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 575 transitions. [2024-11-10 02:56:39,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-10 02:56:39,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:56:39,969 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 02:56:39,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 02:56:39,970 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:56:39,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:56:39,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1549170418, now seen corresponding path program 1 times [2024-11-10 02:56:39,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:56:39,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255687576] [2024-11-10 02:56:39,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:56:39,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:56:40,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 02:56:40,001 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 02:56:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 02:56:40,091 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 02:56:40,091 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 02:56:40,092 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 02:56:40,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-10 02:56:40,095 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, 1, 1, 1, 1] [2024-11-10 02:56:40,154 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 02:56:40,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 02:56:40 BoogieIcfgContainer [2024-11-10 02:56:40,163 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 02:56:40,164 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 02:56:40,164 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 02:56:40,164 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 02:56:40,164 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:55:46" (3/4) ... [2024-11-10 02:56:40,167 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 02:56:40,168 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 02:56:40,168 INFO L158 Benchmark]: Toolchain (without parser) took 56358.46ms. Allocated memory was 192.9MB in the beginning and 635.4MB in the end (delta: 442.5MB). Free memory was 121.2MB in the beginning and 219.2MB in the end (delta: -98.0MB). Peak memory consumption was 348.2MB. Max. memory is 16.1GB. [2024-11-10 02:56:40,168 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 117.4MB. Free memory is still 80.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 02:56:40,169 INFO L158 Benchmark]: CACSL2BoogieTranslator took 572.17ms. Allocated memory is still 192.9MB. Free memory was 120.9MB in the beginning and 143.0MB in the end (delta: -22.1MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. [2024-11-10 02:56:40,169 INFO L158 Benchmark]: Boogie Procedure Inliner took 119.65ms. Allocated memory is still 192.9MB. Free memory was 143.0MB in the beginning and 114.7MB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-10 02:56:40,169 INFO L158 Benchmark]: Boogie Preprocessor took 168.97ms. Allocated memory is still 192.9MB. Free memory was 114.7MB in the beginning and 95.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 02:56:40,169 INFO L158 Benchmark]: IcfgBuilder took 1601.03ms. Allocated memory was 192.9MB in the beginning and 367.0MB in the end (delta: 174.1MB). Free memory was 94.8MB in the beginning and 235.9MB in the end (delta: -141.2MB). Peak memory consumption was 73.5MB. Max. memory is 16.1GB. [2024-11-10 02:56:40,169 INFO L158 Benchmark]: TraceAbstraction took 53885.79ms. Allocated memory was 367.0MB in the beginning and 635.4MB in the end (delta: 268.4MB). Free memory was 235.9MB in the beginning and 219.2MB in the end (delta: 16.7MB). Peak memory consumption was 286.2MB. Max. memory is 16.1GB. [2024-11-10 02:56:40,169 INFO L158 Benchmark]: Witness Printer took 4.21ms. Allocated memory is still 635.4MB. Free memory is still 219.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 02:56:40,170 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.16ms. Allocated memory is still 117.4MB. Free memory is still 80.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 572.17ms. Allocated memory is still 192.9MB. Free memory was 120.9MB in the beginning and 143.0MB in the end (delta: -22.1MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 119.65ms. Allocated memory is still 192.9MB. Free memory was 143.0MB in the beginning and 114.7MB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 168.97ms. Allocated memory is still 192.9MB. Free memory was 114.7MB in the beginning and 95.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * IcfgBuilder took 1601.03ms. Allocated memory was 192.9MB in the beginning and 367.0MB in the end (delta: 174.1MB). Free memory was 94.8MB in the beginning and 235.9MB in the end (delta: -141.2MB). Peak memory consumption was 73.5MB. Max. memory is 16.1GB. * TraceAbstraction took 53885.79ms. Allocated memory was 367.0MB in the beginning and 635.4MB in the end (delta: 268.4MB). Free memory was 235.9MB in the beginning and 219.2MB in the end (delta: 16.7MB). Peak memory consumption was 286.2MB. Max. memory is 16.1GB. * Witness Printer took 4.21ms. Allocated memory is still 635.4MB. Free memory is still 219.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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 bitwiseAnd at line 191. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 8); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (8 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 2); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (2 - 1); [L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 1); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (1 - 1); [L35] const SORT_1 var_11 = 0; [L36] const SORT_5 var_45 = 1; [L37] const SORT_1 var_49 = 1; [L38] const SORT_5 var_60 = 0; [L39] const SORT_3 var_81 = 0; [L40] const SORT_3 var_90 = 1; [L41] const SORT_3 var_99 = 2; [L42] const SORT_3 var_108 = 3; [L44] SORT_1 input_2; [L45] SORT_3 input_4; [L46] SORT_5 input_6; [L47] SORT_1 input_7; [L48] SORT_3 input_8; [L49] SORT_3 input_9; [L50] SORT_5 input_10; [L52] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L52] SORT_1 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L53] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L53] SORT_1 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L54] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L54] SORT_1 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L55] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L55] SORT_1 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L56] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L56] SORT_1 state_50 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L57] SORT_1 state_52 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L58] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L58] SORT_1 state_54 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L59] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L59] SORT_1 state_56 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L60] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L60] SORT_5 state_58 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L61] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L61] SORT_5 state_61 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L62] SORT_5 state_63 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L63] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L63] SORT_5 state_65 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L64] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L64] SORT_1 state_68 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L65] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L65] SORT_1 state_70 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L66] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L66] SORT_1 state_72 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L67] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L67] SORT_1 state_74 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L69] SORT_1 init_13_arg_1 = var_11; [L70] state_12 = init_13_arg_1 [L71] SORT_1 init_16_arg_1 = var_11; [L72] state_15 = init_16_arg_1 [L73] SORT_1 init_21_arg_1 = var_11; [L74] state_20 = init_21_arg_1 [L75] SORT_1 init_27_arg_1 = var_11; [L76] state_26 = init_27_arg_1 [L77] SORT_1 init_51_arg_1 = var_49; [L78] state_50 = init_51_arg_1 [L79] SORT_1 init_53_arg_1 = var_11; [L80] state_52 = init_53_arg_1 [L81] SORT_1 init_55_arg_1 = var_11; [L82] state_54 = init_55_arg_1 [L83] SORT_1 init_57_arg_1 = var_11; [L84] state_56 = init_57_arg_1 [L85] SORT_5 init_59_arg_1 = var_45; [L86] state_58 = init_59_arg_1 [L87] SORT_5 init_62_arg_1 = var_60; [L88] state_61 = init_62_arg_1 [L89] SORT_5 init_64_arg_1 = var_60; [L90] state_63 = init_64_arg_1 [L91] SORT_5 init_66_arg_1 = var_60; [L92] state_65 = init_66_arg_1 [L93] SORT_1 init_69_arg_1 = var_11; [L94] state_68 = init_69_arg_1 [L95] SORT_1 init_71_arg_1 = var_11; [L96] state_70 = init_71_arg_1 [L97] SORT_1 init_73_arg_1 = var_11; [L98] state_72 = init_73_arg_1 [L99] SORT_1 init_75_arg_1 = var_11; [L100] state_74 = init_75_arg_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L103] input_2 = __VERIFIER_nondet_uchar() [L104] EXPR input_2 & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L104] input_2 = input_2 & mask_SORT_1 [L105] input_4 = __VERIFIER_nondet_uchar() [L106] EXPR input_4 & mask_SORT_3 VAL [input_2=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L106] input_4 = input_4 & mask_SORT_3 [L107] input_6 = __VERIFIER_nondet_uchar() [L108] input_7 = __VERIFIER_nondet_uchar() [L109] EXPR input_7 & mask_SORT_1 VAL [input_2=0, input_4=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L109] input_7 = input_7 & mask_SORT_1 [L110] input_8 = __VERIFIER_nondet_uchar() [L111] EXPR input_8 & mask_SORT_3 VAL [input_2=0, input_4=0, input_7=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L111] input_8 = input_8 & mask_SORT_3 [L112] input_9 = __VERIFIER_nondet_uchar() [L113] EXPR input_9 & mask_SORT_3 VAL [input_2=0, input_4=0, input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L113] input_9 = input_9 & mask_SORT_3 [L114] input_10 = __VERIFIER_nondet_uchar() [L115] EXPR input_10 & mask_SORT_5 VAL [input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L115] input_10 = input_10 & mask_SORT_5 [L118] SORT_1 var_14_arg_0 = state_12; [L119] SORT_1 var_14_arg_1 = var_11; [L120] SORT_5 var_14 = var_14_arg_0 == var_14_arg_1; [L121] SORT_1 var_17_arg_0 = state_12; [L122] SORT_1 var_17_arg_1 = state_15; [L123] SORT_5 var_17 = var_17_arg_0 != var_17_arg_1; [L124] SORT_5 var_18_arg_0 = var_14; [L125] SORT_5 var_18_arg_1 = var_17; VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_18_arg_0=1, var_18_arg_1=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L126] EXPR var_18_arg_0 | var_18_arg_1 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L126] SORT_5 var_18 = var_18_arg_0 | var_18_arg_1; [L127] SORT_1 var_19_arg_0 = state_12; [L128] SORT_1 var_19_arg_1 = var_11; [L129] SORT_5 var_19 = var_19_arg_0 == var_19_arg_1; [L130] SORT_1 var_22_arg_0 = state_12; [L131] SORT_1 var_22_arg_1 = state_20; [L132] SORT_5 var_22 = var_22_arg_0 != var_22_arg_1; [L133] SORT_5 var_23_arg_0 = var_19; [L134] SORT_5 var_23_arg_1 = var_22; VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_18=1, var_23_arg_0=1, var_23_arg_1=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L135] EXPR var_23_arg_0 | var_23_arg_1 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_18=1, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L135] SORT_5 var_23 = var_23_arg_0 | var_23_arg_1; [L136] SORT_5 var_24_arg_0 = var_18; [L137] SORT_5 var_24_arg_1 = var_23; VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_24_arg_0=1, var_24_arg_1=1, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L138] EXPR var_24_arg_0 & var_24_arg_1 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L138] SORT_5 var_24 = var_24_arg_0 & var_24_arg_1; [L139] SORT_1 var_25_arg_0 = state_12; [L140] SORT_1 var_25_arg_1 = var_11; [L141] SORT_5 var_25 = var_25_arg_0 == var_25_arg_1; [L142] SORT_1 var_28_arg_0 = state_12; [L143] SORT_1 var_28_arg_1 = state_26; [L144] SORT_5 var_28 = var_28_arg_0 != var_28_arg_1; [L145] SORT_5 var_29_arg_0 = var_25; [L146] SORT_5 var_29_arg_1 = var_28; VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_24=1, var_29_arg_0=1, var_29_arg_1=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L147] EXPR var_29_arg_0 | var_29_arg_1 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_24=1, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L147] SORT_5 var_29 = var_29_arg_0 | var_29_arg_1; [L148] SORT_5 var_30_arg_0 = var_24; [L149] SORT_5 var_30_arg_1 = var_29; VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_30_arg_0=1, var_30_arg_1=1, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L150] EXPR var_30_arg_0 & var_30_arg_1 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L150] SORT_5 var_30 = var_30_arg_0 & var_30_arg_1; [L151] SORT_1 var_31_arg_0 = state_15; [L152] SORT_1 var_31_arg_1 = var_11; [L153] SORT_5 var_31 = var_31_arg_0 == var_31_arg_1; [L154] SORT_1 var_32_arg_0 = state_15; [L155] SORT_1 var_32_arg_1 = state_20; [L156] SORT_5 var_32 = var_32_arg_0 != var_32_arg_1; [L157] SORT_5 var_33_arg_0 = var_31; [L158] SORT_5 var_33_arg_1 = var_32; VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_30=1, var_33_arg_0=1, var_33_arg_1=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L159] EXPR var_33_arg_0 | var_33_arg_1 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_30=1, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L159] SORT_5 var_33 = var_33_arg_0 | var_33_arg_1; [L160] SORT_5 var_34_arg_0 = var_30; [L161] SORT_5 var_34_arg_1 = var_33; VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_34_arg_0=1, var_34_arg_1=1, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L162] EXPR var_34_arg_0 & var_34_arg_1 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L162] SORT_5 var_34 = var_34_arg_0 & var_34_arg_1; [L163] SORT_1 var_35_arg_0 = state_15; [L164] SORT_1 var_35_arg_1 = var_11; [L165] SORT_5 var_35 = var_35_arg_0 == var_35_arg_1; [L166] SORT_1 var_36_arg_0 = state_15; [L167] SORT_1 var_36_arg_1 = state_26; [L168] SORT_5 var_36 = var_36_arg_0 != var_36_arg_1; [L169] SORT_5 var_37_arg_0 = var_35; [L170] SORT_5 var_37_arg_1 = var_36; VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_34=1, var_37_arg_0=1, var_37_arg_1=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L171] EXPR var_37_arg_0 | var_37_arg_1 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_34=1, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L171] SORT_5 var_37 = var_37_arg_0 | var_37_arg_1; [L172] SORT_5 var_38_arg_0 = var_34; [L173] SORT_5 var_38_arg_1 = var_37; VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_38_arg_0=1, var_38_arg_1=1, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L174] EXPR var_38_arg_0 & var_38_arg_1 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L174] SORT_5 var_38 = var_38_arg_0 & var_38_arg_1; [L175] SORT_1 var_39_arg_0 = state_20; [L176] SORT_1 var_39_arg_1 = var_11; [L177] SORT_5 var_39 = var_39_arg_0 == var_39_arg_1; [L178] SORT_1 var_40_arg_0 = state_20; [L179] SORT_1 var_40_arg_1 = state_26; [L180] SORT_5 var_40 = var_40_arg_0 != var_40_arg_1; [L181] SORT_5 var_41_arg_0 = var_39; [L182] SORT_5 var_41_arg_1 = var_40; VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_38=1, var_41_arg_0=1, var_41_arg_1=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L183] EXPR var_41_arg_0 | var_41_arg_1 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_38=1, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L183] SORT_5 var_41 = var_41_arg_0 | var_41_arg_1; [L184] SORT_5 var_42_arg_0 = var_38; [L185] SORT_5 var_42_arg_1 = var_41; VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_42_arg_0=1, var_42_arg_1=1, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L186] EXPR var_42_arg_0 & var_42_arg_1 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L186] SORT_5 var_42 = var_42_arg_0 & var_42_arg_1; [L187] SORT_5 var_46_arg_0 = var_42; [L188] SORT_5 var_46 = ~var_46_arg_0; [L189] SORT_5 var_47_arg_0 = var_45; [L190] SORT_5 var_47_arg_1 = var_46; VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_47_arg_0=1, var_47_arg_1=-2, var_60=0, var_81=0, var_90=1, var_99=2] [L191] EXPR var_47_arg_0 & var_47_arg_1 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L191] SORT_5 var_47 = var_47_arg_0 & var_47_arg_1; [L192] EXPR var_47 & mask_SORT_5 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L192] var_47 = var_47 & mask_SORT_5 [L193] SORT_5 bad_48_arg_0 = var_47; [L194] CALL __VERIFIER_assert(!(bad_48_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 249 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 53.8s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 41.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6279 SdHoareTripleChecker+Valid, 40.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6279 mSDsluCounter, 39174 SdHoareTripleChecker+Invalid, 38.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32544 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10966 IncrementalHoareTripleChecker+Invalid, 11000 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 6630 mSDtfsCounter, 10966 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 241 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=409occurred in iteration=22, InterpolantAutomatonStates: 185, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 670 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 10.7s InterpolantComputationTime, 2002 NumberOfCodeBlocks, 2002 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1889 ConstructedInterpolants, 0 QuantifiedInterpolants, 6135 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 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-10 02:56:40,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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.toy_lock_4.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 dc77f8e7fc201c8766f52fe3e014d6c5c37e220387f85127552a419acc9259b5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 02:56:42,385 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 02:56:42,457 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-10 02:56:42,463 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 02:56:42,464 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 02:56:42,495 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 02:56:42,496 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 02:56:42,496 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 02:56:42,496 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 02:56:42,497 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 02:56:42,497 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 02:56:42,497 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 02:56:42,498 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 02:56:42,498 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 02:56:42,499 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 02:56:42,499 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 02:56:42,501 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 02:56:42,502 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 02:56:42,502 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 02:56:42,502 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 02:56:42,502 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 02:56:42,505 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 02:56:42,506 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 02:56:42,506 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 02:56:42,506 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 02:56:42,506 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 02:56:42,506 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 02:56:42,507 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 02:56:42,507 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 02:56:42,507 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 02:56:42,507 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 02:56:42,507 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 02:56:42,508 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 02:56:42,508 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 02:56:42,508 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 02:56:42,508 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 02:56:42,508 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 02:56:42,508 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 02:56:42,508 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 02:56:42,509 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 02:56:42,509 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 02:56:42,510 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 -> dc77f8e7fc201c8766f52fe3e014d6c5c37e220387f85127552a419acc9259b5 [2024-11-10 02:56:42,797 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 02:56:42,823 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 02:56:42,831 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 02:56:42,833 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 02:56:42,833 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 02:56:42,834 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.toy_lock_4.c [2024-11-10 02:56:44,479 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 02:56:44,715 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 02:56:44,715 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.toy_lock_4.c [2024-11-10 02:56:44,729 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d096f99d/fb4c7cc39e314e72997dcbdf91bc314e/FLAG9d60d4df1 [2024-11-10 02:56:45,071 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d096f99d/fb4c7cc39e314e72997dcbdf91bc314e [2024-11-10 02:56:45,075 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 02:56:45,076 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 02:56:45,078 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 02:56:45,078 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 02:56:45,084 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 02:56:45,085 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:56:45" (1/1) ... [2024-11-10 02:56:45,085 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63facf93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:45, skipping insertion in model container [2024-11-10 02:56:45,086 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:56:45" (1/1) ... [2024-11-10 02:56:45,147 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 02:56:45,347 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.toy_lock_4.c[1250,1263] [2024-11-10 02:56:45,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 02:56:45,520 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 02:56:45,532 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.toy_lock_4.c[1250,1263] [2024-11-10 02:56:45,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 02:56:45,696 INFO L204 MainTranslator]: Completed translation [2024-11-10 02:56:45,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:45 WrapperNode [2024-11-10 02:56:45,697 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 02:56:45,698 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 02:56:45,698 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 02:56:45,698 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 02:56:45,704 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:45" (1/1) ... [2024-11-10 02:56:45,727 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:45" (1/1) ... [2024-11-10 02:56:45,791 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 899 [2024-11-10 02:56:45,791 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 02:56:45,792 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 02:56:45,792 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 02:56:45,792 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 02:56:45,804 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:45" (1/1) ... [2024-11-10 02:56:45,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:45" (1/1) ... [2024-11-10 02:56:45,816 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:45" (1/1) ... [2024-11-10 02:56:45,846 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-10 02:56:45,847 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:45" (1/1) ... [2024-11-10 02:56:45,847 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:45" (1/1) ... [2024-11-10 02:56:45,888 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:45" (1/1) ... [2024-11-10 02:56:45,890 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:45" (1/1) ... [2024-11-10 02:56:45,893 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:45" (1/1) ... [2024-11-10 02:56:45,896 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:45" (1/1) ... [2024-11-10 02:56:45,907 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 02:56:45,907 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 02:56:45,908 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 02:56:45,908 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 02:56:45,908 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:45" (1/1) ... [2024-11-10 02:56:45,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 02:56:45,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 02:56:45,940 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-10 02:56:45,942 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-10 02:56:45,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 02:56:45,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 02:56:45,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 02:56:45,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 02:56:46,146 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 02:56:46,148 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 02:56:46,808 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2024-11-10 02:56:46,809 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 02:56:46,820 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 02:56:46,820 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 02:56:46,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:56:46 BoogieIcfgContainer [2024-11-10 02:56:46,822 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 02:56:46,824 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 02:56:46,825 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 02:56:46,829 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 02:56:46,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:56:45" (1/3) ... [2024-11-10 02:56:46,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8bfade9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:56:46, skipping insertion in model container [2024-11-10 02:56:46,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:45" (2/3) ... [2024-11-10 02:56:46,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8bfade9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:56:46, skipping insertion in model container [2024-11-10 02:56:46,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:56:46" (3/3) ... [2024-11-10 02:56:46,831 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.toy_lock_4.c [2024-11-10 02:56:46,846 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 02:56:46,846 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 02:56:46,898 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 02:56:46,904 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;@5f2755b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 02:56:46,904 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 02:56:46,908 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 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-10 02:56:46,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 02:56:46,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:56:46,914 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 02:56:46,915 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:56:46,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:56:46,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1271070717, now seen corresponding path program 1 times [2024-11-10 02:56:46,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 02:56:46,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1164310660] [2024-11-10 02:56:46,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:56:46,932 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-10 02:56:46,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 02:56:46,935 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-10 02:56:46,940 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-10 02:56:47,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:56:47,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-10 02:56:47,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 02:56:47,564 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-10 02:56:47,567 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 02:56:47,568 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 02:56:47,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1164310660] [2024-11-10 02:56:47,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1164310660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:56:47,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:56:47,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 02:56:47,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152218374] [2024-11-10 02:56:47,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:56:47,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 02:56:47,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 02:56:47,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 02:56:47,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:56:47,597 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 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) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 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-10 02:56:47,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:56:47,661 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2024-11-10 02:56:47,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 02:56:47,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-11-10 02:56:47,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:56:47,669 INFO L225 Difference]: With dead ends: 22 [2024-11-10 02:56:47,670 INFO L226 Difference]: Without dead ends: 11 [2024-11-10 02:56:47,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-10 02:56:47,677 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 14 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-10 02:56:47,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 14 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 02:56:47,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-11-10 02:56:47,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2024-11-10 02:56:47,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 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-10 02:56:47,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2024-11-10 02:56:47,702 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2024-11-10 02:56:47,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:56:47,703 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2024-11-10 02:56:47,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 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-10 02:56:47,703 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2024-11-10 02:56:47,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-10 02:56:47,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:56:47,704 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:56:47,710 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-10 02:56:47,904 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-10 02:56:47,906 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:56:47,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:56:47,907 INFO L85 PathProgramCache]: Analyzing trace with hash 2061110753, now seen corresponding path program 1 times [2024-11-10 02:56:47,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 02:56:47,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [347772283] [2024-11-10 02:56:47,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:56:47,910 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-10 02:56:47,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 02:56:47,914 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-10 02:56:47,916 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-10 02:56:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:56:48,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 94 conjuncts are in the unsatisfiable core [2024-11-10 02:56:48,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 02:56:53,507 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-10 02:56:53,507 INFO L311 TraceCheckSpWp]: Computing backward predicates...