./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-81.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_fillercode_fillercodesize_ps-cn-50_file-81.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 47dd68ea39604b487f233f68e029f640f8a21785e687328515d4ba55c65777c4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 20:05:52,564 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 20:05:52,623 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 20:05:52,628 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 20:05:52,628 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 20:05:52,666 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 20:05:52,667 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 20:05:52,668 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 20:05:52,669 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 20:05:52,670 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 20:05:52,670 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 20:05:52,671 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 20:05:52,672 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 20:05:52,672 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 20:05:52,674 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 20:05:52,674 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 20:05:52,675 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 20:05:52,675 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 20:05:52,675 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 20:05:52,676 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 20:05:52,676 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 20:05:52,680 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 20:05:52,680 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 20:05:52,680 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 20:05:52,681 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 20:05:52,681 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 20:05:52,681 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 20:05:52,681 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 20:05:52,682 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 20:05:52,682 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 20:05:52,682 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 20:05:52,682 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 20:05:52,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 20:05:52,683 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 20:05:52,683 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 20:05:52,683 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 20:05:52,684 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 20:05:52,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 20:05:52,684 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 20:05:52,684 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 20:05:52,685 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 20:05:52,686 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 20:05:52,686 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 -> 47dd68ea39604b487f233f68e029f640f8a21785e687328515d4ba55c65777c4 [2024-11-18 20:05:52,941 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 20:05:52,968 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 20:05:52,972 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 20:05:52,974 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 20:05:52,974 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 20:05:52,975 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-81.i [2024-11-18 20:05:54,504 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 20:05:54,746 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 20:05:54,746 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-81.i [2024-11-18 20:05:54,759 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35cad473e/2aac831d307f4fc4918915c906dc8ade/FLAG2f167e02b [2024-11-18 20:05:54,774 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35cad473e/2aac831d307f4fc4918915c906dc8ade [2024-11-18 20:05:54,777 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 20:05:54,778 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 20:05:54,780 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 20:05:54,780 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 20:05:54,786 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 20:05:54,787 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:05:54" (1/1) ... [2024-11-18 20:05:54,788 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3725ad18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:05:54, skipping insertion in model container [2024-11-18 20:05:54,790 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:05:54" (1/1) ... [2024-11-18 20:05:54,819 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 20:05:55,006 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_fillercode_fillercodesize_ps-cn-50_file-81.i[915,928] [2024-11-18 20:05:55,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 20:05:55,116 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 20:05:55,128 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_fillercode_fillercodesize_ps-cn-50_file-81.i[915,928] [2024-11-18 20:05:55,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 20:05:55,209 INFO L204 MainTranslator]: Completed translation [2024-11-18 20:05:55,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:05:55 WrapperNode [2024-11-18 20:05:55,210 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 20:05:55,211 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 20:05:55,211 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 20:05:55,211 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 20:05:55,234 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:05:55" (1/1) ... [2024-11-18 20:05:55,255 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:05:55" (1/1) ... [2024-11-18 20:05:55,299 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 308 [2024-11-18 20:05:55,300 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 20:05:55,300 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 20:05:55,301 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 20:05:55,301 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 20:05:55,313 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:05:55" (1/1) ... [2024-11-18 20:05:55,317 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:05:55" (1/1) ... [2024-11-18 20:05:55,325 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:05:55" (1/1) ... [2024-11-18 20:05:55,346 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-18 20:05:55,346 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:05:55" (1/1) ... [2024-11-18 20:05:55,346 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:05:55" (1/1) ... [2024-11-18 20:05:55,361 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:05:55" (1/1) ... [2024-11-18 20:05:55,365 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:05:55" (1/1) ... [2024-11-18 20:05:55,370 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:05:55" (1/1) ... [2024-11-18 20:05:55,375 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:05:55" (1/1) ... [2024-11-18 20:05:55,392 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 20:05:55,393 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 20:05:55,394 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 20:05:55,394 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 20:05:55,394 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:05:55" (1/1) ... [2024-11-18 20:05:55,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 20:05:55,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 20:05:55,430 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-18 20:05:55,437 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-18 20:05:55,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 20:05:55,480 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 20:05:55,481 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 20:05:55,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 20:05:55,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 20:05:55,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 20:05:55,600 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 20:05:55,605 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 20:05:56,139 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-18 20:05:56,140 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 20:05:56,158 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 20:05:56,159 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 20:05:56,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:05:56 BoogieIcfgContainer [2024-11-18 20:05:56,159 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 20:05:56,163 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 20:05:56,164 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 20:05:56,167 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 20:05:56,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:05:54" (1/3) ... [2024-11-18 20:05:56,168 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5efb2d7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:05:56, skipping insertion in model container [2024-11-18 20:05:56,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:05:55" (2/3) ... [2024-11-18 20:05:56,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5efb2d7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:05:56, skipping insertion in model container [2024-11-18 20:05:56,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:05:56" (3/3) ... [2024-11-18 20:05:56,170 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-81.i [2024-11-18 20:05:56,186 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 20:05:56,187 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 20:05:56,263 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 20:05:56,270 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;@6511b868, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 20:05:56,271 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 20:05:56,276 INFO L276 IsEmpty]: Start isEmpty. Operand has 134 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 82 states have internal predecessors, (115), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-18 20:05:56,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2024-11-18 20:05:56,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:05:56,301 INFO L215 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:05:56,302 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:05:56,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:05:56,309 INFO L85 PathProgramCache]: Analyzing trace with hash 827940478, now seen corresponding path program 1 times [2024-11-18 20:05:56,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:05:56,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556457297] [2024-11-18 20:05:56,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:05:56,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:05:56,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:05:56,802 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2024-11-18 20:05:56,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:05:56,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556457297] [2024-11-18 20:05:56,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556457297] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 20:05:56,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775411449] [2024-11-18 20:05:56,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:05:56,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 20:05:56,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 20:05:56,809 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-18 20:05:56,810 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-18 20:05:57,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:05:57,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 20:05:57,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 20:05:57,139 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2024-11-18 20:05:57,140 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 20:05:57,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775411449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:05:57,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 20:05:57,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-18 20:05:57,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431598831] [2024-11-18 20:05:57,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:05:57,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 20:05:57,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:05:57,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 20:05:57,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 20:05:57,171 INFO L87 Difference]: Start difference. First operand has 134 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 82 states have internal predecessors, (115), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2024-11-18 20:05:57,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:05:57,214 INFO L93 Difference]: Finished difference Result 261 states and 474 transitions. [2024-11-18 20:05:57,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 20:05:57,217 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) Word has length 306 [2024-11-18 20:05:57,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:05:57,225 INFO L225 Difference]: With dead ends: 261 [2024-11-18 20:05:57,225 INFO L226 Difference]: Without dead ends: 130 [2024-11-18 20:05:57,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 307 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-18 20:05:57,231 INFO L432 NwaCegarLoop]: 208 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, 208 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-18 20:05:57,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 20:05:57,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-18 20:05:57,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-11-18 20:05:57,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 78 states have internal predecessors, (108), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-18 20:05:57,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 208 transitions. [2024-11-18 20:05:57,286 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 208 transitions. Word has length 306 [2024-11-18 20:05:57,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:05:57,286 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 208 transitions. [2024-11-18 20:05:57,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2024-11-18 20:05:57,287 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 208 transitions. [2024-11-18 20:05:57,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2024-11-18 20:05:57,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:05:57,293 INFO L215 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:05:57,313 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-18 20:05:57,497 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-18 20:05:57,498 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:05:57,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:05:57,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1693238838, now seen corresponding path program 1 times [2024-11-18 20:05:57,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:05:57,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241509054] [2024-11-18 20:05:57,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:05:57,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:05:57,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:05:58,406 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2024-11-18 20:05:58,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:05:58,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241509054] [2024-11-18 20:05:58,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241509054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:05:58,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:05:58,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 20:05:58,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333034640] [2024-11-18 20:05:58,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:05:58,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 20:05:58,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:05:58,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 20:05:58,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 20:05:58,417 INFO L87 Difference]: Start difference. First operand 130 states and 208 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2024-11-18 20:05:58,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:05:58,752 INFO L93 Difference]: Finished difference Result 385 states and 620 transitions. [2024-11-18 20:05:58,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 20:05:58,753 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 306 [2024-11-18 20:05:58,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:05:58,758 INFO L225 Difference]: With dead ends: 385 [2024-11-18 20:05:58,759 INFO L226 Difference]: Without dead ends: 258 [2024-11-18 20:05:58,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 20:05:58,761 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 122 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 20:05:58,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 613 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 20:05:58,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-18 20:05:58,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2024-11-18 20:05:58,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 153 states have (on average 1.392156862745098) internal successors, (213), 153 states have internal predecessors, (213), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-18 20:05:58,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 413 transitions. [2024-11-18 20:05:58,841 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 413 transitions. Word has length 306 [2024-11-18 20:05:58,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:05:58,842 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 413 transitions. [2024-11-18 20:05:58,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2024-11-18 20:05:58,843 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 413 transitions. [2024-11-18 20:05:58,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2024-11-18 20:05:58,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:05:58,855 INFO L215 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:05:58,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 20:05:58,855 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:05:58,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:05:58,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1402096609, now seen corresponding path program 1 times [2024-11-18 20:05:58,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:05:58,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367843332] [2024-11-18 20:05:58,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:05:58,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:05:59,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:06:00,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2024-11-18 20:06:00,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:06:00,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367843332] [2024-11-18 20:06:00,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367843332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:06:00,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:06:00,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 20:06:00,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355104006] [2024-11-18 20:06:00,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:06:00,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 20:06:00,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:06:00,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 20:06:00,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 20:06:00,058 INFO L87 Difference]: Start difference. First operand 256 states and 413 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2024-11-18 20:06:00,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:06:00,957 INFO L93 Difference]: Finished difference Result 959 states and 1522 transitions. [2024-11-18 20:06:00,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 20:06:00,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2024-11-18 20:06:00,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:06:00,968 INFO L225 Difference]: With dead ends: 959 [2024-11-18 20:06:00,968 INFO L226 Difference]: Without dead ends: 706 [2024-11-18 20:06:00,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-18 20:06:00,971 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 434 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-18 20:06:00,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 671 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-18 20:06:00,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2024-11-18 20:06:01,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 270. [2024-11-18 20:06:01,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 165 states have (on average 1.387878787878788) internal successors, (229), 165 states have internal predecessors, (229), 100 states have call successors, (100), 4 states have call predecessors, (100), 4 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-18 20:06:01,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 429 transitions. [2024-11-18 20:06:01,038 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 429 transitions. Word has length 307 [2024-11-18 20:06:01,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:06:01,039 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 429 transitions. [2024-11-18 20:06:01,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2024-11-18 20:06:01,040 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 429 transitions. [2024-11-18 20:06:01,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2024-11-18 20:06:01,044 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:06:01,044 INFO L215 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:06:01,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 20:06:01,044 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:06:01,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:06:01,045 INFO L85 PathProgramCache]: Analyzing trace with hash 364163055, now seen corresponding path program 1 times [2024-11-18 20:06:01,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:06:01,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579711368] [2024-11-18 20:06:01,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:06:01,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:06:01,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:06:01,486 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2024-11-18 20:06:01,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:06:01,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579711368] [2024-11-18 20:06:01,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579711368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:06:01,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:06:01,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 20:06:01,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798431638] [2024-11-18 20:06:01,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:06:01,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 20:06:01,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:06:01,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 20:06:01,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 20:06:01,490 INFO L87 Difference]: Start difference. First operand 270 states and 429 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2024-11-18 20:06:01,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:06:01,611 INFO L93 Difference]: Finished difference Result 605 states and 952 transitions. [2024-11-18 20:06:01,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 20:06:01,612 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2024-11-18 20:06:01,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:06:01,615 INFO L225 Difference]: With dead ends: 605 [2024-11-18 20:06:01,615 INFO L226 Difference]: Without dead ends: 338 [2024-11-18 20:06:01,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 20:06:01,617 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 42 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 20:06:01,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 614 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 20:06:01,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-11-18 20:06:01,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 334. [2024-11-18 20:06:01,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 219 states have (on average 1.3835616438356164) internal successors, (303), 221 states have internal predecessors, (303), 108 states have call successors, (108), 6 states have call predecessors, (108), 6 states have return successors, (108), 106 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-18 20:06:01,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 519 transitions. [2024-11-18 20:06:01,698 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 519 transitions. Word has length 307 [2024-11-18 20:06:01,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:06:01,699 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 519 transitions. [2024-11-18 20:06:01,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2024-11-18 20:06:01,700 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 519 transitions. [2024-11-18 20:06:01,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2024-11-18 20:06:01,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:06:01,704 INFO L215 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:06:01,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 20:06:01,705 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:06:01,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:06:01,705 INFO L85 PathProgramCache]: Analyzing trace with hash 757190065, now seen corresponding path program 1 times [2024-11-18 20:06:01,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:06:01,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235231855] [2024-11-18 20:06:01,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:06:01,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:06:01,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:06:16,018 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2024-11-18 20:06:16,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:06:16,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235231855] [2024-11-18 20:06:16,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235231855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:06:16,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:06:16,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-18 20:06:16,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744239887] [2024-11-18 20:06:16,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:06:16,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-18 20:06:16,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:06:16,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-18 20:06:16,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-18 20:06:16,023 INFO L87 Difference]: Start difference. First operand 334 states and 519 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2024-11-18 20:06:16,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:06:16,572 INFO L93 Difference]: Finished difference Result 780 states and 1191 transitions. [2024-11-18 20:06:16,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 20:06:16,573 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2024-11-18 20:06:16,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:06:16,581 INFO L225 Difference]: With dead ends: 780 [2024-11-18 20:06:16,581 INFO L226 Difference]: Without dead ends: 449 [2024-11-18 20:06:16,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2024-11-18 20:06:16,584 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 214 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 20:06:16,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 735 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 20:06:16,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-11-18 20:06:16,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 354. [2024-11-18 20:06:16,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 239 states have (on average 1.3849372384937237) internal successors, (331), 241 states have internal predecessors, (331), 108 states have call successors, (108), 6 states have call predecessors, (108), 6 states have return successors, (108), 106 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-18 20:06:16,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 547 transitions. [2024-11-18 20:06:16,641 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 547 transitions. Word has length 307 [2024-11-18 20:06:16,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:06:16,642 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 547 transitions. [2024-11-18 20:06:16,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2024-11-18 20:06:16,643 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 547 transitions. [2024-11-18 20:06:16,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2024-11-18 20:06:16,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:06:16,649 INFO L215 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:06:16,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 20:06:16,651 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:06:16,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:06:16,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1458254643, now seen corresponding path program 1 times [2024-11-18 20:06:16,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:06:16,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496610906] [2024-11-18 20:06:16,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:06:16,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:06:16,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:06:25,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2024-11-18 20:06:25,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:06:25,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496610906] [2024-11-18 20:06:25,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496610906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:06:25,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:06:25,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-18 20:06:25,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726989740] [2024-11-18 20:06:25,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:06:25,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-18 20:06:25,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:06:25,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-18 20:06:25,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-18 20:06:25,816 INFO L87 Difference]: Start difference. First operand 354 states and 547 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2024-11-18 20:06:28,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:06:28,525 INFO L93 Difference]: Finished difference Result 1087 states and 1661 transitions. [2024-11-18 20:06:28,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-18 20:06:28,526 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2024-11-18 20:06:28,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:06:28,535 INFO L225 Difference]: With dead ends: 1087 [2024-11-18 20:06:28,536 INFO L226 Difference]: Without dead ends: 736 [2024-11-18 20:06:28,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2024-11-18 20:06:28,540 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 503 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-18 20:06:28,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 1031 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-18 20:06:28,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2024-11-18 20:06:28,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 494. [2024-11-18 20:06:28,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 327 states have (on average 1.4097859327217126) internal successors, (461), 329 states have internal predecessors, (461), 158 states have call successors, (158), 8 states have call predecessors, (158), 8 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2024-11-18 20:06:28,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 777 transitions. [2024-11-18 20:06:28,609 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 777 transitions. Word has length 307 [2024-11-18 20:06:28,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:06:28,610 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 777 transitions. [2024-11-18 20:06:28,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2024-11-18 20:06:28,611 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 777 transitions. [2024-11-18 20:06:28,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2024-11-18 20:06:28,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:06:28,615 INFO L215 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:06:28,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 20:06:28,616 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:06:28,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:06:28,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1015355503, now seen corresponding path program 1 times [2024-11-18 20:06:28,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:06:28,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993293123] [2024-11-18 20:06:28,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:06:28,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:06:28,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:06:29,907 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2024-11-18 20:06:29,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:06:29,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993293123] [2024-11-18 20:06:29,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993293123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:06:29,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:06:29,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-18 20:06:29,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815253025] [2024-11-18 20:06:29,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:06:29,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-18 20:06:29,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:06:29,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-18 20:06:29,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-18 20:06:29,910 INFO L87 Difference]: Start difference. First operand 494 states and 777 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2024-11-18 20:06:30,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:06:30,930 INFO L93 Difference]: Finished difference Result 1033 states and 1595 transitions. [2024-11-18 20:06:30,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-18 20:06:30,931 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) Word has length 307 [2024-11-18 20:06:30,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:06:30,938 INFO L225 Difference]: With dead ends: 1033 [2024-11-18 20:06:30,939 INFO L226 Difference]: Without dead ends: 682 [2024-11-18 20:06:30,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2024-11-18 20:06:30,941 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 345 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-18 20:06:30,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 1105 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-18 20:06:30,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2024-11-18 20:06:31,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 506. [2024-11-18 20:06:31,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 339 states have (on average 1.40117994100295) internal successors, (475), 341 states have internal predecessors, (475), 158 states have call successors, (158), 8 states have call predecessors, (158), 8 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2024-11-18 20:06:31,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 791 transitions. [2024-11-18 20:06:31,011 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 791 transitions. Word has length 307 [2024-11-18 20:06:31,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:06:31,012 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 791 transitions. [2024-11-18 20:06:31,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2024-11-18 20:06:31,012 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 791 transitions. [2024-11-18 20:06:31,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2024-11-18 20:06:31,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:06:31,015 INFO L215 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:06:31,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 20:06:31,015 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:06:31,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:06:31,016 INFO L85 PathProgramCache]: Analyzing trace with hash 447137393, now seen corresponding path program 1 times [2024-11-18 20:06:31,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:06:31,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75480126] [2024-11-18 20:06:31,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:06:31,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:06:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:06:38,215 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2024-11-18 20:06:38,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:06:38,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75480126] [2024-11-18 20:06:38,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75480126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:06:38,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:06:38,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-18 20:06:38,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048540493] [2024-11-18 20:06:38,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:06:38,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-18 20:06:38,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:06:38,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-18 20:06:38,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-18 20:06:38,219 INFO L87 Difference]: Start difference. First operand 506 states and 791 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2024-11-18 20:06:38,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:06:38,997 INFO L93 Difference]: Finished difference Result 931 states and 1435 transitions. [2024-11-18 20:06:38,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 20:06:38,999 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2024-11-18 20:06:38,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:06:39,007 INFO L225 Difference]: With dead ends: 931 [2024-11-18 20:06:39,010 INFO L226 Difference]: Without dead ends: 580 [2024-11-18 20:06:39,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2024-11-18 20:06:39,013 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 155 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 20:06:39,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 740 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 20:06:39,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2024-11-18 20:06:39,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 500. [2024-11-18 20:06:39,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 333 states have (on average 1.4024024024024024) internal successors, (467), 335 states have internal predecessors, (467), 158 states have call successors, (158), 8 states have call predecessors, (158), 8 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2024-11-18 20:06:39,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 783 transitions. [2024-11-18 20:06:39,083 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 783 transitions. Word has length 307 [2024-11-18 20:06:39,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:06:39,084 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 783 transitions. [2024-11-18 20:06:39,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2024-11-18 20:06:39,084 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 783 transitions. [2024-11-18 20:06:39,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2024-11-18 20:06:39,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:06:39,086 INFO L215 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:06:39,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-18 20:06:39,087 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:06:39,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:06:39,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1581899888, now seen corresponding path program 1 times [2024-11-18 20:06:39,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:06:39,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235427658] [2024-11-18 20:06:39,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:06:39,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:06:39,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:06:46,905 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2024-11-18 20:06:46,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:06:46,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235427658] [2024-11-18 20:06:46,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235427658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:06:46,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:06:46,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-18 20:06:46,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176916607] [2024-11-18 20:06:46,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:06:46,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-18 20:06:46,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:06:46,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-18 20:06:46,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-18 20:06:46,907 INFO L87 Difference]: Start difference. First operand 500 states and 783 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2024-11-18 20:06:48,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:06:48,821 INFO L93 Difference]: Finished difference Result 1177 states and 1794 transitions. [2024-11-18 20:06:48,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-18 20:06:48,823 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) Word has length 308 [2024-11-18 20:06:48,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:06:48,829 INFO L225 Difference]: With dead ends: 1177 [2024-11-18 20:06:48,829 INFO L226 Difference]: Without dead ends: 826 [2024-11-18 20:06:48,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2024-11-18 20:06:48,832 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 572 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 1271 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-18 20:06:48,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 1271 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-18 20:06:48,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2024-11-18 20:06:48,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 524. [2024-11-18 20:06:48,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 357 states have (on average 1.403361344537815) internal successors, (501), 359 states have internal predecessors, (501), 158 states have call successors, (158), 8 states have call predecessors, (158), 8 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2024-11-18 20:06:48,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 817 transitions. [2024-11-18 20:06:48,905 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 817 transitions. Word has length 308 [2024-11-18 20:06:48,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:06:48,905 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 817 transitions. [2024-11-18 20:06:48,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2024-11-18 20:06:48,906 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 817 transitions. [2024-11-18 20:06:48,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2024-11-18 20:06:48,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:06:48,907 INFO L215 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:06:48,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-18 20:06:48,907 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:06:48,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:06:48,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1188872878, now seen corresponding path program 1 times [2024-11-18 20:06:48,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:06:48,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076157999] [2024-11-18 20:06:48,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:06:48,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:06:49,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:06:56,934 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2024-11-18 20:06:56,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:06:56,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076157999] [2024-11-18 20:06:56,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076157999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:06:56,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:06:56,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-18 20:06:56,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395715133] [2024-11-18 20:06:56,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:06:56,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-18 20:06:56,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:06:56,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-18 20:06:56,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-18 20:06:56,937 INFO L87 Difference]: Start difference. First operand 524 states and 817 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2024-11-18 20:06:59,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:06:59,402 INFO L93 Difference]: Finished difference Result 1219 states and 1842 transitions. [2024-11-18 20:06:59,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-18 20:06:59,403 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 308 [2024-11-18 20:06:59,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:06:59,409 INFO L225 Difference]: With dead ends: 1219 [2024-11-18 20:06:59,409 INFO L226 Difference]: Without dead ends: 868 [2024-11-18 20:06:59,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2024-11-18 20:06:59,411 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 252 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-18 20:06:59,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 1153 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-18 20:06:59,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2024-11-18 20:06:59,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 534. [2024-11-18 20:06:59,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 367 states have (on average 1.4141689373297002) internal successors, (519), 369 states have internal predecessors, (519), 158 states have call successors, (158), 8 states have call predecessors, (158), 8 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2024-11-18 20:06:59,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 835 transitions. [2024-11-18 20:06:59,480 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 835 transitions. Word has length 308 [2024-11-18 20:06:59,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:06:59,482 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 835 transitions. [2024-11-18 20:06:59,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2024-11-18 20:06:59,482 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 835 transitions. [2024-11-18 20:06:59,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2024-11-18 20:06:59,486 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:06:59,486 INFO L215 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:06:59,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-18 20:06:59,487 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:06:59,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:06:59,487 INFO L85 PathProgramCache]: Analyzing trace with hash -880835310, now seen corresponding path program 1 times [2024-11-18 20:06:59,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:06:59,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331371110] [2024-11-18 20:06:59,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:06:59,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:06:59,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:07:05,607 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2024-11-18 20:07:05,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:07:05,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331371110] [2024-11-18 20:07:05,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331371110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:07:05,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:07:05,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-18 20:07:05,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10525111] [2024-11-18 20:07:05,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:07:05,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-18 20:07:05,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:07:05,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-18 20:07:05,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-18 20:07:05,610 INFO L87 Difference]: Start difference. First operand 534 states and 835 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50)