./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_non-pipelined-microprocessor.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_non-pipelined-microprocessor.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 013fc4a889617293119ec23d82d2fd495e032e9bab1929da87247ff74d1355ed --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 06:58:09,565 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 06:58:09,635 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 06:58:09,645 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 06:58:09,647 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 06:58:09,671 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 06:58:09,672 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 06:58:09,673 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 06:58:09,673 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 06:58:09,675 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 06:58:09,675 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 06:58:09,675 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 06:58:09,676 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 06:58:09,676 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 06:58:09,678 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 06:58:09,679 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 06:58:09,679 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 06:58:09,679 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 06:58:09,680 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 06:58:09,680 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 06:58:09,680 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 06:58:09,680 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 06:58:09,681 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 06:58:09,681 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 06:58:09,681 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 06:58:09,681 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 06:58:09,681 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 06:58:09,681 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 06:58:09,682 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 06:58:09,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:58:09,682 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 06:58:09,682 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 06:58:09,682 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 06:58:09,682 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 06:58:09,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 06:58:09,683 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 06:58:09,683 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 06:58:09,683 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 06:58:09,683 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 06:58:09,683 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-clean/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-clean/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 -> 013fc4a889617293119ec23d82d2fd495e032e9bab1929da87247ff74d1355ed [2024-10-11 06:58:09,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 06:58:09,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 06:58:09,945 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 06:58:09,947 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 06:58:09,948 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 06:58:09,949 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_non-pipelined-microprocessor.c [2024-10-11 06:58:11,295 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 06:58:11,494 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 06:58:11,495 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_non-pipelined-microprocessor.c [2024-10-11 06:58:11,503 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ffd20a9ab/d01a44cce824400faf767649abd13e92/FLAG20954de7b [2024-10-11 06:58:11,516 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ffd20a9ab/d01a44cce824400faf767649abd13e92 [2024-10-11 06:58:11,519 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 06:58:11,521 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 06:58:11,523 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 06:58:11,523 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 06:58:11,528 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 06:58:11,528 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:58:11" (1/1) ... [2024-10-11 06:58:11,529 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79dc02c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:11, skipping insertion in model container [2024-10-11 06:58:11,529 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:58:11" (1/1) ... [2024-10-11 06:58:11,567 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 06:58:11,723 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_non-pipelined-microprocessor.c[1270,1283] [2024-10-11 06:58:11,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:58:11,864 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 06:58:11,876 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_non-pipelined-microprocessor.c[1270,1283] [2024-10-11 06:58:12,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:58:12,022 INFO L204 MainTranslator]: Completed translation [2024-10-11 06:58:12,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:12 WrapperNode [2024-10-11 06:58:12,023 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 06:58:12,024 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 06:58:12,024 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 06:58:12,024 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 06:58:12,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:12" (1/1) ... [2024-10-11 06:58:12,055 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:12" (1/1) ... [2024-10-11 06:58:12,181 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1101 [2024-10-11 06:58:12,181 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 06:58:12,182 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 06:58:12,182 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 06:58:12,182 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 06:58:12,191 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:12" (1/1) ... [2024-10-11 06:58:12,191 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:12" (1/1) ... [2024-10-11 06:58:12,228 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:12" (1/1) ... [2024-10-11 06:58:12,286 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 06:58:12,287 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:12" (1/1) ... [2024-10-11 06:58:12,287 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:12" (1/1) ... [2024-10-11 06:58:12,326 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:12" (1/1) ... [2024-10-11 06:58:12,336 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:12" (1/1) ... [2024-10-11 06:58:12,345 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:12" (1/1) ... [2024-10-11 06:58:12,354 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:12" (1/1) ... [2024-10-11 06:58:12,370 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 06:58:12,372 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 06:58:12,372 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 06:58:12,372 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 06:58:12,373 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:12" (1/1) ... [2024-10-11 06:58:12,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:58:12,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 06:58:12,405 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 06:58:12,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 06:58:12,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 06:58:12,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 06:58:12,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 06:58:12,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 06:58:12,606 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 06:58:12,608 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 06:58:13,732 INFO L? ?]: Removed 643 outVars from TransFormulas that were not future-live. [2024-10-11 06:58:13,732 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 06:58:13,773 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 06:58:13,774 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 06:58:13,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:58:13 BoogieIcfgContainer [2024-10-11 06:58:13,775 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 06:58:13,776 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 06:58:13,777 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 06:58:13,780 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 06:58:13,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:58:11" (1/3) ... [2024-10-11 06:58:13,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4237e473 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:58:13, skipping insertion in model container [2024-10-11 06:58:13,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:12" (2/3) ... [2024-10-11 06:58:13,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4237e473 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:58:13, skipping insertion in model container [2024-10-11 06:58:13,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:58:13" (3/3) ... [2024-10-11 06:58:13,783 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.v_non-pipelined-microprocessor.c [2024-10-11 06:58:13,801 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 06:58:13,801 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 06:58:13,861 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 06:58:13,867 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;@7abad4ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 06:58:13,868 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 06:58:13,872 INFO L276 IsEmpty]: Start isEmpty. Operand has 252 states, 250 states have (on average 1.504) internal successors, (376), 251 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:58:13,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 06:58:13,880 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:58:13,881 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-10-11 06:58:13,882 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:58:13,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:58:13,886 INFO L85 PathProgramCache]: Analyzing trace with hash 2023239298, now seen corresponding path program 1 times [2024-10-11 06:58:13,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:58:13,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049190540] [2024-10-11 06:58:13,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:58:13,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:58:14,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:58:14,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:58:14,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:58:14,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049190540] [2024-10-11 06:58:14,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049190540] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:58:14,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:58:14,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:58:14,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35748388] [2024-10-11 06:58:14,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:58:14,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:58:14,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:58:14,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:58:14,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:58:14,956 INFO L87 Difference]: Start difference. First operand has 252 states, 250 states have (on average 1.504) internal successors, (376), 251 states have internal predecessors, (376), 0 states have call successors, (0), 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-10-11 06:58:15,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:58:15,016 INFO L93 Difference]: Finished difference Result 472 states and 706 transitions. [2024-10-11 06:58:15,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:58:15,021 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-10-11 06:58:15,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:58:15,032 INFO L225 Difference]: With dead ends: 472 [2024-10-11 06:58:15,033 INFO L226 Difference]: Without dead ends: 253 [2024-10-11 06:58:15,036 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-10-11 06:58:15,041 INFO L432 NwaCegarLoop]: 371 mSDtfsCounter, 0 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:58:15,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1108 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:58:15,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-10-11 06:58:15,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2024-10-11 06:58:15,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 252 states have (on average 1.492063492063492) internal successors, (376), 252 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:58:15,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 376 transitions. [2024-10-11 06:58:15,083 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 376 transitions. Word has length 76 [2024-10-11 06:58:15,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:58:15,084 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 376 transitions. [2024-10-11 06:58:15,085 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-10-11 06:58:15,085 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 376 transitions. [2024-10-11 06:58:15,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 06:58:15,087 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:58:15,087 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-10-11 06:58:15,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 06:58:15,087 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:58:15,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:58:15,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1702395581, now seen corresponding path program 1 times [2024-10-11 06:58:15,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:58:15,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543807407] [2024-10-11 06:58:15,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:58:15,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:58:15,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:58:15,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:58:15,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:58:15,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543807407] [2024-10-11 06:58:15,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543807407] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:58:15,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:58:15,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:58:15,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619138620] [2024-10-11 06:58:15,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:58:15,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:58:15,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:58:15,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:58:15,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:58:15,506 INFO L87 Difference]: Start difference. First operand 253 states and 376 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-10-11 06:58:15,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:58:15,551 INFO L93 Difference]: Finished difference Result 475 states and 706 transitions. [2024-10-11 06:58:15,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:58:15,552 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-10-11 06:58:15,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:58:15,554 INFO L225 Difference]: With dead ends: 475 [2024-10-11 06:58:15,554 INFO L226 Difference]: Without dead ends: 255 [2024-10-11 06:58:15,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:58:15,556 INFO L432 NwaCegarLoop]: 371 mSDtfsCounter, 0 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:58:15,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1105 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:58:15,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-10-11 06:58:15,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2024-10-11 06:58:15,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 254 states have (on average 1.4881889763779528) internal successors, (378), 254 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:58:15,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 378 transitions. [2024-10-11 06:58:15,580 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 378 transitions. Word has length 77 [2024-10-11 06:58:15,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:58:15,580 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 378 transitions. [2024-10-11 06:58:15,581 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-10-11 06:58:15,581 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 378 transitions. [2024-10-11 06:58:15,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 06:58:15,586 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:58:15,586 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-10-11 06:58:15,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 06:58:15,587 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:58:15,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:58:15,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1962346363, now seen corresponding path program 1 times [2024-10-11 06:58:15,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:58:15,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121881342] [2024-10-11 06:58:15,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:58:15,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:58:15,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:58:16,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:58:16,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:58:16,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121881342] [2024-10-11 06:58:16,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121881342] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:58:16,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:58:16,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:58:16,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846673865] [2024-10-11 06:58:16,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:58:16,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 06:58:16,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:58:16,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 06:58:16,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:58:16,281 INFO L87 Difference]: Start difference. First operand 255 states and 378 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 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-10-11 06:58:16,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:58:16,329 INFO L93 Difference]: Finished difference Result 481 states and 713 transitions. [2024-10-11 06:58:16,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:58:16,331 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 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-10-11 06:58:16,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:58:16,332 INFO L225 Difference]: With dead ends: 481 [2024-10-11 06:58:16,333 INFO L226 Difference]: Without dead ends: 259 [2024-10-11 06:58:16,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-10-11 06:58:16,335 INFO L432 NwaCegarLoop]: 369 mSDtfsCounter, 310 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:58:16,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 1101 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:58:16,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-10-11 06:58:16,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 258. [2024-10-11 06:58:16,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 257 states have (on average 1.482490272373541) internal successors, (381), 257 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:58:16,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 381 transitions. [2024-10-11 06:58:16,343 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 381 transitions. Word has length 78 [2024-10-11 06:58:16,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:58:16,344 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 381 transitions. [2024-10-11 06:58:16,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 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-10-11 06:58:16,344 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 381 transitions. [2024-10-11 06:58:16,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 06:58:16,347 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:58:16,347 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-10-11 06:58:16,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 06:58:16,347 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:58:16,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:58:16,348 INFO L85 PathProgramCache]: Analyzing trace with hash -2027226618, now seen corresponding path program 1 times [2024-10-11 06:58:16,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:58:16,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821780919] [2024-10-11 06:58:16,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:58:16,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:58:17,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:58:31,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:58:31,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:58:31,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821780919] [2024-10-11 06:58:31,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821780919] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:58:31,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:58:31,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 06:58:31,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384040629] [2024-10-11 06:58:31,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:58:31,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 06:58:31,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:58:31,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 06:58:31,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-10-11 06:58:31,786 INFO L87 Difference]: Start difference. First operand 258 states and 381 transitions. Second operand has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 14 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-10-11 06:58:34,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 06:59:01,207 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (div |c_ULTIMATE.start_main_~mask_SORT_5~0#1| 256))) (and (= |c_ULTIMATE.start_main_~var_36~0#1| 1) (let ((.cse0 (* 7 |c_ULTIMATE.start_main_~var_42~0#1|))) (or (< (+ 575 .cse0) (* (div (+ 968 .cse0) 16384) 16384)) (< (+ 35 .cse0) (* (div (+ 428 .cse0) 16384) 16384)))) (let ((.cse1 (* |c_ULTIMATE.start_main_~var_42~0#1| 63))) (or (< (+ 35 .cse1) (* (div (+ 36 .cse1) 16384) 16384)) (< 35 (+ (* (div (+ (* (- 1) |c_ULTIMATE.start_main_~var_42~0#1|) 36) 2048) 2048) |c_ULTIMATE.start_main_~var_42~0#1|)) (< (+ 575 .cse1) (* (div (+ 576 .cse1) 16384) 16384)))) (= |c_ULTIMATE.start_main_~var_29~0#1| 54) (<= 7 |c_ULTIMATE.start_main_~mask_SORT_5~0#1|) (= 9 |c_ULTIMATE.start_main_~var_24~0#1|) (= |c_ULTIMATE.start_main_~var_19~0#1| 2544) (<= (+ (* (div |c_ULTIMATE.start_main_~var_108_arg_0~0#1| 256) 256) 34) |c_ULTIMATE.start_main_~var_108_arg_0~0#1|) (= 4 |c_ULTIMATE.start_main_~var_21~0#1|) (= 36 |c_ULTIMATE.start_main_~var_14~0#1|) (= |c_ULTIMATE.start_main_~var_34~0#1| 18) (not (= (* 256 .cse2) |c_ULTIMATE.start_main_~mask_SORT_5~0#1|)) (= 6 |c_ULTIMATE.start_main_~var_11~0#1|) (= 576 |c_ULTIMATE.start_main_~var_4~0#1|) (= |c_ULTIMATE.start_main_~var_31~0#1| 2) (<= .cse2 0))) is different from false [2024-10-11 06:59:10,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:59:10,785 INFO L93 Difference]: Finished difference Result 971 states and 1426 transitions. [2024-10-11 06:59:10,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 06:59:10,786 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 14 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-10-11 06:59:10,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:59:10,792 INFO L225 Difference]: With dead ends: 971 [2024-10-11 06:59:10,792 INFO L226 Difference]: Without dead ends: 746 [2024-10-11 06:59:10,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 22.6s TimeCoverageRelationStatistics Valid=95, Invalid=506, Unknown=3, NotChecked=46, Total=650 [2024-10-11 06:59:10,794 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 876 mSDsluCounter, 2679 mSDsCounter, 0 mSdLazyCounter, 3994 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 876 SdHoareTripleChecker+Valid, 2931 SdHoareTripleChecker+Invalid, 4011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 16.7s IncrementalHoareTripleChecker+Time [2024-10-11 06:59:10,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [876 Valid, 2931 Invalid, 4011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 3994 Invalid, 0 Unknown, 14 Unchecked, 16.7s Time] [2024-10-11 06:59:10,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2024-10-11 06:59:10,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 535. [2024-10-11 06:59:10,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 534 states have (on average 1.4831460674157304) internal successors, (792), 534 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:10,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 792 transitions. [2024-10-11 06:59:10,815 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 792 transitions. Word has length 79 [2024-10-11 06:59:10,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:59:10,816 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 792 transitions. [2024-10-11 06:59:10,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 14 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-10-11 06:59:10,816 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 792 transitions. [2024-10-11 06:59:10,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 06:59:10,822 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:59:10,822 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-10-11 06:59:10,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 06:59:10,822 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:59:10,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:59:10,823 INFO L85 PathProgramCache]: Analyzing trace with hash 2102346735, now seen corresponding path program 1 times [2024-10-11 06:59:10,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:59:10,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734909510] [2024-10-11 06:59:10,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:59:10,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:59:10,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:59:11,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:59:11,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:59:11,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734909510] [2024-10-11 06:59:11,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734909510] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:59:11,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:59:11,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:59:11,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888073854] [2024-10-11 06:59:11,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:59:11,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 06:59:11,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:59:11,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 06:59:11,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:59:11,112 INFO L87 Difference]: Start difference. First operand 535 states and 792 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 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-10-11 06:59:11,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:59:11,177 INFO L93 Difference]: Finished difference Result 1295 states and 1911 transitions. [2024-10-11 06:59:11,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:59:11,177 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 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-10-11 06:59:11,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:59:11,180 INFO L225 Difference]: With dead ends: 1295 [2024-10-11 06:59:11,180 INFO L226 Difference]: Without dead ends: 793 [2024-10-11 06:59:11,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:59:11,181 INFO L432 NwaCegarLoop]: 362 mSDtfsCounter, 222 mSDsluCounter, 1034 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 1396 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:59:11,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 1396 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:59:11,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2024-10-11 06:59:11,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 541. [2024-10-11 06:59:11,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 540 states have (on average 1.4814814814814814) internal successors, (800), 540 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:11,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 800 transitions. [2024-10-11 06:59:11,201 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 800 transitions. Word has length 80 [2024-10-11 06:59:11,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:59:11,201 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 800 transitions. [2024-10-11 06:59:11,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 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-10-11 06:59:11,202 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 800 transitions. [2024-10-11 06:59:11,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 06:59:11,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:59:11,203 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-10-11 06:59:11,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 06:59:11,203 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:59:11,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:59:11,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1195495519, now seen corresponding path program 1 times [2024-10-11 06:59:11,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:59:11,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272177409] [2024-10-11 06:59:11,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:59:11,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:59:11,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:59:11,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:59:11,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:59:11,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272177409] [2024-10-11 06:59:11,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272177409] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:59:11,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:59:11,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 06:59:11,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872248017] [2024-10-11 06:59:11,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:59:11,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 06:59:11,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:59:11,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 06:59:11,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:59:11,735 INFO L87 Difference]: Start difference. First operand 541 states and 800 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 6 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-10-11 06:59:12,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:59:12,277 INFO L93 Difference]: Finished difference Result 1085 states and 1605 transitions. [2024-10-11 06:59:12,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 06:59:12,278 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 6 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-10-11 06:59:12,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:59:12,280 INFO L225 Difference]: With dead ends: 1085 [2024-10-11 06:59:12,280 INFO L226 Difference]: Without dead ends: 583 [2024-10-11 06:59:12,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-11 06:59:12,282 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 361 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 06:59:12,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 713 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 855 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 06:59:12,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2024-10-11 06:59:12,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 545. [2024-10-11 06:59:12,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 544 states have (on average 1.4779411764705883) internal successors, (804), 544 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:12,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 804 transitions. [2024-10-11 06:59:12,297 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 804 transitions. Word has length 80 [2024-10-11 06:59:12,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:59:12,299 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 804 transitions. [2024-10-11 06:59:12,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 6 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-10-11 06:59:12,300 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 804 transitions. [2024-10-11 06:59:12,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 06:59:12,301 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:59:12,301 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-10-11 06:59:12,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 06:59:12,301 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:59:12,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:59:12,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1021634624, now seen corresponding path program 1 times [2024-10-11 06:59:12,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:59:12,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016309572] [2024-10-11 06:59:12,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:59:12,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:59:12,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:59:12,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:59:12,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:59:12,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016309572] [2024-10-11 06:59:12,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016309572] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:59:12,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:59:12,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 06:59:12,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656836586] [2024-10-11 06:59:12,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:59:12,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 06:59:12,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:59:12,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 06:59:12,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:59:12,770 INFO L87 Difference]: Start difference. First operand 545 states and 804 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 6 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-10-11 06:59:13,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:59:13,331 INFO L93 Difference]: Finished difference Result 1093 states and 1613 transitions. [2024-10-11 06:59:13,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 06:59:13,333 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 6 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-10-11 06:59:13,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:59:13,335 INFO L225 Difference]: With dead ends: 1093 [2024-10-11 06:59:13,335 INFO L226 Difference]: Without dead ends: 587 [2024-10-11 06:59:13,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-11 06:59:13,336 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 374 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 866 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 06:59:13,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 714 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 866 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 06:59:13,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2024-10-11 06:59:13,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 549. [2024-10-11 06:59:13,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 548 states have (on average 1.4744525547445255) internal successors, (808), 548 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:13,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 808 transitions. [2024-10-11 06:59:13,348 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 808 transitions. Word has length 80 [2024-10-11 06:59:13,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:59:13,349 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 808 transitions. [2024-10-11 06:59:13,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 6 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-10-11 06:59:13,349 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 808 transitions. [2024-10-11 06:59:13,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 06:59:13,350 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:59:13,350 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:59:13,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 06:59:13,351 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:59:13,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:59:13,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1063396327, now seen corresponding path program 1 times [2024-10-11 06:59:13,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:59:13,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288979881] [2024-10-11 06:59:13,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:59:13,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:59:13,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:59:17,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:59:17,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:59:17,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288979881] [2024-10-11 06:59:17,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288979881] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:59:17,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:59:17,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 06:59:17,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029903824] [2024-10-11 06:59:17,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:59:17,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 06:59:17,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:59:17,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 06:59:17,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-11 06:59:17,258 INFO L87 Difference]: Start difference. First operand 549 states and 808 transitions. Second operand has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 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-10-11 06:59:18,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:59:18,883 INFO L93 Difference]: Finished difference Result 1369 states and 2007 transitions. [2024-10-11 06:59:18,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 06:59:18,884 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 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-10-11 06:59:18,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:59:18,886 INFO L225 Difference]: With dead ends: 1369 [2024-10-11 06:59:18,886 INFO L226 Difference]: Without dead ends: 859 [2024-10-11 06:59:18,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2024-10-11 06:59:18,888 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 862 mSDsluCounter, 1239 mSDsCounter, 0 mSdLazyCounter, 1875 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 1421 SdHoareTripleChecker+Invalid, 1881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 06:59:18,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 1421 Invalid, 1881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1875 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 06:59:18,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2024-10-11 06:59:18,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 585. [2024-10-11 06:59:18,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 584 states have (on average 1.4726027397260273) internal successors, (860), 584 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:18,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 860 transitions. [2024-10-11 06:59:18,901 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 860 transitions. Word has length 80 [2024-10-11 06:59:18,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:59:18,901 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 860 transitions. [2024-10-11 06:59:18,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 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-10-11 06:59:18,901 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 860 transitions. [2024-10-11 06:59:18,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 06:59:18,902 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:59:18,902 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-10-11 06:59:18,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 06:59:18,902 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:59:18,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:59:18,903 INFO L85 PathProgramCache]: Analyzing trace with hash 239798473, now seen corresponding path program 1 times [2024-10-11 06:59:18,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:59:18,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623175263] [2024-10-11 06:59:18,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:59:18,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:59:19,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:59:19,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:59:19,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:59:19,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623175263] [2024-10-11 06:59:19,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623175263] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:59:19,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:59:19,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 06:59:19,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970761154] [2024-10-11 06:59:19,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:59:19,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 06:59:19,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:59:19,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 06:59:19,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:59:19,377 INFO L87 Difference]: Start difference. First operand 585 states and 860 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 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-10-11 06:59:19,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:59:19,927 INFO L93 Difference]: Finished difference Result 1173 states and 1725 transitions. [2024-10-11 06:59:19,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 06:59:19,928 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 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-10-11 06:59:19,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:59:19,930 INFO L225 Difference]: With dead ends: 1173 [2024-10-11 06:59:19,930 INFO L226 Difference]: Without dead ends: 627 [2024-10-11 06:59:19,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:59:19,931 INFO L432 NwaCegarLoop]: 363 mSDtfsCounter, 35 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 06:59:19,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 1250 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 06:59:19,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2024-10-11 06:59:19,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 585. [2024-10-11 06:59:19,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 584 states have (on average 1.4726027397260273) internal successors, (860), 584 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:19,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 860 transitions. [2024-10-11 06:59:19,943 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 860 transitions. Word has length 81 [2024-10-11 06:59:19,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:59:19,944 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 860 transitions. [2024-10-11 06:59:19,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 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-10-11 06:59:19,944 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 860 transitions. [2024-10-11 06:59:19,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 06:59:19,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:59:19,946 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-10-11 06:59:19,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 06:59:19,946 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:59:19,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:59:19,947 INFO L85 PathProgramCache]: Analyzing trace with hash 427993901, now seen corresponding path program 1 times [2024-10-11 06:59:19,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:59:19,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825832926] [2024-10-11 06:59:19,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:59:19,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:59:20,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:59:20,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:59:20,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:59:20,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825832926] [2024-10-11 06:59:20,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825832926] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:59:20,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:59:20,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 06:59:20,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98379898] [2024-10-11 06:59:20,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:59:20,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 06:59:20,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:59:20,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 06:59:20,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:59:20,464 INFO L87 Difference]: Start difference. First operand 585 states and 860 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 6 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-10-11 06:59:21,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:59:21,135 INFO L93 Difference]: Finished difference Result 1381 states and 2022 transitions. [2024-10-11 06:59:21,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 06:59:21,135 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 6 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-10-11 06:59:21,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:59:21,138 INFO L225 Difference]: With dead ends: 1381 [2024-10-11 06:59:21,138 INFO L226 Difference]: Without dead ends: 835 [2024-10-11 06:59:21,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-11 06:59:21,140 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 575 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 06:59:21,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 867 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 06:59:21,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2024-10-11 06:59:21,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 595. [2024-10-11 06:59:21,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 594 states have (on average 1.468013468013468) internal successors, (872), 594 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:21,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 872 transitions. [2024-10-11 06:59:21,151 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 872 transitions. Word has length 81 [2024-10-11 06:59:21,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:59:21,152 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 872 transitions. [2024-10-11 06:59:21,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 6 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-10-11 06:59:21,152 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 872 transitions. [2024-10-11 06:59:21,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 06:59:21,153 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:59:21,153 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-10-11 06:59:21,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 06:59:21,153 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:59:21,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:59:21,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1383948286, now seen corresponding path program 1 times [2024-10-11 06:59:21,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:59:21,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103881289] [2024-10-11 06:59:21,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:59:21,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:59:21,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:59:21,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:59:21,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:59:21,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103881289] [2024-10-11 06:59:21,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103881289] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:59:21,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:59:21,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 06:59:21,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607699098] [2024-10-11 06:59:21,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:59:21,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 06:59:21,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:59:21,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 06:59:21,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:59:21,494 INFO L87 Difference]: Start difference. First operand 595 states and 872 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 5 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-10-11 06:59:21,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:59:21,544 INFO L93 Difference]: Finished difference Result 1288 states and 1882 transitions. [2024-10-11 06:59:21,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:59:21,544 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 5 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-10-11 06:59:21,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:59:21,546 INFO L225 Difference]: With dead ends: 1288 [2024-10-11 06:59:21,546 INFO L226 Difference]: Without dead ends: 732 [2024-10-11 06:59:21,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:59:21,547 INFO L432 NwaCegarLoop]: 362 mSDtfsCounter, 212 mSDsluCounter, 1034 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 1396 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:59:21,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 1396 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:59:21,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2024-10-11 06:59:21,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 601. [2024-10-11 06:59:21,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 600 states have (on average 1.4666666666666666) internal successors, (880), 600 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:21,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 880 transitions. [2024-10-11 06:59:21,557 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 880 transitions. Word has length 81 [2024-10-11 06:59:21,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:59:21,557 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 880 transitions. [2024-10-11 06:59:21,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 5 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-10-11 06:59:21,557 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 880 transitions. [2024-10-11 06:59:21,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 06:59:21,558 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:59:21,558 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-10-11 06:59:21,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 06:59:21,558 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:59:21,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:59:21,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1960876996, now seen corresponding path program 1 times [2024-10-11 06:59:21,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:59:21,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664811917] [2024-10-11 06:59:21,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:59:21,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:59:21,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:59:21,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:59:21,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:59:21,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664811917] [2024-10-11 06:59:21,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664811917] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:59:21,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:59:21,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 06:59:21,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743282988] [2024-10-11 06:59:21,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:59:21,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 06:59:21,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:59:21,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 06:59:21,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:59:21,914 INFO L87 Difference]: Start difference. First operand 601 states and 880 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:22,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:59:22,337 INFO L93 Difference]: Finished difference Result 1195 states and 1751 transitions. [2024-10-11 06:59:22,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 06:59:22,337 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 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-10-11 06:59:22,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:59:22,339 INFO L225 Difference]: With dead ends: 1195 [2024-10-11 06:59:22,339 INFO L226 Difference]: Without dead ends: 639 [2024-10-11 06:59:22,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:59:22,340 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 29 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 06:59:22,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 1202 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 06:59:22,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2024-10-11 06:59:22,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 609. [2024-10-11 06:59:22,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 608 states have (on average 1.4638157894736843) internal successors, (890), 608 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:22,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 890 transitions. [2024-10-11 06:59:22,349 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 890 transitions. Word has length 82 [2024-10-11 06:59:22,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:59:22,350 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 890 transitions. [2024-10-11 06:59:22,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:22,350 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 890 transitions. [2024-10-11 06:59:22,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-11 06:59:22,350 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:59:22,351 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-10-11 06:59:22,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 06:59:22,351 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:59:22,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:59:22,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1182359600, now seen corresponding path program 1 times [2024-10-11 06:59:22,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:59:22,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888617183] [2024-10-11 06:59:22,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:59:22,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:59:22,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:59:22,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:59:22,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:59:22,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888617183] [2024-10-11 06:59:22,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888617183] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:59:22,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:59:22,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 06:59:22,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907427293] [2024-10-11 06:59:22,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:59:22,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 06:59:22,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:59:22,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 06:59:22,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:59:22,895 INFO L87 Difference]: Start difference. First operand 609 states and 890 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) 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-10-11 06:59:23,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:59:23,713 INFO L93 Difference]: Finished difference Result 1421 states and 2070 transitions. [2024-10-11 06:59:23,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 06:59:23,714 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) 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-10-11 06:59:23,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:59:23,716 INFO L225 Difference]: With dead ends: 1421 [2024-10-11 06:59:23,716 INFO L226 Difference]: Without dead ends: 857 [2024-10-11 06:59:23,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-10-11 06:59:23,717 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 551 mSDsluCounter, 1137 mSDsCounter, 0 mSdLazyCounter, 1607 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 1381 SdHoareTripleChecker+Invalid, 1609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 06:59:23,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 1381 Invalid, 1609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1607 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 06:59:23,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2024-10-11 06:59:23,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 623. [2024-10-11 06:59:23,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 622 states have (on average 1.454983922829582) internal successors, (905), 622 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:23,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 905 transitions. [2024-10-11 06:59:23,728 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 905 transitions. Word has length 83 [2024-10-11 06:59:23,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:59:23,728 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 905 transitions. [2024-10-11 06:59:23,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) 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-10-11 06:59:23,729 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 905 transitions. [2024-10-11 06:59:23,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-11 06:59:23,729 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:59:23,729 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-10-11 06:59:23,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 06:59:23,730 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:59:23,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:59:23,730 INFO L85 PathProgramCache]: Analyzing trace with hash 154730132, now seen corresponding path program 1 times [2024-10-11 06:59:23,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:59:23,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830950955] [2024-10-11 06:59:23,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:59:23,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:59:24,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:59:24,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:59:24,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:59:24,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830950955] [2024-10-11 06:59:24,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830950955] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:59:24,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:59:24,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 06:59:24,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087163696] [2024-10-11 06:59:24,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:59:24,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 06:59:24,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:59:24,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 06:59:24,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:59:24,337 INFO L87 Difference]: Start difference. First operand 623 states and 905 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 5 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-10-11 06:59:24,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:59:24,947 INFO L93 Difference]: Finished difference Result 1459 states and 2114 transitions. [2024-10-11 06:59:24,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 06:59:24,948 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 5 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-10-11 06:59:24,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:59:24,950 INFO L225 Difference]: With dead ends: 1459 [2024-10-11 06:59:24,951 INFO L226 Difference]: Without dead ends: 881 [2024-10-11 06:59:24,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:59:24,952 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 511 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 1058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 06:59:24,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 927 Invalid, 1058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1058 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 06:59:24,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2024-10-11 06:59:24,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 633. [2024-10-11 06:59:24,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 632 states have (on average 1.4509493670886076) internal successors, (917), 632 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:24,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 917 transitions. [2024-10-11 06:59:24,964 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 917 transitions. Word has length 83 [2024-10-11 06:59:24,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:59:24,965 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 917 transitions. [2024-10-11 06:59:24,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 5 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-10-11 06:59:24,965 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 917 transitions. [2024-10-11 06:59:24,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 06:59:24,965 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:59:24,965 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-10-11 06:59:24,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 06:59:24,966 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:59:24,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:59:24,966 INFO L85 PathProgramCache]: Analyzing trace with hash 432577576, now seen corresponding path program 1 times [2024-10-11 06:59:24,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:59:24,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143140345] [2024-10-11 06:59:24,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:59:24,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:59:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:59:25,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:59:25,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:59:25,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143140345] [2024-10-11 06:59:25,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143140345] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:59:25,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:59:25,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 06:59:25,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798378675] [2024-10-11 06:59:25,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:59:25,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 06:59:25,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:59:25,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 06:59:25,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:59:25,425 INFO L87 Difference]: Start difference. First operand 633 states and 917 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 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-10-11 06:59:25,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:59:25,807 INFO L93 Difference]: Finished difference Result 1251 states and 1813 transitions. [2024-10-11 06:59:25,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 06:59:25,808 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 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-10-11 06:59:25,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:59:25,809 INFO L225 Difference]: With dead ends: 1251 [2024-10-11 06:59:25,809 INFO L226 Difference]: Without dead ends: 663 [2024-10-11 06:59:25,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:59:25,810 INFO L432 NwaCegarLoop]: 340 mSDtfsCounter, 26 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 06:59:25,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 1204 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 06:59:25,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2024-10-11 06:59:25,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 641. [2024-10-11 06:59:25,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 640 states have (on average 1.4484375) internal successors, (927), 640 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:25,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 927 transitions. [2024-10-11 06:59:25,819 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 927 transitions. Word has length 84 [2024-10-11 06:59:25,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:59:25,819 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 927 transitions. [2024-10-11 06:59:25,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 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-10-11 06:59:25,820 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 927 transitions. [2024-10-11 06:59:25,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 06:59:25,820 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:59:25,820 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-10-11 06:59:25,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 06:59:25,821 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:59:25,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:59:25,821 INFO L85 PathProgramCache]: Analyzing trace with hash 42967379, now seen corresponding path program 1 times [2024-10-11 06:59:25,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:59:25,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642768840] [2024-10-11 06:59:25,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:59:25,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:59:25,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:59:26,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:59:26,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:59:26,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642768840] [2024-10-11 06:59:26,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642768840] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:59:26,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:59:26,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 06:59:26,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183142896] [2024-10-11 06:59:26,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:59:26,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 06:59:26,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:59:26,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 06:59:26,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:59:26,290 INFO L87 Difference]: Start difference. First operand 641 states and 927 transitions. Second operand has 8 states, 8 states have (on average 10.625) 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-10-11 06:59:27,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:59:27,039 INFO L93 Difference]: Finished difference Result 1479 states and 2134 transitions. [2024-10-11 06:59:27,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 06:59:27,039 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) 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-10-11 06:59:27,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:59:27,041 INFO L225 Difference]: With dead ends: 1479 [2024-10-11 06:59:27,041 INFO L226 Difference]: Without dead ends: 883 [2024-10-11 06:59:27,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-11 06:59:27,043 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 550 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 1569 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 1378 SdHoareTripleChecker+Invalid, 1570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 06:59:27,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 1378 Invalid, 1570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1569 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 06:59:27,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2024-10-11 06:59:27,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 657. [2024-10-11 06:59:27,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 656 states have (on average 1.4390243902439024) internal successors, (944), 656 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:27,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 944 transitions. [2024-10-11 06:59:27,052 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 944 transitions. Word has length 85 [2024-10-11 06:59:27,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:59:27,052 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 944 transitions. [2024-10-11 06:59:27,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) 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-10-11 06:59:27,053 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 944 transitions. [2024-10-11 06:59:27,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 06:59:27,053 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:59:27,053 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-10-11 06:59:27,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 06:59:27,053 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:59:27,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:59:27,054 INFO L85 PathProgramCache]: Analyzing trace with hash 558200, now seen corresponding path program 1 times [2024-10-11 06:59:27,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:59:27,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010404987] [2024-10-11 06:59:27,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:59:27,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:59:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:59:27,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:59:27,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:59:27,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010404987] [2024-10-11 06:59:27,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010404987] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:59:27,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:59:27,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 06:59:27,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926833013] [2024-10-11 06:59:27,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:59:27,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 06:59:27,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:59:27,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 06:59:27,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:59:27,557 INFO L87 Difference]: Start difference. First operand 657 states and 944 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 6 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)