./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_25-while_file-6.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-6.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 2523ced2438443f67ce3f9b2a31659324ab8c393814038e5cf118fc2fe7fb5b1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 06:47:14,823 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 06:47:14,886 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 06:47:14,889 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 06:47:14,892 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 06:47:14,909 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 06:47:14,909 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 06:47:14,910 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 06:47:14,910 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 06:47:14,911 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 06:47:14,912 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 06:47:14,912 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 06:47:14,913 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 06:47:14,914 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 06:47:14,914 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 06:47:14,915 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 06:47:14,915 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 06:47:14,915 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 06:47:14,915 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 06:47:14,915 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 06:47:14,916 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 06:47:14,920 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 06:47:14,920 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 06:47:14,920 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 06:47:14,920 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 06:47:14,920 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 06:47:14,921 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 06:47:14,921 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 06:47:14,921 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 06:47:14,921 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 06:47:14,921 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 06:47:14,922 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 06:47:14,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:47:14,922 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 06:47:14,922 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 06:47:14,922 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 06:47:14,922 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 06:47:14,923 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 06:47:14,923 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 06:47:14,923 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 06:47:14,923 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 06:47:14,924 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 06:47:14,924 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 -> 2523ced2438443f67ce3f9b2a31659324ab8c393814038e5cf118fc2fe7fb5b1 [2024-11-20 06:47:15,145 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 06:47:15,165 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 06:47:15,167 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 06:47:15,168 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 06:47:15,169 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 06:47:15,170 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-6.i [2024-11-20 06:47:16,559 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 06:47:16,716 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 06:47:16,717 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-6.i [2024-11-20 06:47:16,724 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7afd237a5/07bf6109b8b74d84aea0a243f179c87c/FLAGcda700d2f [2024-11-20 06:47:16,734 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7afd237a5/07bf6109b8b74d84aea0a243f179c87c [2024-11-20 06:47:16,736 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 06:47:16,737 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 06:47:16,739 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 06:47:16,739 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 06:47:16,743 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 06:47:16,743 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:47:16" (1/1) ... [2024-11-20 06:47:16,744 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17e89655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:16, skipping insertion in model container [2024-11-20 06:47:16,744 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:47:16" (1/1) ... [2024-11-20 06:47:16,764 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 06:47:16,908 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_25-while_file-6.i[914,927] [2024-11-20 06:47:16,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:47:16,962 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 06:47:16,974 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_25-while_file-6.i[914,927] [2024-11-20 06:47:16,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:47:17,015 INFO L204 MainTranslator]: Completed translation [2024-11-20 06:47:17,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:17 WrapperNode [2024-11-20 06:47:17,015 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 06:47:17,016 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 06:47:17,016 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 06:47:17,016 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 06:47:17,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:17" (1/1) ... [2024-11-20 06:47:17,032 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:17" (1/1) ... [2024-11-20 06:47:17,066 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119 [2024-11-20 06:47:17,070 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 06:47:17,071 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 06:47:17,071 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 06:47:17,071 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 06:47:17,080 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:17" (1/1) ... [2024-11-20 06:47:17,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:17" (1/1) ... [2024-11-20 06:47:17,082 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:17" (1/1) ... [2024-11-20 06:47:17,134 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-20 06:47:17,135 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:17" (1/1) ... [2024-11-20 06:47:17,136 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:17" (1/1) ... [2024-11-20 06:47:17,140 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:17" (1/1) ... [2024-11-20 06:47:17,143 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:17" (1/1) ... [2024-11-20 06:47:17,144 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:17" (1/1) ... [2024-11-20 06:47:17,145 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:17" (1/1) ... [2024-11-20 06:47:17,146 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 06:47:17,147 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 06:47:17,147 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 06:47:17,147 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 06:47:17,148 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:17" (1/1) ... [2024-11-20 06:47:17,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:47:17,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:47:17,225 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-20 06:47:17,240 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-20 06:47:17,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 06:47:17,275 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 06:47:17,275 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 06:47:17,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 06:47:17,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 06:47:17,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 06:47:17,338 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 06:47:17,341 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 06:47:17,588 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-20 06:47:17,589 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 06:47:17,604 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 06:47:17,604 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 06:47:17,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:47:17 BoogieIcfgContainer [2024-11-20 06:47:17,605 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 06:47:17,606 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 06:47:17,607 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 06:47:17,609 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 06:47:17,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:47:16" (1/3) ... [2024-11-20 06:47:17,610 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@378e5cb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:47:17, skipping insertion in model container [2024-11-20 06:47:17,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:17" (2/3) ... [2024-11-20 06:47:17,611 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@378e5cb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:47:17, skipping insertion in model container [2024-11-20 06:47:17,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:47:17" (3/3) ... [2024-11-20 06:47:17,613 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-6.i [2024-11-20 06:47:17,625 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 06:47:17,625 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 06:47:17,682 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 06:47:17,688 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;@324444dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 06:47:17,689 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 06:47:17,693 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-20 06:47:17,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-20 06:47:17,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:47:17,705 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:47:17,705 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:47:17,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:47:17,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1492909268, now seen corresponding path program 1 times [2024-11-20 06:47:17,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:47:17,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423484193] [2024-11-20 06:47:17,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:47:17,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:47:17,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:17,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:47:17,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:17,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:47:17,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:17,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 06:47:17,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:17,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:47:17,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:17,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 06:47:17,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:17,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:47:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:17,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:47:17,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:17,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 06:47:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:17,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:47:17,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:17,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 06:47:17,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:17,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:47:17,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:17,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 06:47:17,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:17,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:47:17,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:17,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 06:47:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:17,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:47:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:17,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:47:17,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:17,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:47:17,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:17,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 06:47:17,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:17,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 06:47:17,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:17,997 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-20 06:47:17,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:47:17,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423484193] [2024-11-20 06:47:17,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423484193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:47:17,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:47:17,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 06:47:18,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927551100] [2024-11-20 06:47:18,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:47:18,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 06:47:18,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:47:18,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 06:47:18,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:47:18,022 INFO L87 Difference]: Start difference. First operand has 54 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-20 06:47:18,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:47:18,045 INFO L93 Difference]: Finished difference Result 101 states and 175 transitions. [2024-11-20 06:47:18,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 06:47:18,047 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 118 [2024-11-20 06:47:18,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:47:18,054 INFO L225 Difference]: With dead ends: 101 [2024-11-20 06:47:18,054 INFO L226 Difference]: Without dead ends: 50 [2024-11-20 06:47:18,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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-20 06:47:18,061 INFO L432 NwaCegarLoop]: 74 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, 74 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-20 06:47:18,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:47:18,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-20 06:47:18,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-20 06:47:18,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-20 06:47:18,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 74 transitions. [2024-11-20 06:47:18,092 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 74 transitions. Word has length 118 [2024-11-20 06:47:18,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:47:18,093 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 74 transitions. [2024-11-20 06:47:18,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-20 06:47:18,093 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 74 transitions. [2024-11-20 06:47:18,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-20 06:47:18,095 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:47:18,095 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:47:18,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 06:47:18,096 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:47:18,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:47:18,097 INFO L85 PathProgramCache]: Analyzing trace with hash -2060601006, now seen corresponding path program 1 times [2024-11-20 06:47:18,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:47:18,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118931290] [2024-11-20 06:47:18,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:47:18,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:47:18,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:25,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:47:25,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:25,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:47:25,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:25,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 06:47:25,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:25,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:47:25,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:25,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 06:47:25,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:25,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:47:25,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:25,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:47:25,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:25,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 06:47:25,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:25,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:47:25,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:25,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 06:47:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:25,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:47:25,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:25,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 06:47:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:25,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:47:25,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:25,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 06:47:25,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:25,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:47:25,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:25,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:47:25,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:25,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:47:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:25,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 06:47:25,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:25,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 06:47:25,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:25,553 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-20 06:47:25,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:47:25,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118931290] [2024-11-20 06:47:25,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118931290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:47:25,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:47:25,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 06:47:25,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621529237] [2024-11-20 06:47:25,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:47:25,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 06:47:25,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:47:25,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 06:47:25,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-20 06:47:25,557 INFO L87 Difference]: Start difference. First operand 50 states and 74 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 06:47:30,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-20 06:47:40,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-20 06:47:45,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-20 06:47:49,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-20 06:47:51,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:47:51,950 INFO L93 Difference]: Finished difference Result 167 states and 232 transitions. [2024-11-20 06:47:51,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-20 06:47:51,954 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 118 [2024-11-20 06:47:51,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:47:51,957 INFO L225 Difference]: With dead ends: 167 [2024-11-20 06:47:51,957 INFO L226 Difference]: Without dead ends: 165 [2024-11-20 06:47:51,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2024-11-20 06:47:51,963 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 182 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 62 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.1s IncrementalHoareTripleChecker+Time [2024-11-20 06:47:51,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 399 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 199 Invalid, 4 Unknown, 0 Unchecked, 18.1s Time] [2024-11-20 06:47:51,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-20 06:47:51,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 56. [2024-11-20 06:47:51,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-20 06:47:51,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 83 transitions. [2024-11-20 06:47:51,983 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 83 transitions. Word has length 118 [2024-11-20 06:47:51,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:47:51,985 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 83 transitions. [2024-11-20 06:47:51,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 06:47:51,985 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 83 transitions. [2024-11-20 06:47:51,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-20 06:47:51,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:47:51,987 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:47:51,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 06:47:51,987 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:47:51,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:47:51,988 INFO L85 PathProgramCache]: Analyzing trace with hash -2003342704, now seen corresponding path program 1 times [2024-11-20 06:47:51,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:47:51,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277662414] [2024-11-20 06:47:51,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:47:51,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:47:52,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:48:07,124 WARN L286 SmtUtils]: Spent 6.69s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-20 06:48:10,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:48:10,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:48:10,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:48:10,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:48:10,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 06:48:10,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:48:10,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:48:10,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:48:10,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 06:48:10,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:48:10,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:48:10,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:48:10,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:48:10,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:48:10,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 06:48:10,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:48:10,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:48:10,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:48:10,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 06:48:10,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:48:10,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:48:10,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:48:10,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 06:48:10,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:48:10,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:48:10,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:48:10,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 06:48:10,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:48:11,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:48:11,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:48:11,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:48:11,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:48:11,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:48:11,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:48:11,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 06:48:11,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:48:11,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 06:48:11,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:48:11,316 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-20 06:48:11,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:48:11,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277662414] [2024-11-20 06:48:11,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277662414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:48:11,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:48:11,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-20 06:48:11,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594130580] [2024-11-20 06:48:11,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:48:11,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 06:48:11,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:48:11,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 06:48:11,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-20 06:48:11,321 INFO L87 Difference]: Start difference. First operand 56 states and 83 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-20 06:48:23,465 WARN L286 SmtUtils]: Spent 8.45s on a formula simplification. DAG size of input: 89 DAG size of output: 88 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-20 06:48:30,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-20 06:48:32,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-20 06:48:37,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-20 06:48:41,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.91s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-20 06:48:47,930 WARN L286 SmtUtils]: Spent 6.87s on a formula simplification. DAG size of input: 132 DAG size of output: 131 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-20 06:48:54,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:48:54,154 INFO L93 Difference]: Finished difference Result 145 states and 205 transitions. [2024-11-20 06:48:54,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-20 06:48:54,156 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 118 [2024-11-20 06:48:54,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:48:54,158 INFO L225 Difference]: With dead ends: 145 [2024-11-20 06:48:54,158 INFO L226 Difference]: Without dead ends: 143 [2024-11-20 06:48:54,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 28.4s TimeCoverageRelationStatistics Valid=197, Invalid=403, Unknown=0, NotChecked=0, Total=600 [2024-11-20 06:48:54,160 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 114 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 78 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.6s IncrementalHoareTripleChecker+Time [2024-11-20 06:48:54,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 494 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 255 Invalid, 2 Unknown, 0 Unchecked, 16.6s Time] [2024-11-20 06:48:54,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-20 06:48:54,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 107. [2024-11-20 06:48:54,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 66 states have (on average 1.303030303030303) internal successors, (86), 66 states have internal predecessors, (86), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-20 06:48:54,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 162 transitions. [2024-11-20 06:48:54,178 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 162 transitions. Word has length 118 [2024-11-20 06:48:54,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:48:54,178 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 162 transitions. [2024-11-20 06:48:54,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-20 06:48:54,178 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 162 transitions. [2024-11-20 06:48:54,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-20 06:48:54,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:48:54,180 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:48:54,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 06:48:54,180 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:48:54,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:48:54,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1223349965, now seen corresponding path program 1 times [2024-11-20 06:48:54,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:48:54,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970908491] [2024-11-20 06:48:54,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:48:54,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:48:54,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:48:54,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:48:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:48:54,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:48:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:48:54,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 06:48:54,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:48:54,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:48:54,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:48:54,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 06:48:54,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:48:54,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:48:54,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:48:54,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:48:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:48:54,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 06:48:54,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:48:54,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:48:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:48:54,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 06:48:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:48:54,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:48:54,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:48:54,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 06:48:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:48:54,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:48:54,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:48:54,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 06:48:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:48:54,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:48:54,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:48:54,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:48:54,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:48:54,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:48:54,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:48:54,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 06:48:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:48:54,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 06:48:54,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:48:54,386 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-20 06:48:54,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:48:54,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970908491] [2024-11-20 06:48:54,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970908491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:48:54,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:48:54,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 06:48:54,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146339273] [2024-11-20 06:48:54,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:48:54,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 06:48:54,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:48:54,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 06:48:54,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 06:48:54,390 INFO L87 Difference]: Start difference. First operand 107 states and 162 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 06:48:54,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:48:54,595 INFO L93 Difference]: Finished difference Result 292 states and 440 transitions. [2024-11-20 06:48:54,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 06:48:54,596 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 119 [2024-11-20 06:48:54,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:48:54,598 INFO L225 Difference]: With dead ends: 292 [2024-11-20 06:48:54,598 INFO L226 Difference]: Without dead ends: 188 [2024-11-20 06:48:54,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-20 06:48:54,599 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 76 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 06:48:54,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 239 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 06:48:54,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-20 06:48:54,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 153. [2024-11-20 06:48:54,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 92 states have (on average 1.2934782608695652) internal successors, (119), 92 states have internal predecessors, (119), 57 states have call successors, (57), 3 states have call predecessors, (57), 3 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2024-11-20 06:48:54,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 233 transitions. [2024-11-20 06:48:54,623 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 233 transitions. Word has length 119 [2024-11-20 06:48:54,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:48:54,623 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 233 transitions. [2024-11-20 06:48:54,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 06:48:54,624 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 233 transitions. [2024-11-20 06:48:54,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-20 06:48:54,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:48:54,625 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:48:54,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 06:48:54,625 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:48:54,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:48:54,626 INFO L85 PathProgramCache]: Analyzing trace with hash -2032696591, now seen corresponding path program 1 times [2024-11-20 06:48:54,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:48:54,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528551516] [2024-11-20 06:48:54,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:48:54,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:48:54,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat