./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-14.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/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_loopvsstraightlinecode_100-1loop_file-14.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 8b9b5c3584162f1ac164bc4062f8fb20bbcdce8e443da62cb4410d73442b6f23 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 10:14:47,537 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 10:14:47,595 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 10:14:47,600 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 10:14:47,601 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 10:14:47,623 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 10:14:47,623 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 10:14:47,624 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 10:14:47,624 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 10:14:47,626 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 10:14:47,626 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 10:14:47,626 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 10:14:47,627 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 10:14:47,629 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 10:14:47,629 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 10:14:47,630 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 10:14:47,630 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 10:14:47,630 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 10:14:47,630 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 10:14:47,630 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 10:14:47,631 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 10:14:47,631 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 10:14:47,631 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 10:14:47,631 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 10:14:47,632 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 10:14:47,632 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 10:14:47,632 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 10:14:47,632 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 10:14:47,632 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 10:14:47,632 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 10:14:47,633 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 10:14:47,633 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 10:14:47,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:14:47,633 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 10:14:47,633 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 10:14:47,634 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 10:14:47,634 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 10:14:47,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 10:14:47,634 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 10:14:47,634 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 10:14:47,634 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 10:14:47,635 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 10:14:47,636 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 -> 8b9b5c3584162f1ac164bc4062f8fb20bbcdce8e443da62cb4410d73442b6f23 [2024-11-22 10:14:47,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 10:14:47,850 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 10:14:47,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 10:14:47,854 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 10:14:47,855 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 10:14:47,856 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-14.i [2024-11-22 10:14:49,058 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 10:14:49,222 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 10:14:49,223 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-14.i [2024-11-22 10:14:49,233 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ed9bdd1f/94bf7a577128470c9872166a13275b27/FLAG4016ee2ad [2024-11-22 10:14:49,626 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ed9bdd1f/94bf7a577128470c9872166a13275b27 [2024-11-22 10:14:49,628 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 10:14:49,628 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 10:14:49,630 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 10:14:49,630 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 10:14:49,634 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 10:14:49,635 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:14:49" (1/1) ... [2024-11-22 10:14:49,636 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ea3a6c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:49, skipping insertion in model container [2024-11-22 10:14:49,637 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:14:49" (1/1) ... [2024-11-22 10:14:49,669 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 10:14:49,811 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_loopvsstraightlinecode_100-1loop_file-14.i[916,929] [2024-11-22 10:14:49,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:14:49,902 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 10:14:49,912 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_loopvsstraightlinecode_100-1loop_file-14.i[916,929] [2024-11-22 10:14:49,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:14:49,976 INFO L204 MainTranslator]: Completed translation [2024-11-22 10:14:49,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:49 WrapperNode [2024-11-22 10:14:49,979 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 10:14:49,980 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 10:14:49,980 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 10:14:49,980 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 10:14:49,986 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:49" (1/1) ... [2024-11-22 10:14:50,002 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:49" (1/1) ... [2024-11-22 10:14:50,040 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 282 [2024-11-22 10:14:50,040 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 10:14:50,041 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 10:14:50,042 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 10:14:50,043 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 10:14:50,051 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:49" (1/1) ... [2024-11-22 10:14:50,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:49" (1/1) ... [2024-11-22 10:14:50,058 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:49" (1/1) ... [2024-11-22 10:14:50,088 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-22 10:14:50,088 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:49" (1/1) ... [2024-11-22 10:14:50,088 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:49" (1/1) ... [2024-11-22 10:14:50,104 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:49" (1/1) ... [2024-11-22 10:14:50,111 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:49" (1/1) ... [2024-11-22 10:14:50,118 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:49" (1/1) ... [2024-11-22 10:14:50,120 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:49" (1/1) ... [2024-11-22 10:14:50,126 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 10:14:50,127 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 10:14:50,127 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 10:14:50,127 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 10:14:50,128 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:49" (1/1) ... [2024-11-22 10:14:50,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:14:50,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:14:50,155 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-22 10:14:50,157 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-22 10:14:50,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 10:14:50,192 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 10:14:50,193 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 10:14:50,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 10:14:50,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 10:14:50,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 10:14:50,275 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 10:14:50,277 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 10:14:50,724 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-11-22 10:14:50,724 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 10:14:50,741 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 10:14:50,741 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 10:14:50,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:14:50 BoogieIcfgContainer [2024-11-22 10:14:50,742 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 10:14:50,743 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 10:14:50,744 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 10:14:50,746 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 10:14:50,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:14:49" (1/3) ... [2024-11-22 10:14:50,748 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@213ace22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:14:50, skipping insertion in model container [2024-11-22 10:14:50,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:49" (2/3) ... [2024-11-22 10:14:50,749 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@213ace22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:14:50, skipping insertion in model container [2024-11-22 10:14:50,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:14:50" (3/3) ... [2024-11-22 10:14:50,751 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-14.i [2024-11-22 10:14:50,765 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 10:14:50,765 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 10:14:50,821 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 10:14:50,833 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;@63e156f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 10:14:50,833 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 10:14:50,837 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 82 states have (on average 1.4634146341463414) internal successors, (120), 83 states have internal predecessors, (120), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-22 10:14:50,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-22 10:14:50,848 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:14:50,849 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:14:50,850 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:14:50,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:14:50,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1500851389, now seen corresponding path program 1 times [2024-11-22 10:14:50,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:14:50,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808047883] [2024-11-22 10:14:50,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:14:50,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:14:50,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:14:51,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2024-11-22 10:14:51,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:14:51,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808047883] [2024-11-22 10:14:51,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808047883] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 10:14:51,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159732724] [2024-11-22 10:14:51,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:14:51,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:14:51,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:14:51,248 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-22 10:14:51,249 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-22 10:14:51,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:14:51,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 10:14:51,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:14:51,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2024-11-22 10:14:51,475 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 10:14:51,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159732724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:14:51,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 10:14:51,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 10:14:51,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086567690] [2024-11-22 10:14:51,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:14:51,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 10:14:51,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:14:51,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 10:14:51,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 10:14:51,514 INFO L87 Difference]: Start difference. First operand has 116 states, 82 states have (on average 1.4634146341463414) internal successors, (120), 83 states have internal predecessors, (120), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-22 10:14:51,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:14:51,574 INFO L93 Difference]: Finished difference Result 228 states and 390 transitions. [2024-11-22 10:14:51,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 10:14:51,577 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 202 [2024-11-22 10:14:51,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:14:51,583 INFO L225 Difference]: With dead ends: 228 [2024-11-22 10:14:51,584 INFO L226 Difference]: Without dead ends: 111 [2024-11-22 10:14:51,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 203 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-22 10:14:51,592 INFO L432 NwaCegarLoop]: 176 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, 176 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-22 10:14:51,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:14:51,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-22 10:14:51,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-22 10:14:51,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 78 states have internal predecessors, (110), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-22 10:14:51,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 172 transitions. [2024-11-22 10:14:51,680 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 172 transitions. Word has length 202 [2024-11-22 10:14:51,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:14:51,681 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 172 transitions. [2024-11-22 10:14:51,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-22 10:14:51,682 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 172 transitions. [2024-11-22 10:14:51,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-22 10:14:51,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:14:51,687 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:14:51,695 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-22 10:14:51,891 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-22 10:14:51,892 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:14:51,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:14:51,893 INFO L85 PathProgramCache]: Analyzing trace with hash -466289147, now seen corresponding path program 1 times [2024-11-22 10:14:51,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:14:51,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317928825] [2024-11-22 10:14:51,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:14:51,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:14:51,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:14:52,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-22 10:14:52,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:14:52,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317928825] [2024-11-22 10:14:52,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317928825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:14:52,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:14:52,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 10:14:52,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380596964] [2024-11-22 10:14:52,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:14:52,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 10:14:52,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:14:52,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 10:14:52,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 10:14:52,238 INFO L87 Difference]: Start difference. First operand 111 states and 172 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-22 10:14:52,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:14:52,289 INFO L93 Difference]: Finished difference Result 220 states and 343 transitions. [2024-11-22 10:14:52,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 10:14:52,290 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 202 [2024-11-22 10:14:52,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:14:52,295 INFO L225 Difference]: With dead ends: 220 [2024-11-22 10:14:52,295 INFO L226 Difference]: Without dead ends: 112 [2024-11-22 10:14:52,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 10:14:52,298 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 4 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 10:14:52,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 660 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:14:52,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-22 10:14:52,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-22 10:14:52,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-22 10:14:52,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 173 transitions. [2024-11-22 10:14:52,317 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 173 transitions. Word has length 202 [2024-11-22 10:14:52,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:14:52,318 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 173 transitions. [2024-11-22 10:14:52,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-22 10:14:52,319 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 173 transitions. [2024-11-22 10:14:52,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-22 10:14:52,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:14:52,322 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:14:52,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 10:14:52,322 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:14:52,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:14:52,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1867985050, now seen corresponding path program 1 times [2024-11-22 10:14:52,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:14:52,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859101821] [2024-11-22 10:14:52,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:14:52,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:14:52,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:14:54,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-22 10:14:54,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:14:54,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859101821] [2024-11-22 10:14:54,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859101821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:14:54,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:14:54,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 10:14:54,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472706805] [2024-11-22 10:14:54,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:14:54,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 10:14:54,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:14:54,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 10:14:54,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-22 10:14:54,353 INFO L87 Difference]: Start difference. First operand 112 states and 173 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-22 10:14:55,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:14:55,400 INFO L93 Difference]: Finished difference Result 430 states and 657 transitions. [2024-11-22 10:14:55,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 10:14:55,401 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 203 [2024-11-22 10:14:55,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:14:55,404 INFO L225 Difference]: With dead ends: 430 [2024-11-22 10:14:55,404 INFO L226 Difference]: Without dead ends: 321 [2024-11-22 10:14:55,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-22 10:14:55,405 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 502 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-22 10:14:55,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 747 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-22 10:14:55,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-11-22 10:14:55,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 289. [2024-11-22 10:14:55,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 221 states have (on average 1.4389140271493213) internal successors, (318), 222 states have internal predecessors, (318), 64 states have call successors, (64), 3 states have call predecessors, (64), 3 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-22 10:14:55,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 446 transitions. [2024-11-22 10:14:55,428 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 446 transitions. Word has length 203 [2024-11-22 10:14:55,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:14:55,429 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 446 transitions. [2024-11-22 10:14:55,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-22 10:14:55,429 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 446 transitions. [2024-11-22 10:14:55,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-22 10:14:55,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:14:55,431 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:14:55,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 10:14:55,431 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:14:55,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:14:55,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1746923876, now seen corresponding path program 1 times [2024-11-22 10:14:55,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:14:55,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899914234] [2024-11-22 10:14:55,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:14:55,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:14:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:14:56,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-22 10:14:56,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:14:56,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899914234] [2024-11-22 10:14:56,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899914234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:14:56,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:14:56,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 10:14:56,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194242073] [2024-11-22 10:14:56,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:14:56,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 10:14:56,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:14:56,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 10:14:56,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 10:14:56,191 INFO L87 Difference]: Start difference. First operand 289 states and 446 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-22 10:14:56,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:14:56,405 INFO L93 Difference]: Finished difference Result 588 states and 902 transitions. [2024-11-22 10:14:56,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 10:14:56,406 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 203 [2024-11-22 10:14:56,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:14:56,411 INFO L225 Difference]: With dead ends: 588 [2024-11-22 10:14:56,411 INFO L226 Difference]: Without dead ends: 302 [2024-11-22 10:14:56,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-22 10:14:56,414 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 138 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 10:14:56,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 429 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 10:14:56,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-22 10:14:56,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 230. [2024-11-22 10:14:56,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 161 states have (on average 1.3788819875776397) internal successors, (222), 162 states have internal predecessors, (222), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-22 10:14:56,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 350 transitions. [2024-11-22 10:14:56,436 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 350 transitions. Word has length 203 [2024-11-22 10:14:56,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:14:56,437 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 350 transitions. [2024-11-22 10:14:56,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-22 10:14:56,437 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 350 transitions. [2024-11-22 10:14:56,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-22 10:14:56,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:14:56,439 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:14:56,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 10:14:56,441 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:14:56,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:14:56,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1714091371, now seen corresponding path program 1 times [2024-11-22 10:14:56,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:14:56,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752300974] [2024-11-22 10:14:56,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:14:56,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:14:56,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:15:50,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-22 10:15:50,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:15:50,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752300974] [2024-11-22 10:15:50,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752300974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:15:50,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:15:50,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-22 10:15:50,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838424634] [2024-11-22 10:15:50,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:15:50,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-22 10:15:50,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:15:50,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-22 10:15:50,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-22 10:15:50,219 INFO L87 Difference]: Start difference. First operand 230 states and 350 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-22 10:16:01,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:16:01,909 INFO L93 Difference]: Finished difference Result 956 states and 1423 transitions. [2024-11-22 10:16:01,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-22 10:16:01,911 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 205 [2024-11-22 10:16:01,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:16:01,914 INFO L225 Difference]: With dead ends: 956 [2024-11-22 10:16:01,914 INFO L226 Difference]: Without dead ends: 733 [2024-11-22 10:16:01,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=220, Invalid=430, Unknown=0, NotChecked=0, Total=650 [2024-11-22 10:16:01,916 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 718 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 1367 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 1248 SdHoareTripleChecker+Invalid, 1372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-11-22 10:16:01,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 1248 Invalid, 1372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1367 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2024-11-22 10:16:01,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2024-11-22 10:16:01,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 433. [2024-11-22 10:16:01,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 334 states have (on average 1.4131736526946108) internal successors, (472), 337 states have internal predecessors, (472), 90 states have call successors, (90), 8 states have call predecessors, (90), 8 states have return successors, (90), 87 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-22 10:16:01,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 652 transitions. [2024-11-22 10:16:01,954 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 652 transitions. Word has length 205 [2024-11-22 10:16:01,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:16:01,955 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 652 transitions. [2024-11-22 10:16:01,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-22 10:16:01,955 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 652 transitions. [2024-11-22 10:16:01,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-22 10:16:01,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:16:01,957 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:16:01,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 10:16:01,957 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:16:01,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:16:01,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1013026793, now seen corresponding path program 1 times [2024-11-22 10:16:01,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:16:01,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538655702] [2024-11-22 10:16:01,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:16:01,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:16:02,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat