./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-31.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-31.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 2d1cc662cab7327d681c15013ff47a4eba12f3f9b1398ac7cfb69b694262bd25 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:56:25,957 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:56:26,047 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 07:56:26,055 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:56:26,055 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:56:26,090 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:56:26,092 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:56:26,093 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:56:26,093 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:56:26,095 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:56:26,095 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:56:26,096 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:56:26,096 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:56:26,098 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:56:26,098 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:56:26,099 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:56:26,099 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:56:26,099 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:56:26,102 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 07:56:26,102 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:56:26,103 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:56:26,103 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:56:26,103 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:56:26,104 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:56:26,104 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:56:26,104 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:56:26,104 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:56:26,105 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:56:26,105 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:56:26,105 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:56:26,106 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:56:26,106 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:56:26,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:56:26,106 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:56:26,107 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:56:26,107 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:56:26,107 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 07:56:26,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 07:56:26,108 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:56:26,108 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:56:26,108 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:56:26,109 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:56:26,109 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 -> 2d1cc662cab7327d681c15013ff47a4eba12f3f9b1398ac7cfb69b694262bd25 [2024-11-10 07:56:26,370 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:56:26,397 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:56:26,402 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:56:26,403 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:56:26,403 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:56:26,404 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-31.i [2024-11-10 07:56:27,915 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:56:28,150 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:56:28,151 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-31.i [2024-11-10 07:56:28,166 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0cf7040c/c69246768acb489fbfa0a8e092cf1c83/FLAGcc5feb97c [2024-11-10 07:56:28,183 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0cf7040c/c69246768acb489fbfa0a8e092cf1c83 [2024-11-10 07:56:28,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:56:28,190 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:56:28,192 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:56:28,193 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:56:28,199 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:56:28,200 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:56:28" (1/1) ... [2024-11-10 07:56:28,201 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a423b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:56:28, skipping insertion in model container [2024-11-10 07:56:28,201 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:56:28" (1/1) ... [2024-11-10 07:56:28,238 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:56:28,434 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_50-while_file-31.i[915,928] [2024-11-10 07:56:28,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:56:28,529 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:56:28,543 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_50-while_file-31.i[915,928] [2024-11-10 07:56:28,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:56:28,595 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:56:28,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:56:28 WrapperNode [2024-11-10 07:56:28,596 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:56:28,597 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:56:28,597 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:56:28,598 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:56:28,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:56:28" (1/1) ... [2024-11-10 07:56:28,614 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:56:28" (1/1) ... [2024-11-10 07:56:28,654 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 144 [2024-11-10 07:56:28,654 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:56:28,655 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:56:28,655 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:56:28,656 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:56:28,667 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:56:28" (1/1) ... [2024-11-10 07:56:28,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:56:28" (1/1) ... [2024-11-10 07:56:28,671 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:56:28" (1/1) ... [2024-11-10 07:56:28,698 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-10 07:56:28,699 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:56:28" (1/1) ... [2024-11-10 07:56:28,699 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:56:28" (1/1) ... [2024-11-10 07:56:28,710 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:56:28" (1/1) ... [2024-11-10 07:56:28,711 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:56:28" (1/1) ... [2024-11-10 07:56:28,713 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:56:28" (1/1) ... [2024-11-10 07:56:28,715 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:56:28" (1/1) ... [2024-11-10 07:56:28,719 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:56:28,720 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:56:28,720 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:56:28,720 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:56:28,721 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:56:28" (1/1) ... [2024-11-10 07:56:28,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:56:28,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:56:28,764 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-10 07:56:28,771 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-10 07:56:28,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:56:28,819 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:56:28,819 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:56:28,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 07:56:28,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:56:28,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:56:28,913 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:56:28,916 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:56:29,342 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-10 07:56:29,343 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:56:29,357 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:56:29,357 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:56:29,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:56:29 BoogieIcfgContainer [2024-11-10 07:56:29,358 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:56:29,365 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:56:29,365 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:56:29,369 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:56:29,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:56:28" (1/3) ... [2024-11-10 07:56:29,370 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1df8e32e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:56:29, skipping insertion in model container [2024-11-10 07:56:29,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:56:28" (2/3) ... [2024-11-10 07:56:29,372 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1df8e32e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:56:29, skipping insertion in model container [2024-11-10 07:56:29,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:56:29" (3/3) ... [2024-11-10 07:56:29,374 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-31.i [2024-11-10 07:56:29,392 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:56:29,392 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:56:29,450 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:56:29,456 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;@57f74022, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:56:29,457 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:56:29,462 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 43 states have internal predecessors, (56), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 07:56:29,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-10 07:56:29,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:56:29,479 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:56:29,480 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:56:29,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:56:29,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1718507355, now seen corresponding path program 1 times [2024-11-10 07:56:29,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:56:29,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292596290] [2024-11-10 07:56:29,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:56:29,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:56:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:56:29,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:56:29,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:56:29,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:56:29,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:56:29,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:56:29,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:56:29,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:56:29,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:56:29,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:56:29,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:56:29,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:56:29,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:56:29,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:56:29,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:56:29,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:56:29,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:56:29,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:56:29,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:56:29,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:56:29,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:56:29,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:56:29,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:56:29,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:56:29,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:56:29,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:56:29,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:56:29,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:56:29,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:56:29,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 07:56:29,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:56:29,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:56:29,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:56:29,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 07:56:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:56:29,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 07:56:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:56:29,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 07:56:29,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:56:29,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 07:56:29,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:56:29,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 07:56:29,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:56:29,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 07:56:29,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:56:29,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 07:56:29,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:56:30,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 07:56:30,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:56:30,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-10 07:56:30,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:56:30,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292596290] [2024-11-10 07:56:30,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292596290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:56:30,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:56:30,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:56:30,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046271184] [2024-11-10 07:56:30,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:56:30,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:56:30,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:56:30,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:56:30,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:56:30,055 INFO L87 Difference]: Start difference. First operand has 69 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 43 states have internal predecessors, (56), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-10 07:56:30,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:56:30,089 INFO L93 Difference]: Finished difference Result 130 states and 225 transitions. [2024-11-10 07:56:30,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:56:30,092 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 150 [2024-11-10 07:56:30,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:56:30,101 INFO L225 Difference]: With dead ends: 130 [2024-11-10 07:56:30,102 INFO L226 Difference]: Without dead ends: 64 [2024-11-10 07:56:30,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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-10 07:56:30,112 INFO L432 NwaCegarLoop]: 96 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, 96 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-10 07:56:30,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:56:30,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-10 07:56:30,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-10 07:56:30,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 07:56:30,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 96 transitions. [2024-11-10 07:56:30,171 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 96 transitions. Word has length 150 [2024-11-10 07:56:30,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:56:30,172 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 96 transitions. [2024-11-10 07:56:30,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-10 07:56:30,173 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 96 transitions. [2024-11-10 07:56:30,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-10 07:56:30,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:56:30,182 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:56:30,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 07:56:30,183 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:56:30,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:56:30,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1313198245, now seen corresponding path program 1 times [2024-11-10 07:56:30,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:56:30,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943443853] [2024-11-10 07:56:30,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:56:30,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:56:30,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:56:30,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:56:30,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:56:30,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:56:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:56:30,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:56:30,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:56:30,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:56:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:56:30,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:56:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:56:30,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:56:30,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:56:30,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:56:30,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:56:30,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:56:30,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:56:30,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:56:30,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:56:30,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:56:30,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:56:30,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:56:30,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:56:30,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:56:30,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:56:30,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:56:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:56:30,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:56:30,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:56:30,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 07:56:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:56:30,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:56:30,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:56:30,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 07:56:30,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:56:30,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 07:56:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:56:30,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 07:56:30,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:56:30,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 07:56:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:56:30,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 07:56:30,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:56:30,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 07:56:30,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:56:30,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 07:56:30,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:56:30,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 07:56:30,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:56:30,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-10 07:56:30,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:56:30,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943443853] [2024-11-10 07:56:30,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943443853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:56:30,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:56:30,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 07:56:30,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348263214] [2024-11-10 07:56:30,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:56:30,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 07:56:30,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:56:30,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 07:56:30,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 07:56:30,519 INFO L87 Difference]: Start difference. First operand 64 states and 96 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 07:56:30,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:56:30,577 INFO L93 Difference]: Finished difference Result 185 states and 280 transitions. [2024-11-10 07:56:30,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 07:56:30,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 150 [2024-11-10 07:56:30,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:56:30,581 INFO L225 Difference]: With dead ends: 185 [2024-11-10 07:56:30,582 INFO L226 Difference]: Without dead ends: 124 [2024-11-10 07:56:30,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 07:56:30,584 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 84 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:56:30,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 260 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:56:30,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-10 07:56:30,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 68. [2024-11-10 07:56:30,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 07:56:30,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 101 transitions. [2024-11-10 07:56:30,610 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 101 transitions. Word has length 150 [2024-11-10 07:56:30,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:56:30,612 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 101 transitions. [2024-11-10 07:56:30,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 07:56:30,612 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 101 transitions. [2024-11-10 07:56:30,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-10 07:56:30,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:56:30,617 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:56:30,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 07:56:30,618 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:56:30,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:56:30,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1174314588, now seen corresponding path program 1 times [2024-11-10 07:56:30,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:56:30,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669727467] [2024-11-10 07:56:30,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:56:30,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:56:30,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat