./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-98.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-98.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a20160bba21687cb57a07e35d1c7f0f20f9fc26125afd436a393ae4b40571e89 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:09:01,782 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:09:01,851 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:09:01,855 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:09:01,855 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:09:01,880 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:09:01,880 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:09:01,880 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:09:01,881 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:09:01,882 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:09:01,882 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:09:01,882 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:09:01,883 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:09:01,883 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:09:01,883 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:09:01,885 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:09:01,885 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:09:01,885 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:09:01,885 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:09:01,886 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:09:01,886 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:09:01,889 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:09:01,889 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:09:01,889 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:09:01,889 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:09:01,890 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:09:01,890 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:09:01,890 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:09:01,890 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:09:01,890 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:09:01,890 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:09:01,891 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:09:01,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:09:01,891 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:09:01,891 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:09:01,891 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:09:01,891 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:09:01,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:09:01,892 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:09:01,892 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:09:01,892 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:09:01,892 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:09:01,893 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a20160bba21687cb57a07e35d1c7f0f20f9fc26125afd436a393ae4b40571e89 [2024-11-19 00:09:02,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:09:02,144 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:09:02,147 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:09:02,148 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:09:02,148 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:09:02,149 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-98.i [2024-11-19 00:09:03,489 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:09:03,741 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:09:03,742 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-98.i [2024-11-19 00:09:03,760 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9040a305b/9002b5be273e47589bf404300f7edbb6/FLAG915b80af6 [2024-11-19 00:09:03,774 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9040a305b/9002b5be273e47589bf404300f7edbb6 [2024-11-19 00:09:03,777 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:09:03,779 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:09:03,781 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:09:03,781 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:09:03,785 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:09:03,786 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:09:03" (1/1) ... [2024-11-19 00:09:03,787 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e3c4331 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:09:03, skipping insertion in model container [2024-11-19 00:09:03,788 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:09:03" (1/1) ... [2024-11-19 00:09:03,846 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:09:04,001 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-98.i[916,929] [2024-11-19 00:09:04,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:09:04,381 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:09:04,397 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-98.i[916,929] [2024-11-19 00:09:04,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:09:04,515 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:09:04,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:09:04 WrapperNode [2024-11-19 00:09:04,516 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:09:04,516 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:09:04,517 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:09:04,517 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:09:04,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:09:04" (1/1) ... [2024-11-19 00:09:04,550 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:09:04" (1/1) ... [2024-11-19 00:09:04,598 INFO L138 Inliner]: procedures = 26, calls = 71, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 673 [2024-11-19 00:09:04,598 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:09:04,599 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:09:04,599 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:09:04,599 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:09:04,608 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:09:04" (1/1) ... [2024-11-19 00:09:04,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:09:04" (1/1) ... [2024-11-19 00:09:04,616 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:09:04" (1/1) ... [2024-11-19 00:09:04,652 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 00:09:04,654 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:09:04" (1/1) ... [2024-11-19 00:09:04,654 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:09:04" (1/1) ... [2024-11-19 00:09:04,676 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:09:04" (1/1) ... [2024-11-19 00:09:04,681 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:09:04" (1/1) ... [2024-11-19 00:09:04,686 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:09:04" (1/1) ... [2024-11-19 00:09:04,692 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:09:04" (1/1) ... [2024-11-19 00:09:04,702 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:09:04,703 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:09:04,703 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:09:04,703 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:09:04,704 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:09:04" (1/1) ... [2024-11-19 00:09:04,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:09:04,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:09:04,734 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 00:09:04,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 00:09:04,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:09:04,774 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:09:04,774 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:09:04,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:09:04,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:09:04,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:09:04,877 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:09:04,879 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:09:05,796 INFO L? ?]: Removed 101 outVars from TransFormulas that were not future-live. [2024-11-19 00:09:05,796 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:09:05,810 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:09:05,810 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:09:05,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:09:05 BoogieIcfgContainer [2024-11-19 00:09:05,811 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:09:05,813 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:09:05,813 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:09:05,816 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:09:05,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:09:03" (1/3) ... [2024-11-19 00:09:05,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@364c7aa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:09:05, skipping insertion in model container [2024-11-19 00:09:05,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:09:04" (2/3) ... [2024-11-19 00:09:05,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@364c7aa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:09:05, skipping insertion in model container [2024-11-19 00:09:05,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:09:05" (3/3) ... [2024-11-19 00:09:05,818 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-98.i [2024-11-19 00:09:05,831 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:09:05,832 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:09:05,891 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:09:05,896 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;@29b2fb1f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:09:05,897 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:09:05,902 INFO L276 IsEmpty]: Start isEmpty. Operand has 263 states, 202 states have (on average 1.5396039603960396) internal successors, (311), 203 states have internal predecessors, (311), 58 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-19 00:09:05,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2024-11-19 00:09:05,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:09:05,923 INFO L215 NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:09:05,924 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:09:05,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:09:05,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1858165936, now seen corresponding path program 1 times [2024-11-19 00:09:05,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:09:05,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426326039] [2024-11-19 00:09:05,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:09:05,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:09:06,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:09:06,421 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 6498 trivial. 0 not checked. [2024-11-19 00:09:06,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:09:06,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426326039] [2024-11-19 00:09:06,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426326039] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:09:06,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985986982] [2024-11-19 00:09:06,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:09:06,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:09:06,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:09:06,428 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:09:06,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 00:09:06,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:09:06,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 1070 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:09:06,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:09:06,812 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 6498 trivial. 0 not checked. [2024-11-19 00:09:06,812 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:09:06,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985986982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:09:06,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:09:06,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 00:09:06,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283312880] [2024-11-19 00:09:06,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:09:06,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:09:06,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:09:06,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:09:06,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:09:06,852 INFO L87 Difference]: Start difference. First operand has 263 states, 202 states have (on average 1.5396039603960396) internal successors, (311), 203 states have internal predecessors, (311), 58 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) Second operand has 2 states, 2 states have (on average 62.0) internal successors, (124), 2 states have internal predecessors, (124), 2 states have call successors, (58), 2 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 2 states have call successors, (58) [2024-11-19 00:09:06,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:09:06,909 INFO L93 Difference]: Finished difference Result 519 states and 906 transitions. [2024-11-19 00:09:06,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:09:06,912 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 62.0) internal successors, (124), 2 states have internal predecessors, (124), 2 states have call successors, (58), 2 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 2 states have call successors, (58) Word has length 409 [2024-11-19 00:09:06,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:09:06,924 INFO L225 Difference]: With dead ends: 519 [2024-11-19 00:09:06,925 INFO L226 Difference]: Without dead ends: 259 [2024-11-19 00:09:06,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 410 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:09:06,935 INFO L432 NwaCegarLoop]: 420 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:09:06,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:09:06,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-11-19 00:09:06,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2024-11-19 00:09:06,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 199 states have (on average 1.5276381909547738) internal successors, (304), 199 states have internal predecessors, (304), 58 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-19 00:09:06,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 420 transitions. [2024-11-19 00:09:07,004 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 420 transitions. Word has length 409 [2024-11-19 00:09:07,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:09:07,004 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 420 transitions. [2024-11-19 00:09:07,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 62.0) internal successors, (124), 2 states have internal predecessors, (124), 2 states have call successors, (58), 2 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 2 states have call successors, (58) [2024-11-19 00:09:07,005 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 420 transitions. [2024-11-19 00:09:07,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2024-11-19 00:09:07,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:09:07,018 INFO L215 NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:09:07,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 00:09:07,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 00:09:07,220 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:09:07,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:09:07,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1942508748, now seen corresponding path program 1 times [2024-11-19 00:09:07,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:09:07,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107958877] [2024-11-19 00:09:07,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:09:07,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:09:07,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:09:07,580 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2024-11-19 00:09:07,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:09:07,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107958877] [2024-11-19 00:09:07,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107958877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:09:07,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:09:07,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:09:07,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102012003] [2024-11-19 00:09:07,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:09:07,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:09:07,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:09:07,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:09:07,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:09:07,587 INFO L87 Difference]: Start difference. First operand 259 states and 420 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2024-11-19 00:09:07,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:09:07,716 INFO L93 Difference]: Finished difference Result 738 states and 1197 transitions. [2024-11-19 00:09:07,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:09:07,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) Word has length 409 [2024-11-19 00:09:07,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:09:07,724 INFO L225 Difference]: With dead ends: 738 [2024-11-19 00:09:07,724 INFO L226 Difference]: Without dead ends: 482 [2024-11-19 00:09:07,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:09:07,727 INFO L432 NwaCegarLoop]: 748 mSDtfsCounter, 382 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:09:07,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 1106 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:09:07,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2024-11-19 00:09:07,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 329. [2024-11-19 00:09:07,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 269 states have (on average 1.550185873605948) internal successors, (417), 269 states have internal predecessors, (417), 58 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-19 00:09:07,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 533 transitions. [2024-11-19 00:09:07,763 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 533 transitions. Word has length 409 [2024-11-19 00:09:07,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:09:07,767 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 533 transitions. [2024-11-19 00:09:07,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2024-11-19 00:09:07,767 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 533 transitions. [2024-11-19 00:09:07,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2024-11-19 00:09:07,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:09:07,771 INFO L215 NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:09:07,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 00:09:07,771 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:09:07,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:09:07,774 INFO L85 PathProgramCache]: Analyzing trace with hash 933218294, now seen corresponding path program 1 times [2024-11-19 00:09:07,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:09:07,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325075685] [2024-11-19 00:09:07,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:09:07,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:09:07,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:09:08,171 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2024-11-19 00:09:08,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:09:08,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325075685] [2024-11-19 00:09:08,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325075685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:09:08,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:09:08,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:09:08,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309383959] [2024-11-19 00:09:08,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:09:08,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:09:08,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:09:08,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:09:08,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:09:08,178 INFO L87 Difference]: Start difference. First operand 329 states and 533 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2024-11-19 00:09:08,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:09:08,224 INFO L93 Difference]: Finished difference Result 981 states and 1593 transitions. [2024-11-19 00:09:08,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:09:08,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) Word has length 409 [2024-11-19 00:09:08,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:09:08,229 INFO L225 Difference]: With dead ends: 981 [2024-11-19 00:09:08,229 INFO L226 Difference]: Without dead ends: 655 [2024-11-19 00:09:08,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:09:08,230 INFO L432 NwaCegarLoop]: 415 mSDtfsCounter, 263 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:09:08,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 825 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:09:08,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2024-11-19 00:09:08,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 653. [2024-11-19 00:09:08,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 534 states have (on average 1.550561797752809) internal successors, (828), 534 states have internal predecessors, (828), 116 states have call successors, (116), 2 states have call predecessors, (116), 2 states have return successors, (116), 116 states have call predecessors, (116), 116 states have call successors, (116) [2024-11-19 00:09:08,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 1060 transitions. [2024-11-19 00:09:08,266 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 1060 transitions. Word has length 409 [2024-11-19 00:09:08,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:09:08,267 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 1060 transitions. [2024-11-19 00:09:08,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2024-11-19 00:09:08,268 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 1060 transitions. [2024-11-19 00:09:08,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2024-11-19 00:09:08,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:09:08,270 INFO L215 NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:09:08,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 00:09:08,270 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:09:08,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:09:08,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1152073012, now seen corresponding path program 1 times [2024-11-19 00:09:08,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:09:08,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501933985] [2024-11-19 00:09:08,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:09:08,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:09:08,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:09:08,564 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2024-11-19 00:09:08,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:09:08,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501933985] [2024-11-19 00:09:08,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501933985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:09:08,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:09:08,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:09:08,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762785466] [2024-11-19 00:09:08,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:09:08,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:09:08,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:09:08,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:09:08,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:09:08,568 INFO L87 Difference]: Start difference. First operand 653 states and 1060 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2024-11-19 00:09:08,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:09:08,709 INFO L93 Difference]: Finished difference Result 1945 states and 3158 transitions. [2024-11-19 00:09:08,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:09:08,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) Word has length 409 [2024-11-19 00:09:08,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:09:08,720 INFO L225 Difference]: With dead ends: 1945 [2024-11-19 00:09:08,720 INFO L226 Difference]: Without dead ends: 1295 [2024-11-19 00:09:08,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:09:08,724 INFO L432 NwaCegarLoop]: 803 mSDtfsCounter, 401 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:09:08,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 1195 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:09:08,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2024-11-19 00:09:08,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1277. [2024-11-19 00:09:08,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1277 states, 1040 states have (on average 1.5346153846153847) internal successors, (1596), 1040 states have internal predecessors, (1596), 232 states have call successors, (232), 4 states have call predecessors, (232), 4 states have return successors, (232), 232 states have call predecessors, (232), 232 states have call successors, (232) [2024-11-19 00:09:08,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1277 states to 1277 states and 2060 transitions. [2024-11-19 00:09:08,824 INFO L78 Accepts]: Start accepts. Automaton has 1277 states and 2060 transitions. Word has length 409 [2024-11-19 00:09:08,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:09:08,827 INFO L471 AbstractCegarLoop]: Abstraction has 1277 states and 2060 transitions. [2024-11-19 00:09:08,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2024-11-19 00:09:08,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1277 states and 2060 transitions. [2024-11-19 00:09:08,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2024-11-19 00:09:08,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:09:08,832 INFO L215 NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:09:08,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 00:09:08,833 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:09:08,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:09:08,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1158608116, now seen corresponding path program 1 times [2024-11-19 00:09:08,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:09:08,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440759897] [2024-11-19 00:09:08,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:09:08,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:09:08,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:09:09,480 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2024-11-19 00:09:09,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:09:09,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440759897] [2024-11-19 00:09:09,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440759897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:09:09,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:09:09,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:09:09,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681998101] [2024-11-19 00:09:09,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:09:09,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:09:09,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:09:09,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:09:09,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:09:09,487 INFO L87 Difference]: Start difference. First operand 1277 states and 2060 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2024-11-19 00:09:10,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:09:10,641 INFO L93 Difference]: Finished difference Result 7789 states and 12578 transitions. [2024-11-19 00:09:10,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 00:09:10,642 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) Word has length 409 [2024-11-19 00:09:10,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:09:10,671 INFO L225 Difference]: With dead ends: 7789 [2024-11-19 00:09:10,672 INFO L226 Difference]: Without dead ends: 6515 [2024-11-19 00:09:10,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:09:10,679 INFO L432 NwaCegarLoop]: 657 mSDtfsCounter, 1931 mSDsluCounter, 1609 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 586 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1931 SdHoareTripleChecker+Valid, 2266 SdHoareTripleChecker+Invalid, 1214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 586 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 00:09:10,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1931 Valid, 2266 Invalid, 1214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [586 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 00:09:10,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6515 states. [2024-11-19 00:09:10,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6515 to 2993. [2024-11-19 00:09:10,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2993 states, 2520 states have (on average 1.5476190476190477) internal successors, (3900), 2520 states have internal predecessors, (3900), 464 states have call successors, (464), 8 states have call predecessors, (464), 8 states have return successors, (464), 464 states have call predecessors, (464), 464 states have call successors, (464) [2024-11-19 00:09:10,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2993 states to 2993 states and 4828 transitions. [2024-11-19 00:09:10,911 INFO L78 Accepts]: Start accepts. Automaton has 2993 states and 4828 transitions. Word has length 409 [2024-11-19 00:09:10,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:09:10,911 INFO L471 AbstractCegarLoop]: Abstraction has 2993 states and 4828 transitions. [2024-11-19 00:09:10,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2024-11-19 00:09:10,912 INFO L276 IsEmpty]: Start isEmpty. Operand 2993 states and 4828 transitions. [2024-11-19 00:09:10,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2024-11-19 00:09:10,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:09:10,916 INFO L215 NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:09:10,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 00:09:10,916 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:09:10,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:09:10,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1136539452, now seen corresponding path program 1 times [2024-11-19 00:09:10,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:09:10,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279772352] [2024-11-19 00:09:10,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:09:10,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:09:10,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:09:11,628 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2024-11-19 00:09:11,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:09:11,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279772352] [2024-11-19 00:09:11,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279772352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:09:11,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:09:11,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:09:11,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377190781] [2024-11-19 00:09:11,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:09:11,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:09:11,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:09:11,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:09:11,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:09:11,633 INFO L87 Difference]: Start difference. First operand 2993 states and 4828 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2024-11-19 00:09:12,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:09:12,032 INFO L93 Difference]: Finished difference Result 7193 states and 11550 transitions. [2024-11-19 00:09:12,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:09:12,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) Word has length 409 [2024-11-19 00:09:12,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:09:12,049 INFO L225 Difference]: With dead ends: 7193 [2024-11-19 00:09:12,049 INFO L226 Difference]: Without dead ends: 4203 [2024-11-19 00:09:12,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:09:12,058 INFO L432 NwaCegarLoop]: 395 mSDtfsCounter, 162 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:09:12,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 718 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:09:12,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4203 states. [2024-11-19 00:09:12,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4203 to 4193. [2024-11-19 00:09:12,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4193 states, 3672 states have (on average 1.5501089324618735) internal successors, (5692), 3680 states have internal predecessors, (5692), 504 states have call successors, (504), 16 states have call predecessors, (504), 16 states have return successors, (504), 496 states have call predecessors, (504), 504 states have call successors, (504) [2024-11-19 00:09:12,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4193 states to 4193 states and 6700 transitions. [2024-11-19 00:09:12,308 INFO L78 Accepts]: Start accepts. Automaton has 4193 states and 6700 transitions. Word has length 409 [2024-11-19 00:09:12,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:09:12,310 INFO L471 AbstractCegarLoop]: Abstraction has 4193 states and 6700 transitions. [2024-11-19 00:09:12,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2024-11-19 00:09:12,310 INFO L276 IsEmpty]: Start isEmpty. Operand 4193 states and 6700 transitions. [2024-11-19 00:09:12,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2024-11-19 00:09:12,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:09:12,316 INFO L215 NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:09:12,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 00:09:12,316 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:09:12,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:09:12,317 INFO L85 PathProgramCache]: Analyzing trace with hash -686759050, now seen corresponding path program 1 times [2024-11-19 00:09:12,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:09:12,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238042529] [2024-11-19 00:09:12,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:09:12,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:09:12,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:09:12,890 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2024-11-19 00:09:12,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:09:12,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238042529] [2024-11-19 00:09:12,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238042529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:09:12,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:09:12,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:09:12,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288596555] [2024-11-19 00:09:12,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:09:12,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:09:12,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:09:12,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:09:12,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:09:12,894 INFO L87 Difference]: Start difference. First operand 4193 states and 6700 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2024-11-19 00:09:13,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:09:13,051 INFO L93 Difference]: Finished difference Result 8525 states and 13625 transitions. [2024-11-19 00:09:13,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:09:13,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) Word has length 409 [2024-11-19 00:09:13,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:09:13,072 INFO L225 Difference]: With dead ends: 8525 [2024-11-19 00:09:13,072 INFO L226 Difference]: Without dead ends: 4335 [2024-11-19 00:09:13,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:09:13,082 INFO L432 NwaCegarLoop]: 615 mSDtfsCounter, 405 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:09:13,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 819 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:09:13,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4335 states. [2024-11-19 00:09:13,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4335 to 4193. [2024-11-19 00:09:13,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4193 states, 3672 states have (on average 1.5348583877995643) internal successors, (5636), 3680 states have internal predecessors, (5636), 504 states have call successors, (504), 16 states have call predecessors, (504), 16 states have return successors, (504), 496 states have call predecessors, (504), 504 states have call successors, (504) [2024-11-19 00:09:13,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4193 states to 4193 states and 6644 transitions. [2024-11-19 00:09:13,350 INFO L78 Accepts]: Start accepts. Automaton has 4193 states and 6644 transitions. Word has length 409 [2024-11-19 00:09:13,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:09:13,351 INFO L471 AbstractCegarLoop]: Abstraction has 4193 states and 6644 transitions. [2024-11-19 00:09:13,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2024-11-19 00:09:13,351 INFO L276 IsEmpty]: Start isEmpty. Operand 4193 states and 6644 transitions. [2024-11-19 00:09:13,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2024-11-19 00:09:13,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:09:13,358 INFO L215 NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:09:13,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 00:09:13,359 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:09:13,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:09:13,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1579622136, now seen corresponding path program 1 times [2024-11-19 00:09:13,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:09:13,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032565978] [2024-11-19 00:09:13,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:09:13,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:09:13,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:09:13,947 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2024-11-19 00:09:13,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:09:13,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032565978] [2024-11-19 00:09:13,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032565978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:09:13,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:09:13,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:09:13,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138389436] [2024-11-19 00:09:13,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:09:13,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:09:13,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:09:13,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:09:13,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:09:13,951 INFO L87 Difference]: Start difference. First operand 4193 states and 6644 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2024-11-19 00:09:14,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:09:14,524 INFO L93 Difference]: Finished difference Result 12101 states and 19162 transitions. [2024-11-19 00:09:14,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:09:14,524 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) Word has length 409 [2024-11-19 00:09:14,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:09:14,563 INFO L225 Difference]: With dead ends: 12101 [2024-11-19 00:09:14,566 INFO L226 Difference]: Without dead ends: 7911 [2024-11-19 00:09:14,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:09:14,576 INFO L432 NwaCegarLoop]: 608 mSDtfsCounter, 376 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 1467 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:09:14,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 1467 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:09:14,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7911 states. [2024-11-19 00:09:14,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7911 to 4849. [2024-11-19 00:09:14,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4849 states, 4328 states have (on average 1.5295748613678373) internal successors, (6620), 4336 states have internal predecessors, (6620), 504 states have call successors, (504), 16 states have call predecessors, (504), 16 states have return successors, (504), 496 states have call predecessors, (504), 504 states have call successors, (504) [2024-11-19 00:09:14,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4849 states to 4849 states and 7628 transitions. [2024-11-19 00:09:14,934 INFO L78 Accepts]: Start accepts. Automaton has 4849 states and 7628 transitions. Word has length 409 [2024-11-19 00:09:14,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:09:14,935 INFO L471 AbstractCegarLoop]: Abstraction has 4849 states and 7628 transitions. [2024-11-19 00:09:14,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2024-11-19 00:09:14,935 INFO L276 IsEmpty]: Start isEmpty. Operand 4849 states and 7628 transitions. [2024-11-19 00:09:14,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2024-11-19 00:09:14,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:09:14,940 INFO L215 NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:09:14,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 00:09:14,940 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:09:14,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:09:14,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1871339658, now seen corresponding path program 1 times [2024-11-19 00:09:14,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:09:14,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657407502] [2024-11-19 00:09:14,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:09:14,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:09:15,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:09:16,240 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2024-11-19 00:09:16,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:09:16,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657407502] [2024-11-19 00:09:16,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657407502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:09:16,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:09:16,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-19 00:09:16,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209375203] [2024-11-19 00:09:16,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:09:16,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 00:09:16,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:09:16,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 00:09:16,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-19 00:09:16,245 INFO L87 Difference]: Start difference. First operand 4849 states and 7628 transitions. Second operand has 14 states, 14 states have (on average 8.714285714285714) internal successors, (122), 14 states have internal predecessors, (122), 3 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 3 states have call predecessors, (58), 3 states have call successors, (58) [2024-11-19 00:09:20,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:09:20,184 INFO L93 Difference]: Finished difference Result 48846 states and 76498 transitions. [2024-11-19 00:09:20,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 00:09:20,185 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.714285714285714) internal successors, (122), 14 states have internal predecessors, (122), 3 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 3 states have call predecessors, (58), 3 states have call successors, (58) Word has length 409 [2024-11-19 00:09:20,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:09:20,267 INFO L225 Difference]: With dead ends: 48846 [2024-11-19 00:09:20,268 INFO L226 Difference]: Without dead ends: 44000 [2024-11-19 00:09:20,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=259, Invalid=671, Unknown=0, NotChecked=0, Total=930 [2024-11-19 00:09:20,296 INFO L432 NwaCegarLoop]: 442 mSDtfsCounter, 8484 mSDsluCounter, 3567 mSDsCounter, 0 mSdLazyCounter, 2196 mSolverCounterSat, 443 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8484 SdHoareTripleChecker+Valid, 4009 SdHoareTripleChecker+Invalid, 2639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 443 IncrementalHoareTripleChecker+Valid, 2196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-19 00:09:20,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8484 Valid, 4009 Invalid, 2639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [443 Valid, 2196 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-19 00:09:20,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44000 states. [2024-11-19 00:09:21,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44000 to 19869. [2024-11-19 00:09:21,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19869 states, 18848 states have (on average 1.5436651103565364) internal successors, (29095), 18858 states have internal predecessors, (29095), 978 states have call successors, (978), 42 states have call predecessors, (978), 42 states have return successors, (978), 968 states have call predecessors, (978), 978 states have call successors, (978) [2024-11-19 00:09:21,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19869 states to 19869 states and 31051 transitions. [2024-11-19 00:09:21,127 INFO L78 Accepts]: Start accepts. Automaton has 19869 states and 31051 transitions. Word has length 409 [2024-11-19 00:09:21,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:09:21,128 INFO L471 AbstractCegarLoop]: Abstraction has 19869 states and 31051 transitions. [2024-11-19 00:09:21,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.714285714285714) internal successors, (122), 14 states have internal predecessors, (122), 3 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 3 states have call predecessors, (58), 3 states have call successors, (58) [2024-11-19 00:09:21,129 INFO L276 IsEmpty]: Start isEmpty. Operand 19869 states and 31051 transitions. [2024-11-19 00:09:21,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2024-11-19 00:09:21,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:09:21,144 INFO L215 NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:09:21,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 00:09:21,144 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:09:21,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:09:21,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1605979188, now seen corresponding path program 1 times [2024-11-19 00:09:21,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:09:21,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289561436] [2024-11-19 00:09:21,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:09:21,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:09:22,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:09:25,873 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2024-11-19 00:09:25,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:09:25,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289561436] [2024-11-19 00:09:25,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289561436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:09:25,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:09:25,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:09:25,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612194772] [2024-11-19 00:09:25,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:09:25,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:09:25,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:09:25,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:09:25,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:09:25,876 INFO L87 Difference]: Start difference. First operand 19869 states and 31051 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2024-11-19 00:09:27,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:09:27,262 INFO L93 Difference]: Finished difference Result 39727 states and 62086 transitions. [2024-11-19 00:09:27,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:09:27,263 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) Word has length 409 [2024-11-19 00:09:27,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:09:27,315 INFO L225 Difference]: With dead ends: 39727 [2024-11-19 00:09:27,315 INFO L226 Difference]: Without dead ends: 19869 [2024-11-19 00:09:27,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:09:27,342 INFO L432 NwaCegarLoop]: 367 mSDtfsCounter, 463 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 00:09:27,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 711 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 00:09:27,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19869 states. [2024-11-19 00:09:27,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19869 to 19869. [2024-11-19 00:09:27,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19869 states, 18848 states have (on average 1.5380411714770799) internal successors, (28989), 18858 states have internal predecessors, (28989), 978 states have call successors, (978), 42 states have call predecessors, (978), 42 states have return successors, (978), 968 states have call predecessors, (978), 978 states have call successors, (978) [2024-11-19 00:09:27,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19869 states to 19869 states and 30945 transitions. [2024-11-19 00:09:27,884 INFO L78 Accepts]: Start accepts. Automaton has 19869 states and 30945 transitions. Word has length 409 [2024-11-19 00:09:27,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:09:27,885 INFO L471 AbstractCegarLoop]: Abstraction has 19869 states and 30945 transitions. [2024-11-19 00:09:27,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2024-11-19 00:09:27,885 INFO L276 IsEmpty]: Start isEmpty. Operand 19869 states and 30945 transitions. [2024-11-19 00:09:27,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2024-11-19 00:09:27,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:09:27,899 INFO L215 NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:09:27,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 00:09:27,900 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:09:27,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:09:27,901 INFO L85 PathProgramCache]: Analyzing trace with hash -982991185, now seen corresponding path program 1 times [2024-11-19 00:09:27,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:09:27,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704943731] [2024-11-19 00:09:27,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:09:27,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:09:28,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat