./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-66.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1cf6e6673b438699da9ee704d05513145f047cb3df96501a17b1bf1cde58831e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:02:43,692 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:02:43,749 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 12:02:43,752 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:02:43,753 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:02:43,768 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:02:43,768 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:02:43,769 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:02:43,769 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:02:43,769 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:02:43,770 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:02:43,770 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:02:43,770 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:02:43,771 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:02:43,771 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:02:43,771 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:02:43,772 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:02:43,772 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:02:43,772 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 12:02:43,772 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:02:43,773 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:02:43,773 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:02:43,773 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:02:43,774 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:02:43,774 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:02:43,774 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:02:43,775 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:02:43,775 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:02:43,775 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:02:43,775 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:02:43,776 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:02:43,776 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:02:43,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:02:43,777 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:02:43,777 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:02:43,777 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:02:43,777 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 12:02:43,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 12:02:43,778 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:02:43,778 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:02:43,779 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:02:43,779 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:02:43,779 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1cf6e6673b438699da9ee704d05513145f047cb3df96501a17b1bf1cde58831e [2024-10-11 12:02:43,974 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:02:43,999 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:02:44,002 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:02:44,004 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:02:44,005 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:02:44,006 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-66.i [2024-10-11 12:02:45,532 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:02:45,709 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:02:45,710 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-66.i [2024-10-11 12:02:45,721 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a93bd2c4e/bf0126b183f740559624ef75d6cc82af/FLAG507a26980 [2024-10-11 12:02:45,738 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a93bd2c4e/bf0126b183f740559624ef75d6cc82af [2024-10-11 12:02:45,740 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:02:45,742 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:02:45,744 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:02:45,744 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:02:45,748 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:02:45,748 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:02:45" (1/1) ... [2024-10-11 12:02:45,751 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f288d4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:02:45, skipping insertion in model container [2024-10-11 12:02:45,751 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:02:45" (1/1) ... [2024-10-11 12:02:45,776 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:02:45,933 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-66.i[915,928] [2024-10-11 12:02:45,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:02:45,990 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:02:46,001 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-66.i[915,928] [2024-10-11 12:02:46,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:02:46,088 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:02:46,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:02:46 WrapperNode [2024-10-11 12:02:46,089 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:02:46,090 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:02:46,090 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:02:46,090 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:02:46,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:02:46" (1/1) ... [2024-10-11 12:02:46,113 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:02:46" (1/1) ... [2024-10-11 12:02:46,154 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 132 [2024-10-11 12:02:46,155 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:02:46,159 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:02:46,160 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:02:46,160 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:02:46,170 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:02:46" (1/1) ... [2024-10-11 12:02:46,171 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:02:46" (1/1) ... [2024-10-11 12:02:46,173 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:02:46" (1/1) ... [2024-10-11 12:02:46,194 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 12:02:46,194 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:02:46" (1/1) ... [2024-10-11 12:02:46,195 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:02:46" (1/1) ... [2024-10-11 12:02:46,201 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:02:46" (1/1) ... [2024-10-11 12:02:46,209 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:02:46" (1/1) ... [2024-10-11 12:02:46,211 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:02:46" (1/1) ... [2024-10-11 12:02:46,212 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:02:46" (1/1) ... [2024-10-11 12:02:46,214 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:02:46,215 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:02:46,215 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:02:46,215 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:02:46,216 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:02:46" (1/1) ... [2024-10-11 12:02:46,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:02:46,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:02:46,247 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:02:46,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:02:46,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:02:46,286 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:02:46,286 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:02:46,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 12:02:46,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:02:46,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:02:46,351 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:02:46,353 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:02:46,619 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-11 12:02:46,620 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:02:46,665 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:02:46,666 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:02:46,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:02:46 BoogieIcfgContainer [2024-10-11 12:02:46,666 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:02:46,668 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:02:46,668 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:02:46,671 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:02:46,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:02:45" (1/3) ... [2024-10-11 12:02:46,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bf13ce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:02:46, skipping insertion in model container [2024-10-11 12:02:46,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:02:46" (2/3) ... [2024-10-11 12:02:46,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bf13ce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:02:46, skipping insertion in model container [2024-10-11 12:02:46,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:02:46" (3/3) ... [2024-10-11 12:02:46,676 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-66.i [2024-10-11 12:02:46,689 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:02:46,689 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:02:46,751 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:02:46,760 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;@46c7f2e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:02:46,761 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:02:46,765 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 12:02:46,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 12:02:46,775 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:02:46,776 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:02:46,777 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:02:46,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:02:46,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1567801026, now seen corresponding path program 1 times [2024-10-11 12:02:46,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:02:46,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320444273] [2024-10-11 12:02:46,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:02:46,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:02:47,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:03:11,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:03:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:03:11,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:03:11,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:03:11,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:03:11,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:03:11,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:03:11,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:03:11,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:03:11,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:03:11,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:03:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:03:11,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:03:11,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:03:11,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:03:11,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:03:11,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:03:11,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:03:11,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:03:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:03:11,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:03:11,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:03:11,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:03:11,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:03:11,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:03:11,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:03:11,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:03:11,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:03:11,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:03:11,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:03:11,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:03:11,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:03:11,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 12:03:11,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:03:11,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:03:11,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:03:11,199 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 12:03:11,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:03:11,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320444273] [2024-10-11 12:03:11,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320444273] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:03:11,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:03:11,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 12:03:11,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929679102] [2024-10-11 12:03:11,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:03:11,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 12:03:11,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:03:11,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 12:03:11,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-10-11 12:03:11,229 INFO L87 Difference]: Start difference. First operand has 55 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 12:03:12,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:03:12,480 INFO L93 Difference]: Finished difference Result 206 states and 358 transitions. [2024-10-11 12:03:12,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 12:03:12,483 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 115 [2024-10-11 12:03:12,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:03:12,490 INFO L225 Difference]: With dead ends: 206 [2024-10-11 12:03:12,491 INFO L226 Difference]: Without dead ends: 152 [2024-10-11 12:03:12,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2024-10-11 12:03:12,497 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 146 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 12:03:12,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 395 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 12:03:12,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-10-11 12:03:12,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 96. [2024-10-11 12:03:12,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 72 states have internal predecessors, (102), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 12:03:12,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 146 transitions. [2024-10-11 12:03:12,557 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 146 transitions. Word has length 115 [2024-10-11 12:03:12,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:03:12,557 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 146 transitions. [2024-10-11 12:03:12,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 12:03:12,559 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 146 transitions. [2024-10-11 12:03:12,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 12:03:12,561 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:03:12,561 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:03:12,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 12:03:12,561 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:03:12,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:03:12,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1567860608, now seen corresponding path program 1 times [2024-10-11 12:03:12,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:03:12,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114483018] [2024-10-11 12:03:12,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:03:12,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:03:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:03:44,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:03:44,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:03:44,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:03:44,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:03:44,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:03:44,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:03:44,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:03:44,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:03:44,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:03:44,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:03:44,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:03:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:03:44,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:03:44,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:03:44,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:03:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:03:44,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:03:44,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:03:44,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:03:44,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:03:44,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:03:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:03:44,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:03:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:03:44,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:03:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:03:44,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:03:44,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:03:44,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:03:44,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:03:44,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:03:44,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:03:44,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 12:03:44,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:03:44,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:03:44,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:03:44,867 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 12:03:44,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:03:44,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114483018] [2024-10-11 12:03:44,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114483018] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:03:44,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:03:44,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-11 12:03:44,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111572615] [2024-10-11 12:03:44,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:03:44,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 12:03:44,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:03:44,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 12:03:44,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2024-10-11 12:03:44,877 INFO L87 Difference]: Start difference. First operand 96 states and 146 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 12:03:47,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:03:47,282 INFO L93 Difference]: Finished difference Result 150 states and 213 transitions. [2024-10-11 12:03:47,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 12:03:47,283 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 115 [2024-10-11 12:03:47,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:03:47,289 INFO L225 Difference]: With dead ends: 150 [2024-10-11 12:03:47,289 INFO L226 Difference]: Without dead ends: 148 [2024-10-11 12:03:47,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2024-10-11 12:03:47,295 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 153 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 12:03:47,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 387 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 12:03:47,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-10-11 12:03:47,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 96. [2024-10-11 12:03:47,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 72 states have internal predecessors, (102), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 12:03:47,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 146 transitions. [2024-10-11 12:03:47,339 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 146 transitions. Word has length 115 [2024-10-11 12:03:47,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:03:47,340 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 146 transitions. [2024-10-11 12:03:47,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 12:03:47,341 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 146 transitions. [2024-10-11 12:03:47,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 12:03:47,345 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:03:47,346 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:03:47,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 12:03:47,346 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:03:47,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:03:47,349 INFO L85 PathProgramCache]: Analyzing trace with hash 758454400, now seen corresponding path program 1 times [2024-10-11 12:03:47,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:03:47,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88657378] [2024-10-11 12:03:47,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:03:47,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:03:47,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:04:15,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:04:15,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:04:15,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:04:15,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:04:15,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:04:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:04:15,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:04:15,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:04:15,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:04:15,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:04:15,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:04:15,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:04:15,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:04:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:04:15,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:04:15,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:04:15,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:04:15,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:04:15,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:04:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:04:15,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:04:15,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:04:15,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:04:15,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:04:15,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:04:15,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:04:15,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:04:15,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:04:15,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:04:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:04:15,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:04:15,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:04:15,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 12:04:15,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:04:15,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:04:15,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:04:15,355 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 12:04:15,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:04:15,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88657378] [2024-10-11 12:04:15,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88657378] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:04:15,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:04:15,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 12:04:15,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272941272] [2024-10-11 12:04:15,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:04:15,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 12:04:15,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:04:15,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 12:04:15,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-10-11 12:04:15,358 INFO L87 Difference]: Start difference. First operand 96 states and 146 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 12:04:17,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:04:17,003 INFO L93 Difference]: Finished difference Result 152 states and 215 transitions. [2024-10-11 12:04:17,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 12:04:17,004 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 115 [2024-10-11 12:04:17,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:04:17,005 INFO L225 Difference]: With dead ends: 152 [2024-10-11 12:04:17,006 INFO L226 Difference]: Without dead ends: 150 [2024-10-11 12:04:17,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2024-10-11 12:04:17,007 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 163 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 12:04:17,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 404 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 12:04:17,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-11 12:04:17,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 101. [2024-10-11 12:04:17,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 77 states have internal predecessors, (109), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 12:04:17,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 153 transitions. [2024-10-11 12:04:17,022 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 153 transitions. Word has length 115 [2024-10-11 12:04:17,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:04:17,023 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 153 transitions. [2024-10-11 12:04:17,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 12:04:17,023 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 153 transitions. [2024-10-11 12:04:17,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 12:04:17,025 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:04:17,025 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:04:17,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 12:04:17,026 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:04:17,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:04:17,026 INFO L85 PathProgramCache]: Analyzing trace with hash 758513982, now seen corresponding path program 1 times [2024-10-11 12:04:17,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:04:17,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452652184] [2024-10-11 12:04:17,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:04:17,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:04:17,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat